default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThe Journal of Symbolic Logic, Volume 40
Volume 40, Number 1, March 1975
- Jacques Stern:
A New Look at the Interpolation Problem. 1-13 - Georges Blanc, Anne Preller:
Lawvere's Basic Theory of the Category of Categories. 14-18 - Leo Harrington, Alexander S. Kechris:
On Characterizing Spector Classes. 19-24 - Charles G. Morgan:
Weak Liberated Versions of T and S4. 25-30 - Dan Saracino:
A Counterexample in the Theory of Model Companions. 31-34 - Robert Goldblatt
:
First-Order Definability in Modal Logic. 35-40 - Alex Wilkie:
On Models of Arithmetic-Answers to Two Problems Raised by H. Gaifman. 41-47 - Paul E. Cohen:
A Large Power Set Axiom. 48-54 - Johan van Benthem:
A Note on Modal Formulae and Relational Properties. 55-58 - John R. Steel:
Descending Sequences of Degrees. 59-61 - Warren D. Goldfarb, Harry R. Lewis:
Skolem Reduction Classes. 62-68 - P. M. Cohn:
The Word Problem for Free Fields: A Correction and an Addendum. 69-74 - Karel Prikry, Robert Solovay:
On Partitions into Stationary Sets. 75-80
Volume 40, Number 2, June 1975
- Harvey Friedman:
One Hundred and Two Problems in Mathematical Logic. 113-129 - Leonard P. Sasso Jr.:
A Survey of Partial Degrees. 130-140 - Martin Gerson:
The Inadequacy of the Neighbourhood Semantics for Modal Logic. 141-148 - Maurice Boffa:
Sets Equipollent to their Power Set in NF. 149-150 - John Lake:
Natural Models and Ackermann-Type Set Theories. 151-158 - A. M. Dawes, John B. Florence:
Independent Godel Sentences and Independent Sets. 159-166 - George Metakides, Jacob Manuel Plotkin:
An Algebraic Characterization of Power Set in Countable Standard Models of ZF. 167-170 - Jane Bridge:
A Simplification of the Bachmann Method for Generating Large Countable Ordinals. 171-185 - Ralph McKenzie:
On Spectra, and the Negative Solution of the Decision Problem for Identities having a Finite Nontrivial Model. 186-196 - Anna Michaelides Penk:
Two Forms of the Axiom of Choice for an Elementary Topos. 197-212 - Walter Baur:
N0-Categorical Modules. 213-220 - William C. Powell:
Extending Godel's Negative Interpretation to ZF. 221-229 - Paul C. Gilmore, Donald A. Martin, Elliott Mendelson:
Meeting of the Association for Symbolic Logic. 299-304
Volume 40, Number 3, September 1975
- Diana Schmidt:
Bounds for the Closure Ordinals of Replete Monotonic Increasing Functions. 305-316 - Julia F. Knight:
Types Omitted in Uncountable Models of Arithmetic. 317-320 - Michael Beeson:
The Nonderivability in Intuitionistic Formal Systems of Theorems on the Continuity of Effective Operations. 321-346 - John R. Myhill:
Constructive Set Theory. 347-382 - Miroslav Benda:
Construction of Models from Groups of Permutations. 383-388 - Jerome I. Malitz:
Complete Theories with Countably many Rigid Nonisomorphic Models. 389-392 - T. B. Flannagan:
On an Extension of Hilbert's Second epsilon-Theorem. 393-397 - Robert A. Di Paola:
A Theorem on Shortening the Length of Proof in Formal Systems of Arithmetic. 398-400 - Alistair H. Lachlan:
Uniform Enumeration Operations. 401-409 - Jörg Flum:
L(Q)-Preservation Theorems. 410-418 - Daniel Andler:
Semi-Minimal Theories and Categoricity. 419-438 - Steven K. Thomason:
Categories of Frames for Modal Logic. 439-442 - Roy Edelstein:
An Interpolation Lemma for the Pure Implicational Calculus. 443-444
Volume 40, Number 4, December 1975
- Ivan Marques:
On Degrees of Unsolvability and Complexity Properties. 529-540 - James E. Baumgartner:
Canonical Partition Relations. 541-554 - Nancy A. Lynch:
"Helping": Several Formalizations. 555-566 - Erik Ellentuck:
The Foundations of Suslin Logic. 567-575
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 2026-08-25 22:06 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
