default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThe Journal of Symbolic Logic, Volume 34
Volume 34, Number 1, March 1969
- Richmond H. Thomason, D. Randolph Johnson Jr.:
Predicate Calculus with Free Quantifier Variables. 1-7 - John B. Florence:
Partially Ordered Sets Representable by Recursively Enumerable Classes. 8-12 - Matthew J. Hassett:
Recursive Equivalence Types and Groups. 13-20 - A. B. Slomson:
An Undecidable Two Sorted Predicate Calculus. 21-23 - Pavel Materna:
Identity, Equivalence and Isomorphism of Problems. 24-34 - David Makinson:
A Normal Modal Calculus Between T and S4 Without the Finite Model Property. 35-38 - Louise Hay:
Index Sets of Finite Classes of Recursively Enumerable Sets. 39-44 - Alfred B. Manaster:
Rich Co-ordinals, Addition Isomorphisms, and Rets. 45-52 - Robert I. Soare:
Sets with no Subset of Higher Degrees. 53-56 - Nino B. Cocchiarella:
A Second Order Logic of Existence. 57-69 - Erik Ellentuck:
A Choice Free Theory of Dedekind Cardinals. 70-84 - Manuel Lerman:
Some Nondistributive Lattices as Initial Segments of the Degrees of Unsolvability. 85-98 - Yiannis N. Moschovakis:
Meeting of the Association for Symbolic Logic. 152-160
Volume 34, Number 2, June 1969
- Gabor T. Herman:
The Unsolvability of the Uniform Halting Problem for Two State Turing Machines. 161-165 - J. Richard Büchi, Lawrence H. Landweber:
Definability in the Monadic Second-Order Theory of Successor. 166-170 - Stephen D. Comer:
Finite Inseparability of Some Theories of Cylindrification Algebras. 171-176 - Thomas J. Grilliot:
Hierarchies Based on Objects of Finite Type. 177-182 - Peter H. Krauss:
Representation of Symmetric Probability Models. 183-193 - James C. Owings Jr.:
pi11 Sets, omega-Sets, and Metacompleteness. 194-204 - E. M. Kleinberg:
The Independence of Ramsey's Theorem. 205-206 - N. Z. Shapiro:
Real Numbers and Functions in the Kleene Hierarchy and Limits of Recursive, Rational Functions. 207-214 - R. A. Bull:
Note on a Paper in Tense Logic. 215-218 - Richard A. Platek:
Eliminating the Continuum Hypothesis. 219-225 - Jon Barwise:
Infinitary Logic and Admissible Sets. 226-252 - M. J. Cresswell:
A Conjunctive Normal Form For S3.5. 253-255 - Robert I. Soare:
A Note on Degrees of Subsets. 256 - R. A. Bull:
On Modal Logic with Propositional Quantifiers. 257-263 - John P. Burgess:
Probability Logic. 264-274 - P. D. Finch:
On the Structure of Quantum Logic. 275-282 - Ernest A. Edmonds:
Independence of Rose's Axioms for m-Valued Implication. 283-284 - Robert I. Soare:
Constructive Order Types on Cuts. 285-289
Volume 34, Number 3, September 1969
- Czeslaw Lejewski:
Consistency of Lesniewski's Mereology. 321-328 - M. J. Cresswell:
The Elimination of De Re Modalities. 329-330 - J. Donald Monk:
Nonfinitizability of Classes of Representable Cylindric Algebras. 331-343 - James S. Johnson:
Nonfinitizability of Classes of Representable Polyadic Algebras. 344-352 - Harvey Friedman:
Bar Induction and Pi11-CA1. 353-362 - J. C. E. Dekker:
Countable Vector Spaces with Recursive Operations. Part I. 363-387 - Jacob Manuel Plotkin:
Generic Embeddings. 388-394 - Alfred Horn:
Logic with Truth Values in a Linearly Ordered Heyting Algebra. 395-408 - Jon Barwise:
Applications of Strict Pi11 Predicates to Infinitary Logic. 409-423 - Mroslav Benda:
Reduced Products and Nonstandard Logics. 424-436 - Michael Makkai:
On the Model Theory of Denumerably Long Formulas with Finite Strings of Quantifiers. 437-459 - Robert K. Meyer, J. Michael Dunn:
E, R, and gama. 460-474 - Alfred Horn:
Free L-Algebras. 475-480 - Rudolf Grewe:
Natural Models of Ackermann's Set Theory. 481-488 - Carl G. Jockusch Jr.:
The Degrees of Hyperhyperimmune Sets. 489-493 - Andrzej Mostowski, Andrzej Blikle:
Meeting of the Association for Symbolic Logic Warsaw 1968. 533-544
Volume 34, Number 4, December 1969
- J. Roger Hindley:
An Abstract Form of the Church-Rosser Theorem. I. 545-560 - John T. Kearns:
Combinatory Logic with Discriminators. 561-575 - Abraham Robinson:
Compactification of Groups and Rings and Nonstandard Analysis. 576-588 - C. Ward Henson
:
Finite Sets in Quine's New Foundations. 589-596 - James P. Jones:
Effectively Retractable Theories and Degrees of Undecidability. 597-604 - Yiannis N. Moschovakis:
Abstract Computability and Invariant Definability. 605-633 - Frank B. Cannonito, Mark Finkelstein:
On Primitive Recursive Permutations and their Inverses. 634-638 - Gabor T. Herman:
A Simple Solution of the Uniform Halting Problem. 639-640
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-01-28 22:34 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:
