The SCEAS System
Navigation Menu

Journals in DBLP

J. Symb. Log.
1996, volume: 61, number: 4

  1. Dov M. Gabbay
    Fibred Semantics and the Weaving of Logics, Part 1: Modal and Intuitionistic Logics. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1996, v:61, n:4, pp:1057-1120 [Journal]
  2. Françoise Delon, Rafel Farré
    Some Model Theory for Almost Real Closed Fields. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1996, v:61, n:4, pp:1121-1152 [Journal]
  3. José Carlos Cifuentes, Antonio Mario Sette, Daniele Mundici
    Cauchy Completeness in Elementary Logic. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1996, v:61, n:4, pp:1153-1157 [Journal]
  4. Masahiro Kumabe
    Minimal Complementation Below Uniform Upper Bounds for the Arithmetical Degrees. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1996, v:61, n:4, pp:1158-1192 [Journal]
  5. Grigori Mints
    Strong Termination for the Epsilong Substitution Method. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1996, v:61, n:4, pp:1193-1205 [Journal]
  6. Shmuel Lifsches, Saharon Shelah
    Uniformization, Choice Functions and Well Orders in the Class of Trees. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1996, v:61, n:4, pp:1206-1227 [Journal]
  7. Alessandro Berarducci, Margarita Otero
    A Recursive Nonstandard Model of Normal Open Induction. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1996, v:61, n:4, pp:1228-1241 [Journal]
  8. Pilar Dellunde, Ramon Jansana
    Some Characterization Theorems for Infinitary Universal Horn Logic Without Equality. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1996, v:61, n:4, pp:1242-1260 [Journal]
  9. Saharon Shelah
    If There Is an Exactly lambda-free Abelian Group There There Is an Exactly lambda-Separable One in lambda. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1996, v:61, n:4, pp:1261-1278 [Journal]
  10. James Loveys, Predrag Tanovic
    Countable Models of Trivial Theories Which Admit Finite Coding. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1996, v:61, n:4, pp:1279-1286 [Journal]
  11. Abhijit Dasgupta
    Boolean Operations, Borel Sets, and Hausdorff's Question. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1996, v:61, n:4, pp:1287-1304 [Journal]
  12. Michael C. Laskowski, Saharon Shelah
    Forcing Isomorphism II. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1996, v:61, n:4, pp:1305-1320 [Journal]
  13. Ross T. Brady
    Simple Gentzenizations for the Normal Formulae of Contraction-Less Logics. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1996, v:61, n:4, pp:1321-1346 [Journal]
  14. S. Barry Cooper, Andrea Sorbi
    Noncappable Enumeration Degrees Below 0'e. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1996, v:61, n:4, pp:1347-1363 [Journal]
  15. William C. Calhoun, Theodore A. Slaman
    The Pi20 Enumeration Degrees Are Not Dense. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1996, v:61, n:4, pp:1364-1379 [Journal]
  16. Thomas Jech, Saharon Shelah
    On Countably Closed Complete Boolean Algebras. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1996, v:61, n:4, pp:1380-1386 [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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002