default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThe Journal of Symbolic Logic, Volume 36
Volume 36, Number 1, March 1971
- Thomas Jech:
Trees. 1-14 - Dean P. McCullough:
Logical Connectives for Intuitionistic Propositional Logic. 15-20 - John Helm, Paul Young:
On Size vs. Efficiency for Programs Admitting Speed-Ups. 21-27 - David Pincus:
Support Structures for the Axiom of Choice. 28-38 - Joel I. Friedman:
The Generalized Continuum Hypothesis is Equivalent to the Generalized Maximization Principle. 39-54 - C. H. Applebaum:
omega-Homomorphisms and omega-Groups. 55-65 - Carl G. Jockusch Jr., Robert I. Soare:
A Minimal Pair of pi01 Classes. 66-78 - John T. Baldwin, Alistair H. Lachlan:
On Strongly Minimal Sets. 79-96 - M. K. Rennie:
Semantics for RK1t. 97-107 - K. Jon Barwise, Robin O. Gandy, Yiannis N. Moschovakis:
The Next Admissible Set. 108-120 - Solomon Garfunkel, Herbert S. Shank:
On the Undecidability of Finite Planar Graphs. 121-126 - C. G. McKay:
A Class of Decidable Intermediate Propositional Logics. 127-128 - G. Fuhrken, W. Taylor:
Weakly Atomic-Compact Relational Structures. 129-140
Volume 36, Number 2, June 1971
- Manuel Lerman:
Some Theorems on R-Maximal Sets and Major Subsets of Recursively Enumerable Sets. 193-215 - Jerome I. Malitz:
Infinitary Analogs of Theorems from First Order Model Theory. 216-228 - Stål Aanderaa, Dag Belsnes:
Decision Problems for Tag Systems. 229-239 - H. Jerome Keisler:
On Theories Categorical in Their Own Power. 240-244 - Thomas J. Grilliot:
On Effectively Discontinuous Type-2 Objects. 245-248 - Sabine Gornemann:
A Logic Stronger Than Intuitionism. 249-261 - Shoji Maehara, Gaisi Takeuti:
Two Interpolation Theorems for a pi11 Predicate Calculus. 262-270 - Donald A. Alton:
Recursively Enumerable Sets Which are Uniform for Finite Extensions. 271-287 - David Isles:
Natural Well-Orderings. 288-300 - Alfred B. Manaster:
Some Contrasts between Degrees and the Arithmetical Hierarchy. 301-304 - E. M. Kleinberg, Richard A. Shore:
On Large Cardinals and Partition Relations. 305-308 - Joan Rand Moschovakis:
Can There be no Nonrecursive Functions? 309-315 - Gaisi Takeuti:
Meetings of the Association for Symbolic Logic. 357-384
Volume 36, Number 3, September 1971
- Eugene Wesley:
An Application of Nonstandard Analysis to Game Theory. 385-394 - Karel Prikry:
On Measures on Complete Boolean Algebras. 395-406 - Kenneth Kunen:
Elementary Embeddings and Infinitary Combinatorics. 407-413 - Peter B. Andrews:
Resolution in Type Theory. 414-432 - James C. Owings Jr.:
A Splitting Theorem for Simple pi11 Sets. 433-438 - Joseph G. Rosenstein:
A Note on a Theorem of Vaught. 439-440 - Abraham Robinson:
On the Notion of Algebraic Closedness for Noncommutative Groups and Fields. 441-444 - John Gregory:
Incompleteness of a Formal System for Infinitary Finite-Quantifier Formulas. 445-455 - Leslie H. Tharp:
A Quasi-Intuitionistic Set Theory. 456-460 - Jörg Flum:
A Remark on Infinitary Languages. 461-462 - Frank Wattenberg:
Nonstandard Topology and Extensions of Monad Systems to Infinite Points. 463-476 - J. C. E. Dekker:
Countable Vector Spaces with Recursive Operations. Part II. 477-493 - Rohit Parikh:
Existence and Feasibility in Arithmetic. 494-508 - Rolando Chuaqui:
Meeting of the Association for Symbolic Logic Santiago, Chile 1970. 576-580 - David Kaplan:
Meeting of the Association for Symbolic Logic Los Angeles 1971. 581-592
Volume 36, Number 4, December 1971
- Robert Fittler:
Generalized Prime Models. 593-606 - Ralph McKenzie:
Negative Solution of the Decision Problem for Sentences True in Every Subalgebra of < N, + >. 607-609 - D. J. Shoesmith, T. J. Smiley:
Deducibility and Many-Valuedness. 610-622 - Gabriel Sabbagh, Paul C. Eklof:
Definability Problems for Modules and Rings. 623-649 - Kenneth Kunen, Karel Prikry:
On Descendingly Incomplete Ultrafilters. 650-652 - M. D. Gladstone:
Simplifications of the Recursion Scheme. 653-665 - Michael O. Rabin, Michael D. Morley:
Meeting of the Association for Symbolic Logic. 696-710
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-10-31 20:15 CET 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:
