The SCEAS System
Navigation Menu

Journals in DBLP

J. Symb. Log.
1976, volume: 41, number: 1

  1. Chi Tat Chong
    An alpha-Finite Injury Method of the Unbounded Type. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1976, v:41, n:1, pp:1-17 [Journal]
  2. Michael Beeson
    The Unprovability in Intuitionistic Formal Systems of the Continuity of Effective Operations on the Reals. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1976, v:41, n:1, pp:18-24 [Journal]
  3. Julia F. Knight
    Omitting Types in Set Theory and Arithmetic. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1976, v:41, n:1, pp:25-32 [Journal]
  4. William Boos
    Infinitary Compactness without Strong Inaccessibility. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1976, v:41, n:1, pp:33-38 [Journal]
  5. Charles E. Hughes
    Two Variable Implicational Calculi of Prescribed Many-One Degrees of Unsolvability. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1976, v:41, n:1, pp:39-44 [Journal]
  6. Charles E. Hughes
    A Reduction Class Containing Formulas with one Monadic Predicate and one Binary Function Symbol. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1976, v:41, n:1, pp:45-49 [Journal]
  7. Ronald Fagin
    Probabilities on Finite Models. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1976, v:41, n:1, pp:50-58 [Journal]
  8. Victor Harnik
    Approximation Theorems and Model Theoretic Forcing. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1976, v:41, n:1, pp:59-72 [Journal]
  9. Zofia Adamowicz
    One More Aspect of Forcing and Omitting Types. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1976, v:41, n:1, pp:73-80 [Journal]
  10. Dov M. Gabbay
    Completeness Properties of Heyting's Predicate Calculus with Respect to RE Models. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1976, v:41, n:1, pp:81-94 [Journal]
  11. Volker Weispfenning
    Negative-Existentially Complete Structures and Definability in Free Extensions. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1976, v:41, n:1, pp:95-108 [Journal]
  12. Anders M. Nyberg
    Uniform Inductive Definability and Infinitary Languages. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1976, v:41, n:1, pp:109-120 [Journal]
  13. Krzysztof R. Apt
    Semantics of the Infinitistic Rules of Proof. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1976, v:41, n:1, pp:121-138 [Journal]
  14. John E. Hutchinson
    Elementary Extensions of Countable Models of Set Theory. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1976, v:41, n:1, pp:139-145 [Journal]
  15. Seth Catlin
    ED-Regressive Sets of Order n. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1976, v:41, n:1, pp:146-152 [Journal]
  16. Leo Harrington, David B. MacQueen
    Selection in Abstract Recursion Theory. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1976, v:41, n:1, pp:153-158 [Journal]
  17. Wim Veldman
    An Intuitionistic Completeness Theorem for Intuitionistic Predicate Logic. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1976, v:41, n:1, pp:159-166 [Journal]
  18. Leo Harrington, Thomas Jech
    On sigma1 Well-Orderings of the Universe. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1976, v:41, n:1, pp:167-170 [Journal]
  19. Victor Harnik, Michael Makkai
    Applications of Vaught Sentences and the Covering Theorem. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1976, v:41, n:1, pp:171-187 [Journal]
  20. Douglas A. Cenzer
    Monotone Inductive Definitions over the Continuum. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1976, v:41, n:1, pp:188-198 [Journal]
  21. Donald A. Alton
    Diversity of Speed-Ups and Embeddability in Computational Complexity. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1976, v:41, n:1, pp:199-214 [Journal]
  22. Leo Marcus
    The <-Order on Submodels. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1976, v:41, n:1, pp:215-221 [Journal]
  23. S. Kamal Abdali
    An Abstraction Algorithm for Combinatory Logic. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1976, v:41, n:1, pp:222-224 [Journal]
  24. Telis Menas
    A Combinatorial Property of p kappa lambda. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1976, v:41, n:1, pp:225-234 [Journal]
  25. Louise Hay
    Boolean Combinations of R.E. Open Sets. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1976, v:41, n:1, pp:235-238 [Journal]
  26. Krister Segerberg
    The Truth about Some Post Numbers. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1976, v:41, n:1, pp:239-244 [Journal]
  27. Bernd Koppelberg, Sabine Koppelberg
    A Boolean Ultrapower which is not an Ultrapower. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1976, v:41, n:1, pp:245-249 [Journal]
  28. Chi Tat Chong
    Minimal Upper Bounds for Ascending Sequences of alpha-Recursively Enumerable Degrees. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1976, v:41, n:1, pp:250-260 [Journal]
  29. G. H. Muller, Arnold Oberschelp, K. Potthoff
    European Meeting of the Association for Symbolic Logic, Kiel, Federal Republic of Germany, 1974. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1976, v:41, n:1, pp:261-278 [Journal]
  30. James C. Owings, Hilary Putnam, Gerald E. Sacks
    Meeting of the Association for Symbolic Logic Washington, D.C., 1975. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1976, v:41, n:1, pp:279-288 [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