2003-11-20 Simplest Normal Truth Functions. 105-108 1955 20 J. Symb. Log. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml20.html#Nelson55 2003-11-20 Twenty-Fifth Annual Meeting of the Association for Symbolic Logic. 93-96 1960 25 J. Symb. Log. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml25.html#Nelson60 2003-11-20 Non-Null Implication. 562-572 1966 31 J. Symb. Log. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml31.html#Nelson66 2003-11-20 Logic of Reduced Power Structures. 53-59 1983 48 J. Symb. Log. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml48.html#Nelson83 2003-11-20 Lower Bounds for Cutting Planes Proofs with Small Coefficients. 708-728 1997 62 J. Symb. Log. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml62.html#BonetPR97 2003-11-20 Sur Les Types Des Propositions Composees. 98-103 1940 5 J. Symb. Log. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml5.html#Polya40 2003-11-20 Meeting of the Association for Symbolic Logic: Sydney, 1984. 503-506 1986 51 J. Symb. Log. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml51.html#Staines86 2003-11-20 Strongly Majorizable Functionals of Finite Type: A Model for Barrecursion Containing Discontinuous Functionals. 652-660 1985 50 J. Symb. Log. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml50.html#Bezem85a 2003-11-20 The Theory of the Recursively Enumerable Weak Truth-Table Degrees Is Undecidability. 864-874 1992 57 J. Symb. Log. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml57.html#Ambos-SpiesNS92 2003-11-20 Quantifying over Propositions in Relevance Logic: Nonaxiomatisability of Primary Interpretations of forall p and exists p. 334-349 1993 58 J. Symb. Log. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml58.html#Kremer93 2003-11-20 On the Complexity of Propositional Quantification in Intuitionistic Logic. 529-544 1997 62 J. Symb. Log. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml62.html#Kremer97 2003-11-20 Logical Connectives for Intuitionistic Propositional Logic. 15-20 1971 36 J. Symb. Log. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml36.html#McCullough71 2003-11-20 Killing Ideals and Adding Reals. 747-755 2000 65 J. Symb. Log. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml65.html#Zapletal00 2003-11-20 Splitting Number at Uncountable Cardinals. 35-42 1997 62 J. Symb. Log. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml62.html#Zapletal97 2003-11-20 Preserving sigma-Ideals. 1437-1441 1998 63 J. Symb. Log. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml63.html#Zapletal98 2003-11-20 Countable Vector Spaces with Recursive Operations. Part I. 363-387 1969 34 J. Symb. Log. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml34.html#Dekker69 2003-11-20 Countable Vector Spaces with Recursive Operations. Part II. 477-493 1971 36 J. Symb. Log. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml36.html#Dekker71 2003-11-20 Projective Planes of Infinite But Isolic Order. 391-404 1976 41 J. Symb. Log. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml41.html#Dekker76 2003-11-20 Twilight Graphs. 539-571 1981 46 J. Symb. Log. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml46.html#Dekker81 2003-11-20 The Inclusion-Exclusion Principle for Finitely Many Isolated Sets. 435-447 1986 51 J. Symb. Log. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml51.html#Dekker86 2003-11-20 A Direct Proof of the Feferman-Vaught Theorem and Other Preservations Theorems in Products. 632-636 1991 56 J. Symb. Log. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml56.html#Vourtsanis91 2003-11-20 Almost Disjoint Sets and Martin's Axiom. 313-318 1979 44 J. Symb. Log. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml44.html#Wage79 2003-11-20 Schemas Pour Le Calcul Des Propositions Fonde Sur La Conjonction Et La Negation. 421-431 1958 23 J. Symb. Log. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml23.html#Porte58 2003-11-20 Antitheses in Systems of Relevant Implication. 97-99 1983 48 J. Symb. Log. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml48.html#Porte83 2003-11-20 Congruence Relations on Lattices of Recursively Enumerable Sets. 497-504 2002 67 J. Symb. Log. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml67.html#Hammond02 2003-11-20 Nonisomorphism of Lattices of Recursively Enumerable Sets. 1177-1188 1993 58 J. Symb. Log. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml58.html#Hammond93 2003-11-20 ⁰₃Quotient Lattices of Epsilon. 1403-1406 1999 64 J. Symb. Log. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml64.html#Hammond99 2003-11-20 On the Restricted Ordinal Theorem. 33-41 1944 9 J. Symb. Log. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml9.html#Goodstein44 2003-11-20 Transfinite Ordinals in Recursive Number Theory. 123-129 1947 12 J. Symb. Log. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml12.html#Goodstein47 2003-11-20 A Problem in Recursive Function Theory. 225-232 1953 18 J. Symb. Log. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml18.html#Goodstein53 2003-11-20 The Recursive Irrationality of |pi. 267-274 1954 19 J. Symb. Log. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml19.html#Goodstein54 2003-11-20 On the Formalisation of Indirect Discourse. 417-419 1958 23 J. Symb. Log. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml23.html#Goodstein58 2004-03-01 On Central Extensions of Algebraic Groups. 68-74 1999 64 J. Symb. Log. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml64.html#AltinelC99 2003-11-20 On Orbits of Prompt and Low Computably Enumerable Sets. 649-678 2002 67 J. Symb. Log. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml67.html#Wald02 2003-11-20 Ideal Models and Some Not so Ideal Problems in the Model Theory of L(Q). 304-321 1978 43 J. Symb. Log. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml43.html#Bruce78 2003-11-20 Model Constructions in Stationary Logic. Part I. Forcing. 439-454 1980 45 J. Symb. Log. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml45.html#Bruce80 2003-11-20 A System of Completely Independent Axioms for the Sequence of Natural Numbers. 41-44 1943 8 J. Symb. Log. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml8.html#Wang43 2003-11-20 A Note on Quine's Principles of Quantification. 130-132 1947 12 J. Symb. Log. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml12.html#Wang47 2003-11-20 A New Theory of Element and Number. 129-137 1948 13 J. Symb. Log. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml13.html#Wang48 2003-11-20 A Formal System of Logic. 25-32 1950 15 J. Symb. Log. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml15.html#Wang50 2003-11-20 Logic of Many-Sorted Theories. 105-116 1952 17 J. Symb. Log. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml17.html#Wang52 2003-11-20 Certain Predicates Defined by Induction Schemata. 49-59 1953 18 J. Symb. Log. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml18.html#Wang53 2003-11-20 The Formalization of Mathematics. 241-266 1954 19 J. Symb. Log. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml19.html#Wang54 2003-11-20 Undecidable Sentences Generated by Semantic Paradoxes. 31-43 1955 20 J. Symb. Log. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml20.html#Wang55 2003-11-20 The Axiomatization of Arithmetic. 145-158 1957 22 J. Symb. Log. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml22.html#Wang57 2003-11-20 Alternative Proof of a Theorem of Kleene. 250 1958 23 J. Symb. Log. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml23.html#Wang58 2003-11-20 Some Facts About Kurt Godel. 653-659 1981 46 J. Symb. Log. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml46.html#Wang81 2003-11-20 The McKinsey Axiom Is Not Compact. 1230-1238 1992 57 J. Symb. Log. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml57.html#Wang92 2006-02-09 Almost Local Non-a-Recursiveness. 552-562 1974 39 J. Symb. Log. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml39.html#Chong74 2003-11-20 Propositional Logic Based on the Dynamics of Belief. 390-394 1985 50 J. Symb. Log. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml50.html#Gardenfors85 2003-11-20 On Notation for Ordinal Numbers. 150-155 1938 3 J. Symb. Log. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml3.html#Kleene38a 2003-11-20 A Complete Infinitary Logic. 730-746 1976 41 J. Symb. Log. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml41.html#Slonneger76 2003-11-20 On The Commutativity of Jumps. 1725-1748 2000 65 J. Symb. Log. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml65.html#McNicholl00 2003-11-20 On The Convergence of Query-Bounded Computations and Logical Closure Properties of C.E. Sets. 1543-1560 2001 66 J. Symb. Log. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml66.html#McNicholl01 2003-11-20 A Set of Axioms for Logic. 1-19 1944 9 J. Symb. Log. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml9.html#Hailperin44 2003-11-20 Quantification Theory and Empty Individual-Domains. 197-200 1953 18 J. Symb. Log. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml18.html#Hailperin53 2003-11-20 Remarks on Identity and Description in First-Order Axiom Systems. 14-20 1954 19 J. Symb. Log. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml19.html#Hailperin54 2003-11-20 A Theory of Restricted Quantification I. 19-35 1957 22 J. Symb. Log. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml22.html#Hailperin57 2003-11-20 Corrections to a Theory of Restricted Quantification. 54-56 1960 25 J. Symb. Log. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml25.html#Hailperin60 2003-11-20 An Incorrect Theorem. 27 1965 30 J. Symb. Log. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml30.html#Hailperin65 2003-11-20 Why Some People are Excited by Vaught's Conjecture. 973-982 1985 50 J. Symb. Log. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml50.html#Lascar85a 2003-11-20 Hyperimaginaries and Automorphism Groups. 127-143 2001 66 J. Symb. Log. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml66.html#LascarP01 2003-11-20 An Introduction to Forking. 330-350 1979 44 J. Symb. Log. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml44.html#LascarP79 2003-11-20 Forking and Fundamental Order in Simple Theories. 1155-1158 1999 64 J. Symb. Log. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml64.html#LascarP99 2003-11-20 Vaught's Conjecture for Modules Over A Serial Ring. 155-163 2000 65 J. Symb. Log. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml65.html#Puninskaya00 2003-11-20 Modules with Few Types over A Hereditary Noetherian Prime Ring. 271-280 2001 66 J. Symb. Log. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml66.html#Puninskaya01 2003-11-20 Elementary Completeness Properties of Intuitionistic Logic With a Note on Negations of Prenex Formulae. 317-330 1958 23 J. Symb. Log. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml23.html#Kreisel58a 2003-11-20 A Remark on Free Choice Sequences and the Topological Completeness Proofs. 369-388 1958 23 J. Symb. Log. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml23.html#Kreisel58b 2003-11-20 Metarecursive Sets. 318-338 1965 30 J. Symb. Log. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml30.html#KreiselS65 2006-02-09 An alpha-Finite Injury Method of the Unbounded Type. 1-17 1976 41 J. Symb. Log. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml41.html#Chong76 2006-02-09 Double Jumps of Minimal Degrees Over Cardinals. 329-334 1982 47 J. Symb. Log. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml47.html#Chong82 2006-02-09 Hyperhypersimple Supersets in Admissible Recursion Theory. 185-192 1983 48 J. Symb. Log. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml48.html#Chong83 2003-11-20 Degrees of Continuous Functionals. 393-395 1973 38 J. Symb. Log. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml38.html#Hinman73 2003-11-20 Stationary Reflection for Uncountable Cofinality. 147-151 1986 51 J. Symb. Log. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml51.html#Komjath86 2003-11-20 Morasses and the Levy-Collapse. 111-115 1987 52 J. Symb. Log. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml52.html#Komjath87 2003-11-20 A Set Mapping with No Infinite Free Subsets. 1400-1402 1991 56 J. Symb. Log. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml56.html#Komjath91 2003-11-20 Some Remarks on the Partition Calculus of Ordinals. 436-442 1999 64 J. Symb. Log. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml64.html#Komjath99 2003-11-20 The Elimination of De Re Modalities. 329-330 1969 34 J. Symb. Log. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml34.html#Cresswell69a 2003-11-20 ₀-Categorical Structures Without the Independence Property. 640-652 1996 61 J. Symb. Log. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml61.html#Ensley96 2003-11-20 Cardinal Collapsing and Ordinal Definability. 635-642 1978 43 J. Symb. Log. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml43.html#Stepanek78 2003-11-20 Fat sets and saturated ideals. 837-845 2003 68 J. Symb. Log. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml68.html#Krueger03 2003-11-20 Ikp and Friends. 1295-1322 2002 67 J. Symb. Log. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml67.html#Lubarsky02 2003-11-20 Simple R. E. Degree Structures. 208-213 1987 52 J. Symb. Log. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml52.html#Lubarsky87 2003-11-20 Correction to "Simple R. E. Degree Structures". 103-104 1988 53 J. Symb. Log. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml53.html#Lubarsky88 2003-11-20 Sacks Forcing Sometimes Needs Help to Produce a Minimal Upper Bound. 490-498 1989 54 J. Symb. Log. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml54.html#Lubarsky89 2003-11-20 An Introduction to gamma-Recursion Theory (Or What to Do in KP-Foundation). 194-206 1990 55 J. Symb. Log. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml55.html#Lubarsky90 2003-11-20 µ-Definable Sets of Integers. 291-313 1993 58 J. Symb. Log. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml58.html#Lubarsky93 2003-12-22 European Summer Meeting of the Association for Symbolic Logic: Manchester, England, 1984. 480-502 1986 51 J. Symb. Log. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml51.html#AczelPWWY86 2003-11-20 Counting Finite Models. 925-949 1997 62 J. Symb. Log. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml62.html#Woods97 2003-11-20 Meeting of the Association for Symbolic Logic: Hamilton, New Zealand, 1979. 204-206 1981 46 J. Symb. Log. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml46.html#MalcolmC81 2003-11-20 Meeting of the Association for Symbolic Logic: Wellington, New Zealand, 1981. 519-526 1983 48 J. Symb. Log. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml48.html#MalcolmC83 2003-11-20 The False Assumption Underlying Berry's Paradox. 1220-1223 1988 53 J. Symb. Log. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml53.html#French88 2003-11-20 The Relative Expressive Power of Some Logics Extending First-Order Logic. 129-146 1979 44 J. Symb. Log. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml44.html#Cowles79 2003-11-20 Choice Principles, the Bar Rule and Autonomously Iterated Comprehension Schemes in Analysis. 63-70 1983 48 J. Symb. Log. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml48.html#FefermanJ83 2003-11-20 Incompleteness Along Paths in Progressions of Theories. 383-390 1962 27 J. Symb. Log. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml27.html#FefermanS62 2003-11-20 Indécidabilité de la Théorie des Paires Immédiates de Corps Valués Henseliens. 1236-1242 1991 56 J. Symb. Log. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml56.html#Delon91a 2003-11-20 Some Model Theory for Almost Real Closed Fields. 1121-1152 1996 61 J. Symb. Log. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml61.html#DelonF96 2003-11-20 XVIIème Problème de Hilbert sur les Corps Chaiîne-Clos. 853-861 1991 56 J. Symb. Log. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml56.html#DelonG91 2003-11-20 Inclusions et Produits de Groupes Abeliens Ordonnes Etudies au Premier Ordre. 499-511 1989 54 J. Symb. Log. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml54.html#DelonL89 2003-11-20 Indecidabilite de Corps de Series Formelles. 1227-1234 1988 53 J. Symb. Log. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml53.html#DelonR88 2003-11-20 Undecidable Wreath Products and Skew Power Series Fields. 237-246 1998 63 J. Symb. Log. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml63.html#DelonS98 2003-11-20 Un Principe D'Ax-Kochen-Ershov Pour Des Structures Intermédiaires Entre Groupes Et Corps Valués. 991-1027 1999 64 J. Symb. Log. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml64.html#DelonS99 2006-03-02 Redundancies in the Hilbert-Bernays Derivability Conditions for Gödel's Second Incompleteness Theorem. 359-367 1973 38 J. Symb. Log. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml38.html#Jeroslow73 2003-11-20 Determinateness of Certain Almost-Borel Games. 569-579 1985 50 J. Symb. Log. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml50.html#Wolf85 2003-11-20 Prime Model Extensions for Differential Fields of Characteristic p ? 0. 469-477 1974 39 J. Symb. Log. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml39.html#Wood74 2003-11-20 Notes on the Stability of Separably Closed Fields. 412-416 1979 44 J. Symb. Log. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml44.html#Wood79 2003-11-20 Investigation of the Equivalence of the Axiom of Choice and Zorn's Lemma from the Viewpoint of the Hierarchy of Types. 125-135 1953 18 J. Symb. Log. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml18.html#Buchi53 2003-11-20 State-Strategies for Games in F G. 1171-1198 1983 48 J. Symb. Log. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml48.html#Buchi83 2003-11-20 Natural Well-Orderings. 288-300 1971 36 J. Symb. Log. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml36.html#Isles71 2003-12-11 A Partial Model of NP with E. 1245-1253 1994 59 J. Symb. Log. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml59.html#Prati94 2003-11-20 Answer to a Problem Raised by J. Robinson: the Arithmetic of Positive or Negative Integers is Definable From Successor and Divisibility. 927-935 1985 50 J. Symb. Log. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml50.html#Richard85 2003-11-20 Definability in Terms of the Successor Function and the Coprimeness Predicate in the Set of Arbitrary Integers. 1253-1287 1989 54 J. Symb. Log. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml54.html#Richard89 2003-11-20 On Computational Complexity in Weakly Admissible Structures. 353-358 1980 45 J. Symb. Log. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml45.html#Stoltenberg-Hansen80 2003-11-20 Complexity of kappa-Ultrafilters and Inner Models with Measurable Cardinals. 833-841 1984 49 J. Symb. Log. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml49.html#Sureson84 2003-11-20 UFA Fails in the Bell-Kunen Model. 284-296 1990 55 J. Symb. Log. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml55.html#Merrill90 2003-11-20 Constructibility as a Criterion for Existence. 36-39 1936 1 J. Symb. Log. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml1.html#Rosser36 2003-11-20 Godel Theorems for Non-Constructive Logics. 129-137 1937 2 J. Symb. Log. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml2.html#Rosser37 2003-11-20 On the Consistency of Quine's New Foundations for Mathematical Logic. 15-24 1939 4 J. Symb. Log. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml4.html#Rosser39 2003-11-20 The Independence of Quine's Axioms *200 and *201. 96-97 1941 6 J. Symb. Log. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml6.html#Rosser41 2003-11-20 The Burali-Forti Paradox. 1-17 1942 7 J. Symb. Log. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml7.html#Rosser42 2003-11-20 The Axiom of Infinity in Quine's New Foundations. 238-242 1952 17 J. Symb. Log. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml17.html#Rosser52 2003-11-20 Index Sets in Ershov's Hierarchy. 97-104 1974 39 J. Symb. Log. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml39.html#Grassin74 2003-11-20 The Generalised RK-Order, Orthogonality and Regular Types for Modules. 202-219 1985 50 J. Symb. Log. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml50.html#Prest85 2003-11-20 Tensor Product and Theories of Modules. 617-628 1999 64 J. Symb. Log. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml64.html#Prest99 2003-11-20 Definability in the Monadic Second-Order Theory of Successor. 166-170 1969 34 J. Symb. Log. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml34.html#BuchiL69 2003-11-20 On Definition Trees of Ordinal Recursive Functonals: Reduction of the Recursion Orders by Means of Type Level Raising. 395-402 1982 47 J. Symb. Log. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml47.html#Terlouw82 2003-11-20 On the Embedding of alpha-Recursive Presentable Lattices into the alpha-Recursive Degrees Below 0'. 488-502 1984 49 J. Symb. Log. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml49.html#Yang84 2003-11-20 ^-₁₂. 505-511 1995 60 J. Symb. Log. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml60.html#Yang95 2003-11-20 Positive abstraction and extensionality. 828-836 2003 68 J. Symb. Log. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml68.html#HinnionL03 2003-11-20 Uniqueness of Normal Proofs of Minimal Formulas. 789-799 1993 58 J. Symb. Log. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml58.html#Tatsuta93 2003-11-20 Minimum Models of Analysis. 48-54 1972 37 J. Symb. Log. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml37.html#Shilleto72 2003-11-20 On Propositions Neither Necessary Nor Impossible. 105-108 1953 18 J. Symb. Log. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml18.html#Prior53 2003-11-20 Modality and Quantification in S5. 60-62 1956 21 J. Symb. Log. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml21.html#Prior56 2003-11-20 Peirce's Axioms for Propositional Calculus. 135-136 1958 23 J. Symb. Log. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml23.html#Prior58 2003-11-20 Two Additions to Positive Implication. 31-32 1964 29 J. Symb. Log. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml29.html#Prior64 2003-11-20 Ramsey's Theorem for Computably Enumerable Colorings. 873-880 2001 66 J. Symb. Log. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml66.html#HummelJ01 2003-11-20 Generalized Cohesiveness. 489-516 1999 64 J. Symb. Log. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml64.html#HummelJ99 2003-11-20 Decision Problems for Differential Equations. 941-950 1989 54 J. Symb. Log. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml54.html#DenefL89 2003-11-20 On Modal Logic with Propositional Quantifiers. 257-263 1969 34 J. Symb. Log. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml34.html#Bull69a 2003-11-20 A Lattice of Interpretability Types of Theories. 297-305 1977 42 J. Symb. Log. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml42.html#Mycielski77 2003-11-20 Analysis Without Actual Infinity. 625-633 1981 46 J. Symb. Log. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml46.html#Mycielski81 2003-11-20 Locally Finite Theories. 59-62 1986 51 J. Symb. Log. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml51.html#Mycielski86 2003-11-20 New Set-Theoretic Axioms Derived from a Lean Metamathematics. 191-198 1995 60 J. Symb. Log. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml60.html#Mycielski95 2003-11-20 ₂. 110-112 1940 5 J. Symb. Log. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml5.html#McKinsey40a 2003-11-20 A Correction to Lewis and Langford's Symbolic Logic. 149 1940 5 J. Symb. Log. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml5.html#McKinsey40b 2003-11-20 Some Theorems About the Sentential Calculi of Lewis and Heyting. 1-15 1948 13 J. Symb. Log. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml13.html#McKinseyT48 2003-11-20 Meeting of the Association for Symbolic Logic: Atlanta 1973. 390-405 1974 39 J. Symb. Log. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml39.html#HensonJLR74 2003-11-20 Kueker's Conjecture for Stable Theories. 207-220 1989 54 J. Symb. Log. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml54.html#Hrushovski89 2003-11-20 ₁Categorical Theories. 838-844 1994 59 J. Symb. Log. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml59.html#Hrushovski94 2003-11-20 Weakly O-Minimal Structures and Some of Their Properties. 1511-1528 1998 63 J. Symb. Log. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml63.html#Kulpeshov98 2003-11-20 On Logically False Evidence Statements. 345-349 1957 22 J. Symb. Log. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml22.html#Leblanc57 2003-11-20 On Requirements for Conditional Probability Functions. 238-242 1960 25 J. Symb. Log. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml25.html#Leblanc60 2003-11-20 Einkleidung der Mathematik in Schroderschen Relativkalkul. 1-15 1940 5 J. Symb. Log. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml5.html#Lowenheim40 2003-11-20 Church's Thesis Without Tears. 797-803 1983 48 J. Symb. Log. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml48.html#Richman83 2003-11-20 On Cofinal Extensions of Models of Arithmetic. 253-262 1983 48 J. Symb. Log. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml48.html#Kotlarski83 2003-11-20 Some Remarks on Initial Segments in Models of Peano Arithmetic. 955-960 1984 49 J. Symb. Log. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml49.html#Kotlarski84 2003-11-20 On the Incompleteness Theorems. 1414-1419 1994 59 J. Symb. Log. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml59.html#Kotlarski94 2003-11-20 An Addition to Rosser's Theorem. 285-292 1996 61 J. Symb. Log. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml61.html#Kotlarski96 2003-11-20 ¹_nSets of Reals. 1379-1428 1997 62 J. Symb. Log. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml62.html#BagariaW97 2003-11-20 On Models of Arithmetic--Answers to Two Problems Raised by H. Gaifman. 41-47 1975 40 J. Symb. Log. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml40.html#Wilkie75 2003-11-20 ^infty. 344 1994 59 J. Symb. Log. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml59.html#Wilkie94 2003-11-20 Quelques Propriétés de Théories de Jonsson. 528-536 2002 67 J. Symb. Log. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml67.html#Mustafin02 2003-11-20 A Logic for Approximate Reasoning. 830-837 1994 59 J. Symb. Log. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml59.html#Ying94 2003-11-20 Powers of the Ideal of Lebesgue Measure Zero Sets. 103-107 1991 56 J. Symb. Log. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml56.html#Burke91 2003-11-20 Precipitous Towers of Normal Filters. 741-754 1997 62 J. Symb. Log. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml62.html#Burke97 2003-11-20 lambda-Scales, kappa-Souslin Sets and a New Definition of Analytic Sets. 373-378 1976 41 J. Symb. Log. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml41.html#Busch76 2003-11-20 A Note on a Proof of Hilbert's Second epsilon-Theorem. 214-215 1987 52 J. Symb. Log. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml52.html#Ferrari87 2003-11-20 Expressivity in Polygonal, Plane Mereotopology. 822-838 2000 65 J. Symb. Log. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml65.html#PrattS00 2003-11-20 Reachability Is Harder for Directed than for Undirected Finite Graphs. 113-150 1990 55 J. Symb. Log. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml55.html#AjtaiF90 2003-11-20 The Decision Problem for Standard Classes. 460-464 1976 41 J. Symb. Log. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml41.html#Gurevich76 2003-11-20 Modest Theory of Short Chains. I. 481-490 1979 44 J. Symb. Log. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml44.html#Gurevich79 2003-11-20 Decision Problem for Separated Distributive Lattices. 193-196 1983 48 J. Symb. Log. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml48.html#Gurevich83 2003-11-20 An Elementary Definability Theorem for First Order Logic. 1028-1036 1999 64 J. Symb. Log. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml64.html#ButzM99 2003-11-20 Extensions of the Constructive Ordinals. 193-211 1965 30 J. Symb. Log. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml30.html#Richter65 2003-11-20 Constructively Accessible Ordinal Numbers. 43-55 1968 33 J. Symb. Log. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml33.html#Richter68 2003-11-20 Degrees of Structures. 723-731 1981 46 J. Symb. Log. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml46.html#Richter81 2003-11-20 An Axiomatisation of Quantum Logic. 389-392 1973 38 J. Symb. Log. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml38.html#Clark73 2003-11-20 The Structure of Algebraically and Existentially Closed Stone and Double Stone Algebras. 363-375 1989 54 J. Symb. Log. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml54.html#Clark89 2003-11-20 ZF + 'Every set is the same size as a wellfounded set'. 1-4 2003 68 J. Symb. Log. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml68.html#Forster03 2003-11-20 Further Consistency and Independence Results in NF Obtained by the Permutation Method. 236-238 1983 48 J. Symb. Log. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml48.html#Forster83 2003-11-20 The Status of the Axiom of Choice in Set Theory with a Universal Set. 701-707 1985 50 J. Symb. Log. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml50.html#Forster85 2003-11-20 Term Models for Weak Set Theories with a Universal Set. 374-387 1987 52 J. Symb. Log. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml52.html#Forster87 2003-11-20 A Solution to the Completeness Problem for Weakly Aggregative Modal Logic. 832-842 1995 60 J. Symb. Log. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml60.html#ApostoliB95 2003-11-20 Admissibility of Structural Rules for Contraction-Free Systems of Intuitionistic Logic. 1499-1518 2000 65 J. Symb. Log. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml65.html#DyckhoffN00 2003-11-20 Meeting of the Association for Symbolic Logic. 551-560 1976 41 J. Symb. Log. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml41.html#BaldwinMST76 2003-11-20 Blunt and Topless End Extensions of Models of Set Theory. 1053-1073 1983 48 J. Symb. Log. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml48.html#Kaufmann83a 2003-11-20 Some Results in Modal Model Theory. 496-508 1974 39 J. Symb. Log. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml39.html#Mortimer74 2003-11-20 Remarks on Weak Notions of Saturation in Models of Peano Arithmetic. 129-148 1987 52 J. Symb. Log. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml52.html#KaufmannS87 2003-11-20 An Intuitionistic Version of Zermelo's Proof That Every Choice Set Can Be Well-Ordered. 1121-1126 2001 66 J. Symb. Log. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml66.html#Wilson01 2003-11-20 Problems. 160 1952 17 J. Symb. Log. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml17.html#ScholzKH52 2003-11-20 Grafted Frames and S1-Completeness. 1324-1338 1999 64 J. Symb. Log. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml64.html#Zhou99 2004-11-22 Formal Languages Defined by the Underlying Structure of their Words. 1009-1026 1988 53 J. Symb. Log. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml53.html#Ressayre88 2003-11-20 Kripke Models for Linear Logic. 514-545 1993 58 J. Symb. Log. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml58.html#AllweinD93 2003-11-20 A Completeness Theorem in Modal Logic. 1-14 1959 24 J. Symb. Log. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml24.html#Kripke59 2003-11-20 Combinatory Logic with Discriminators. 561-575 1969 34 J. Symb. Log. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml34.html#Kearns69 2003-11-20 Modal Semantics without Possible Worlds. 77-86 1981 46