The SCEAS System
Navigation Menu

Journals in DBLP

J. Symb. Log.
1995, volume: 60, number: 1

  1. Saharon Shelah, Lee J. Stanley
    A Combinatorial Forcing for Coding the Universe by a Real When There Are No Sharps. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1995, v:60, n:1, pp:1-35 [Journal]
  2. Saharon Shelah, Lee J. Stanley
    The Combinatorics of Combinatorial Coding by a Real. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1995, v:60, n:1, pp:36-57 [Journal]
  3. Martin Goldstern, Saharon Shelah
    The Bounded Proper Forcing Axiom. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1995, v:60, n:1, pp:58-73 [Journal]
  4. Lou van den Dries, Adam H. Lewenberg
    T-Convexity and Tame Extensions. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1995, v:60, n:1, pp:74-102 [Journal]
  5. Aleksandar Ignjatovic
    Delineating Classes of Computational Complexity via Second Order Theories with Weak Set Existence Principles, I. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1995, v:60, n:1, pp:103-121 [Journal]
  6. Rolando Chuaqui, Patrick Suppes
    Free-Variable Axiomatic Foundations of Infinitesimal Analysis: A Fragment with Finitary Consistency Proof. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1995, v:60, n:1, pp:122-159 [Journal]
  7. Masanao Ozawa
    Scott Incomplete Boolean Ultrapowers of the Real Line. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1995, v:60, n:1, pp:160-171 [Journal]
  8. James M. Henle
    The Consistency of One Fixed Omega. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1995, v:60, n:1, pp:172-177 [Journal]
  9. M. Randall Holmes
    The Equivalence of NF-Style Set Theories with ``Tangled'' Type Theories; The Construction of omega-Models of Predicative NF (and More). [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1995, v:60, n:1, pp:178-190 [Journal]
  10. Jan Mycielski
    New Set-Theoretic Axioms Derived from a Lean Metamathematics. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1995, v:60, n:1, pp:191-198 [Journal]
  11. Carl G. Jockusch Jr., Alexandra Shalpentokh
    Weak Presentation of Computable Fields. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1995, v:60, n:1, pp:199-208 [Journal]
  12. J. L. Bell
    Type Reducing Correspondences and Well-Orderings: Frege's and Zermelo's Constructions Re-examined. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1995, v:60, n:1, pp:209-221 [Journal]
  13. Julia F. Knight
    Requirement Systems. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1995, v:60, n:1, pp:222-245 [Journal]
  14. John T. Baldwin, Saharon Shelah
    Abstract Classes with Few Models Have `Homogeneous-Universal' Models. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1995, v:60, n:1, pp:246-265 [Journal]
  15. Vladimir V. Rybakov
    Hereditarily Structurally Complete Modals Logics. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1995, v:60, n:1, pp:266-288 [Journal]
  16. Victor L. Selivanov
    Fine Hierarchies and Boolean Terms. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1995, v:60, n:1, pp:289-317 [Journal]
  17. Vladimir Kanovei
    Uniqueness, Collection, and External Collapse of Cardinals in IST and Models of Peano Arithmetic. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1995, v:60, n:1, pp:318-324 [Journal]
  18. Thierry Coquand
    A Semantics of Evidence for Classical Arithmetic. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1995, v:60, n:1, pp:325-337 [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