The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Journals in DBLP

Math. Log. Q.
1996, volume: 42, number:

  1. Fernando Ferreira
    On End-Extensions of Models of ¬exp. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1996, v:42, n:, pp:1-18 [Journal]
  2. Vladimir Kanovei, Michael Reeken
    Loeb Measure from the Point of View of a Coin Flipping Game. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1996, v:42, n:, pp:19-26 [Journal]
  3. Eduardo Mizraji
    The Operators of Vector Logic. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1996, v:42, n:, pp:27-40 [Journal]
  4. Eugenio G. Omodeo, Franco Parlamento, Alberto Policriti
    Decidability of exist*forall-Sentences in Membership Theories. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1996, v:42, n:, pp:41-58 [Journal]
  5. Michael Rathjen
    The Recursively Mahlo Property in Second Order Arithmetic. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1996, v:42, n:, pp:59-66 [Journal]
  6. V. Yu. Shavrukov
    Remarks on Uniformly Finitely Precomplete Positive Equivalences. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1996, v:42, n:, pp:67-82 [Journal]
  7. Geoffrey LaForte
    The Isolated D. R. E. Degrees are Dense in the R. E. Degrees. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1996, v:42, n:, pp:83-103 [Journal]
  8. Olivier Esser
    Inconsistency of GPK + AFA. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1996, v:42, n:, pp:104-108 [Journal]
  9. Ivan N. Soskov
    Intrinsically II11 Relations. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1996, v:42, n:, pp:109-126 [Journal]
  10. Caterina Bianchini, Andrea Sorbi
    A Note an Closed Degrees of Difculty of the Medvedev Lattice. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1996, v:42, n:, pp:127-133 [Journal]
  11. Salah Labhalla, Henri Lombardi
    Analyse de complexité pour un théorème de Hall sur les fractions continues. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1996, v:42, n:, pp:134-144 [Journal]
  12. Frank Wolter
    Tense Logic Without Tense Operators. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1996, v:42, n:, pp:145-171 [Journal]
  13. Markus Huberich
    A Note on Boolean Algebras with Few Partitions Modulo some Filter. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1996, v:42, n:, pp:172-174 [Journal]
  14. Peter Apostoli
    Modal Aggregation and the Theory of Paraconsistent Filters. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1996, v:42, n:, pp:175-190 [Journal]
  15. S. Barry Cooper
    Strong Minimal Covers for Recursively Enumerableg. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1996, v:42, n:, pp:191-196 [Journal]
  16. Claudio Cerrato
    Modal Tree-Sequents. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1996, v:42, n:, pp:197-210 [Journal]
  17. Arthur W. Apter
    A Cardinal Pattern Inspired by AD. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1996, v:42, n:, pp:211-218 [Journal]
  18. John L. Bell
    Polymodal Lattices and Polymodal Logic. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1996, v:42, n:, pp:219-233 [Journal]
  19. Lo Czukai, Renren Liu
    The Maximal Closed Classes of Unary Functions in p-Valued Logic. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1996, v:42, n:, pp:234-240 [Journal]
  20. Valentina S. Harizanov
    Effectively and Noneffectively Nowhere Simple Sets. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1996, v:42, n:, pp:241-248 [Journal]
  21. Xiaoding Yi
    Splittings of 0' into the Recursively Enumerable Degrees. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1996, v:42, n:, pp:249-269 [Journal]
  22. Andrea Cantini
    Asymmetric Interpretations for Bounded Theories. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1996, v:42, n:, pp:270-288 [Journal]
  23. John L. Bell, Silvia Gebellato
    Precovers, Modalities and Universal Closure Operators in a Topos. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1996, v:42, n:, pp:289-299 [Journal]
  24. Silvio Valentini
    Decidability in Intuitionistic Type Theory is Functionally Decidable. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1996, v:42, n:, pp:300-304 [Journal]
  25. Giacomo Bonanno
    On the Logic of Common Belief. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1996, v:42, n:, pp:305-311 [Journal]
  26. Holger Petersen
    The Computation of Partial Recursive Word-Functions Without Read Instructions. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1996, v:42, n:, pp:312-318 [Journal]
  27. Matthias Baaz, Norbert Brunner, Karl Svozil
    The Axiom of Choice in Quantum Theory. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1996, v:42, n:, pp:319-340 [Journal]
  28. Joaquín Borrego-Díaz, Alejandro Fernández-Margarit, Mario J. Pérez-Jiménez
    On Overspill Principles and Axiom Schemes for Bounded Formulas. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1996, v:42, n:, pp:341-348 [Journal]
  29. Karim Nour
    Storage Operators and forall-positive Types in TTR Type System. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1996, v:42, n:, pp:349-368 [Journal]
  30. Carlo Toffalori
    Decidability for Z[G]-Modules when G is Cyclic of Prime Order. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1996, v:42, n:, pp:369-378 [Journal]
  31. Qing Zhou
    Computable Real-Valued Functions on Recursive Open and Closed Subsets of Euclidean Sp ace. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1996, v:42, n:, pp:379-409 [Journal]
  32. Paul E. Howard, Jean E. Rubin
    The Boolean Prime Ideal Theorem Plus Countable Choice Do Not Imply Dependent Choice. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1996, v:42, n:, pp:410-420 [Journal]
  33. Tapani Hyttinen
    Forking and Incomplete Types. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1996, v:42, n:, pp:421-432 [Journal]
  34. Carlo Toffalori
    Some Decidability Results for Z[G]-Modules when G is Cyclic of Squarefree Order. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1996, v:42, n:, pp:433-445 [Journal]
  35. Dario Maguolo, Silvio Valentini
    An Intuitionistic Version of Cantor's Theorem. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1996, v:42, n:, pp:446-448 [Journal]
  36. George Tourlakis
    Recursion in Partial Type-1 Objects With Well-Behaved Oracles. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1996, v:42, n:, pp:449-460 [Journal]
  37. Christopher J. Ash, Julia F. Knight
    Recursive Structures and Ershov's Hierarchy. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1996, v:42, n:, pp:461-468 [Journal]
  38. Ivan N. Soskov
    Intrinsically Hyperarithmetical Sets. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1996, v:42, n:, pp:469-480 [Journal]
  39. Frank Wolter
    Properties of Tense Logics. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1996, v:42, n:, pp:481-500 [Journal]
  40. Guido Bertolotti, Pierangelo Miglioli, Daniela Silvestrini
    Exhibiting Wide Families of Maximal Intermediate Propositional Logics with the Disjunction Property. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1996, v:42, n:, pp:501-536 [Journal]
  41. J. Donald Monk
    Minimum-sized Infinite Partitions of Boolean Algebras. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1996, v:42, n:, pp:537-550 [Journal]
  42. Lawrence Peter Belluce, Antonio di Nola
    Yosida Type Representation for Perfect MV-Algebras. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1996, v:42, n:, pp:551-563 [Journal]
  43. Kam-Chau Wong
    Computability of Minimizers and Separating Hyperplanes. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1996, v:42, n:, pp:564-568 [Journal]
  44. Martin Grohe
    Some Remarks on Finite Löwenheim-Skolem Theorems. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1996, v:42, n:, pp:569-571 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002