The Journal of Symbolic Logic, Volume 31

Volume 31, Number 1, March 1966

Stanislaw Jaskowski: On Formulas in which no Individual Variable occurs more than Twice. 1-6
C. A. Meredith: Postulates for Implicational Calculi. 7-9
Alistair H. Lachlan: On the Indexing of Classes of Recursively Enumerable Sets. 10-22
M. H. Lob: Extensional Interpretations of Modal Logics. 23-45
E. J. Lemmon: Algebraic Semantics for Modal Logics I. 46-65
Donald A. Martin: On a Question of G. E. Sacks. 66-69
Paul R. Young: Linear Orderings under One-One Reducibility. 70-85
J. W. Swanson: A Reduction Theorem for Normal Algorithms. 86-97

C. E. M. Yates: A Minimal Pair of Recursively Enumerable Degrees. 159-168
Calvin C. Elgot, Michael O. Rabin: Decidability and Undecidability of Extensions of Second (First) Order Theory of (Generalized) Successor. 169-181
James W. Thatcher: Decision Problems for Multiple Successor Arithmetics. 182-190
E. J. Lemmon: Algebraic Semantics for Modal Logics II. 191-218
Philip K. Hooper: The Undecidability of the Turing Machine Immortality Problem. 219-234
Roland Fraisse: Une Generalisation de L'Ultraproduit. 235-244
John N. Crossley: Meeting of the Association for Symbolic Logic. 290-302

Raymond M. Smullyan: Trees and Nest Structures. 303-321
Raymond M. Smullyan: Finite Nest Structures and Propositional Logic. 322-324
W. A. Howard, G. Kreisel: Transfinite Induction and Bar Induction of Types Zero and One, and the Role of Continuity in Intuitionistic Analysis. 325-358
Robert A. Di Paola: Pseudo-Complements and Ordinal Logics based on Consistency Statements. 359-364
Akiko Kino: On Definability of Ordinals in Logic with Infinitely Long Expressions. 365-375
Frank B. Cannonito: Hierarchies of Computable Groups and the Word Problem. 376-392
Burton Dreben, John Denton: A Supplement to Herbrand. 393-398
Storrs McCall, Robert K. Meyer: Pure Three-Valued Lukasiewiczian Implication. 399-405
David Makinson: There are Infinitely many Diodorean Modal Functions. 406-408
Kenneth R. Brown, Hao Wang: Short Definitions of the Ordinals. 409-414
Storrs McCall: Connexive Implication. 415-433
Alistair H. Lachlan: The Impossibility of finding Relative Complements for Recursively Enumerable Degrees. 434-454
R. Mitchell: A Generalisation of Productive Set. 455-459
William H. Hanson: On Formalizing the Distinction between Logical and Factual Truth. 460-477
Gerald Standley: Testing Singly Quantified Tautologies. 478-480

John N. Crossley: Constructive Order Types, II. 525-538
Joseph R. Shoenfield: A Theorem on Minimal Degrees. 539-544
M. J. Cresswell: Functions of Propositions. 545-560
William S. Hatcher: Logical Truth and Logical Implication. 561
David Nelson: Non-Null Implication. 562-572
Alistair H. Lachlan: A Note on Universal Sets. 573-574
Robert K. Meyer: Pure Denumerable Lukasiewiczian Implication. 575-580
M. D. Gladstone: Finite Models for Inequations. 581-592
Gerald J. Massey: The Theory of Truth Tabular Connectives, both Truth Functional and Modal. 593-608
R. A. Bull: MIPC as the Formalisation of an Intuitionist Concept of Modality. 609-616
Mitsuru Yasuhara: Syntactical and Semantical Properties of Generalized Quantifiers. 617-632
Mitsuru Yasuhara: An Axiomatic System for the First Order Language with an Equi-Cardinality Quantifier. 633-640
William H. Hanson: On some Alleged Decision Procedures for S4. 641-643
Sidney Morgenbesser, Elliott Mendelson: Annual Meeting of the Association for Symbolic Logic. 682-696
Martin Davis: Meeting of the Association for Symbolic Logic. 697-706