default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThe Journal of Symbolic Logic, Volume 39
Volume 39, Number 1, March 1974
- J. Roger Hindley:
An Abstract Church-Rosser Theorem. II: Applications. 1-21 - John Gregory:
Beth Definability in Infinitary Languages. 22-26 - Keith J. Devlin:
Some Remarks on Changing Cofinalities. 27-30 - Kit Fine:
Logics Containing K4. Part I. 31-42 - H. Jerome Keisler, Karel Prikry:
A Result Concerning Cardinalities of Ultraproducts. 43-48 - Manuel Lerman:
Least Upper Bounds For Minimal Pairs of alpha-R.E. alpha Degrees. 49-56 - William J. Mitchell:
Sets Constructible from Sequences of Ultrafilters. 57-66 - Dov M. Gabbay, Dick De Jongh:
A Sequence of Decidable Finitely Axiomatizable Intermediate Logics with the Disjunction Property. 67-78 - Harvey Friedman:
PCA Well-Orderings of the Line. 79-80 - James R. Geiser:
A Formalization of Essenin-Volpin's Proof Theoretical Studies by Means of Nonstandard Analysis. 81-87 - Stanley S. Wainer:
A Hierarchy for the 1-Section of Any Type Two Object. 88-94 - Carl G. Jockusch Jr.:
Pi01 Classes and Boolean Combinations of Recursively Enumerable Sets. 95-96 - Jacques Grassin:
Index Sets in Ershov's Hierarchy. 97-104 - Judy Green:
sigma1 Compactness for Next Admissible Sets. 105-116 - George S. Sacerdote:
Projective Model Completeness. 117-123 - Henry Africk:
Scott's Interpolation Theorem Fails for L omega1, omega. 124-126 - Robert Moll, Albert R. Meyer:
Honest Bounds for Complexity Classes of Recursive Functions. 127-138 - Neil D. Jones, Alan L. Selman:
Turing Machines and the Spectra of First-Order Formulas. 139-150 - Andreas Blass:
On Certain Types and Models for Arithmetic. 151-162 - Erik Ellentuck:
A New Proof that Analytic Sets are Ramsey. 163-165 - Anne C. Morel, Ronald Harrop, Miriam Lucian, David Pincus:
Meeting of the Association for Symbolic Logic Seattle 1973. 195-208
Volume 39, Number 2, June 1974
- Louise Hay:
A Noninitial Segment of Index Sets. 209-224 - M. H. Lob:
Correction to 'A Model Theoretic Characterisation of Effective Operations'. 225 - John Staples:
Combinator Realizability of a Constructive Morse Set Theory. 226-234 - Daniel Richardson:
Sets of Theorems with Short Proofs. 235-242 - Joan D. Lukas, Hilary Putnam:
Systems of Notations and the Ramified Analytical Hierarchy. 243-253 - William Boos:
Boolean Extensions which Efface the Mahlo Property. 254-268 - Alexander S. Kechris:
On Projective Ordinals. 269-282 - William P. Hanf:
Nonrecursive Tilings of the Plane. I. 283-285 - Dale Myers:
Nonrecursive Tilings of the Plane. II. 286-294 - Richard A. Shore:
sigman Sets which are trianglen-Incomparable (Uniformly). 295-304 - Leo Harrington:
Recursively Presentable Prime Models. 305-309 - Douglas A. Cenzer:
Analytic Inductive Definitions. 310-312 - Gordon D. Plotkin:
The lambda-Calculus is omega-Incomplete. 313-317 - Harvey Friedman:
On Existence Proofs of Hanf Numbers. 318-324 - J. P. Calais, John Derrick, Gabriel Sabbagh:
Meeting of the Association for Symbolic Logic: Orleans, France, 1972. 371-389 - C. Ward Henson, Bjarni Jónsson, E. G. K. López-Escobar, Michael D. Resnik:
Meeting of the Association for Symbolic Logic: Atlanta 1973. 390-405 - H. E. Rose, John C. Shepherdson:
European Meeting of the Association for Symbolic Logic: Bristol, England, 1973. 406-432
Volume 39, Number 3, September 1974
- Paul D. Bacsich, Dafydd Rowlands Hughes:
Syntactic Characterisations of Amalgamation, Convexity and Related Properties. 433-451 - Dale Myers:
The Boolean Algebras of Abelian Groups and Well-Orders. 452-458 - Erik Ellentuck:
A triangle02 Theory of Regressive Isols. 459-468 - Carol Wood:
Prime Model Extensions for Differential Fields of Characteristic p ? 0. 469-477 - L. Herman, Robert Piziak:
Modal Propositional Logic on an Orthomodular Basis. I. 478-488 - Charles E. Hughes:
Single Premise Post Canonical Forms Defined Over One-Letter Alphabets. 489-495 - Michael Mortimer:
Some Results in Modal Model Theory. 496-508 - Stål Aanderaa, Warren D. Goldfarb:
The Finite Controllability of the Maslov Case. 509-518 - Stål Aanderaa, Harry R. Lewis:
Linear Sampling and the forall exists forall Case of the Decision Problem. 519-548 - Steven K. Thomason:
Reduction of Tense Logic to Modal Logic. I. 549-551 - Chi Tat Chong:
Almost Local Non-a-Recursiveness. 552-562 - Ryszard Wójcicki:
Note on Deducibility and Many-Valuedness. 563-566 - David Guaspari:
A Note on the Kondo-Addison Theorem. 567-570 - Leonard P. Sasso Jr.:
A Minimal Degree not Realizing Least Possible Jump. 571-574 - James E. Baumgartner:
The Hanf Number for Complete L omega1, omega -Sentences (Without GCH). 575-578 - Paul E. Cohen:
Models of Set Theory with More Real Numbers than Ordinals. 579-583 - A. S. Troelstra:
Note on the Fan Theorem. 584-596
Volume 39, Number 4, December 1974
- John Corcoran, William Frank, Michael Maloney:
String Theory. 625-637 - Robert E. Clay:
Relation of Lesniewski's Mereology to Boolean Algebra. 638-648 - Andreas Blass, Douglas A. Cenzer:
Cores of pi11 Sets of Reals. 649-654 - S. Barry Cooper:
Minimal Pairs and High Recursively Enumerable Degrees. 655-660 - Alasdair Urquhart:
Implicational Formulas in Intuitionistic Logic. 661-664 - Klaus-Peter Podewski, Joachim Reineke:
An omega1-Categorical Ring which is not Almost Strongly Minimal. 665-668 - John T. Gill III, Paul H. Morris:
On Subcreative Sets and S-Reducibility. 669-677 - Warren D. Goldfarb, T. M. Scanlon:
The omega-Consistency of Number Theory Via Herbrand's Theorem. 678-692 - Warren D. Goldfarb:
Ordinal Bounds for k-Consistency. 693-699 - Leslie H. Tharp:
Continuity and Elementary Logic. 700-716 - C. Ward Henson
:
The Isomorphism Property in Nonstandard Analysis and Its Use in the Theory of Banach Spaces. 717-731 - James H. Schmerl:
Generalizing Special Aronszajn Trees. 732-740
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 2025-04-25 17:47 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:
