Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThe Journal of Symbolic Logic, Volume 37
Volume 37, Number 1, March 1972
- Rolando Chuaqui:
Forcing for the Impredicative Theory of Classes. 1-18 - H. E. Rose:
E alpha -Arithmetic and Transfinite Induction. 19-30 - Richard Mansfield:
The Completeness Theorem for Infinitary Logic. 31-34 - Peter Aczel:
Describing Ordinals Using Functionals of Transfinite Type. 35-47 - J. R. Shilleto:
Minimum Models of Analysis. 48-54 - Albert R. Meyer, Patrick C. Fischer:
Computational Speed-Up by Effective Operators. 55-68 - Wilfrid Hodges:
On Order-Types of Models. 69-70 - Jussi Ketonen:
On Nonregular Ultrafilters. 71-74 - Philip Olin:
Products of Two-Sorted Structures. 75-80 - Thomas J. Grilliot:
Omitting Types: Application to Recursion Theory. 81-89 - Erik Ellentuck:
Nonrecursive Combinatorial Functions. 90-95 - Andrzej Mostowski:
A Transfinite Sequence of omega-Models. 96-102 - Andreas Blass:
The Intersection of Nonstandard Models of Arithmetic. 103-106 - Saharon Shelah
:
Uniqueness and Characterization of Prime Models over Sets for Totally Transcendental First-Order Theories. 107-113 - Erik Ellentuck:
The Positive Properties of Isolic Integers. 114-132 - John W. Rosenthal:
A New Proof of a Theorem of Shelah. 133-134 - Dov M. Gabbay:
Applications of Trees to Intermediate Logics. 135-138 - Louise Hay:
A Discrete Chain of Degrees of Index Sets. 139-149 - Steven K. Thomason:
Semantic Analysis of Tense Logics. 150-158 - Alasdair Urquhart:
Semantics for Relevant Logics. 159-169
Volume 37, Number 2, June 1972
- Nicolas D. Goodman:
A simplification of combinatory Logic. 225-246 - Saharon Shelah:
On Models with Power-Like Ordering. 247-267 - Carl G. Jockusch Jr.:
Ramsey's Theorem and Recursion Theory. 268-280 - Stanley S. Wainer:
Ordinal Recursion, and a Refinement of the Extended Grzegorczyk Hierarchy. 281-292 - Harold Simmons:
Existentially Closed Structures. 293-310 - Georg Kreisel:
Which Number Theoretic Problems can be Solved in Recursive Progressions on O 1/1 -Paths Through O? 311-334 - Paul C. Eklof:
Some Model Theory of Abelian Groups. 335-342 - Stephen J. Garland:
Generalized Interpolation Theorems. 343-351 - M. H. Lob:
A Reduction Theorem for Predicate Logic. 352-354 - William A. Howard:
A System of Abstract Constructive Ordinals. 355-374 - Dov M. Gabbay:
Sufficient Conditions for the Undecidability of Intuitionistic Theories with Applications. 375-384 - Peter B. Andrews:
General Models, Descriptions, and Choice in Type Theory. 385-394 - Peter B. Andrews:
General Models and Extensionality. 395-397 - Charles D. Parsons, Richard J. Orgass, Richmond H. Thomason:
Meeting of the Association for Symbolic Logic. 430-447
Volume 37, Number 3, September 1972
- Bienvenido F. Nebres:
Infinitary Formulas Preserved Under Unions of Models. 449-465 - Charles D. Parsons:
On n-Quantifier Induction. 466-482 - R. Phillips:
Addition in Nonstandard Models of Arithmetic. 483-486 - John T. Baldwin:
Almost Strongly Minimal Theories. I. 487-493 - C. Ward Henson:
Countable Homogeneous Relational Structures and N0-Categorical Theories. 494-500 - John Stillwell:
Decidability of the Almost All Theory of Degrees. 501-506 - Jesse B. Wright:
Characterization of Recursively Enumerable Sets. 507-511 - Angus Macintyre:
Omitting Quantifier-Free Types in Generic Structures. 512-520 - James H. Schmerl:
An Elementary Sentence which Has Ordered Models. 521-530 - James H. Schmerl, Saharon Shelah:
On Power-like Models for Hyperinaccessible Cardinals. 531-537 - James D. Davis:
The Inconsistency of a Certain Axiom System for Set Theory. 538-542 - Louise Hay:
A Note on Frame Extensions. 543-545 - Gregory L. Cherlin:
The Model-Companion of a Class of Structures. 546-556 - Erik Ellentuck:
An Algebraic Difference Between Isols and Cosimple Isols. 557-561 - Andreas Blass:
Theories without Countable Models. 562-568 - Andreas Blass:
On the Inadequacy of Inner Models. 569-571 - Raphael M. Robinson:
Some Representations of Diophantine Sets. 572-578 - Dov M. Gabbay:
Decidability of Some Intuitionistic Predicate Theories. 579-587 - K. Jon Barwise:
The Hanf Number of Second Order Logic. 588-594 - Solomon Garfunkel, Herbert S. Shank:
On the Undecidability of Finite Planar Cubic Graphs. 595-597 - S. Barry Cooper:
Jump Equivalence of the triangle 02 Hyperhyperimmune Sets. 598-600
Volume 37, Number 4, December 1972
- Barbara Jeffcott:
The Center of an Orthologic. 641-645 - Daniel B. Demaree:
Copeland Algebras. 646-656 - John T. Baldwin:
Almost Strongly Minimal Theories. II. 657-660 - Jeff B. Paris:
ZF sigma04 Determinateness. 661-667 - Nigel J. Cutland:
sigma1-Compactness and Ultraproducts. 668-672 - E. M. Kleinberg, Richard A. Shore:
Weak Compactness and Square Bracket Partition Relations. 673-676 - George Metakides:
alpha-Degrees of alpha-Theories. 677-682 - Henry Africk:
A Proof Theoretic Proof of Scott's General Interpolation Theorem. 683-695 - John Corcoran:
Completeness of an Ancient Logic. 696-702 - Donald Perlis:
An Extension of Ackermann's Set Theory. 703-704 - Gonzalo E. Reyes:
L omega 1, omega is Enough: A Reduction Theorem for Some Infinitary Languages. 705-710 - Krister Segerberg:
Post Completeness in Modal Logic. 711-715 - Steven K. Thomason:
Noncompactness in Propositional Modal Logic. 716-720 - David Pincus:
Zermelo-Fraenkel Consistency Results by Fraenkel-Mostowski Methods. 721-743 - Carl G. Jockusch Jr., Joseph S. Ullian, Robert B. Barrett Jr.:
Meeting of the Association for Symbolic Logic: St. Louis 1972. 775-782
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-19 19:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
