Journal of Symbolic Logic

The Journal of Symbolic Logic publishes original scholarly work in symbolic logic. Founded in 1936, it has become the leading research journal in the field. The Journal aims to represent logic broadly, including its connections with mathematics and philosophy as well as newer aspects related to computer science and linguistics.


Volume 31, Issue 3

Publication Date: September, 1966

Miscellaneous front pages, J. Symbolic Logic, Volume 31, Issue 3 (1966)

Trees and Nest Structures

Raymond M. Smullyan; 303-321

Finite Nest Structures and Propositional Logic

Raymond M. Smullyan; 322-324

Transfinite Induction and Bar Induction of Types Zero and One, and the Role of Continuity in Intuitionistic Analysis

W. A. Howard and G. Kreisel; 325-358

Pseudo-Complements and Ordinal Logics based on Consistency Statements

Robert A. Di Paola; 359-364

On Definability of Ordinals in Logic with Infinitely Long Expressions

Akiko Kino; 365-375

Hierarchies of Computable Groups and the Word Problem

Frank B. Cannonito; 376-392

A Supplement to Herbrand

Burton Dreben and John Denton; 393-398

Pure Three-Valued Lukasiewiczian Implication

Storrs McCall and R. K. Meyer; 399-405

There are Infinitely many Diodorean Modal Functions

D. C. Makinson; 406-408

Short Definitions of the Ordinals

Kenneth R. Brown and Hao Wang; 409-414

Connexive Implication

Storrs McCall; 415-433

The Impossibility of finding Relative Complements for Recursively Enumerable Degrees

A. H. Lachlan; 434-454

A Generalisation of Productive Set

R. Mitchell; 455-459

On Formalizing the Distinction between Logical and Factual Truth

William H. Hanson; 460-477

Testing Singly Quantified Tautologies

Gerald Standley; 478-480

Reviews

Review: Andrzej Grzegorczyk, Fonctions Recursives

Rozsa Peter; 481-483

Review: Benson Mates, Elementary Logic

G. T. Kneebone; 483-484

Review: Martin Davis, The Undecidable Basic Papers on Undecidable Basic Propositions, Unsolvable propositions and Unsolvable Problems and Computable Funtions

Stefan Bauer-Mengelberg; 484-494

Review: Roy Dubisch, Lattices to Logic

Franz E. Hohn; 494

Review: Herbert Meschkowski, Wandlungen des Mathematischen Denkens. Eine Einfuhrung in die Grundlagenprobleme der Mathematik

J. Brown; 494

Review: David Greenwood, Quantitative Inductive Procedures; David Greenwood, Causality and the Counterfactual Conditional; David Greenwood, The Problem of Real Numbers

Edward E. Dawson; 494-496

Review: Wolfgang Stegmuller, Das Wahrheitsproblem und die Idee der Semantik. Eine Einfuhrung in die Theorien von A. Tarski und R. Carnap

R. M. Martin; 496

Review: W. V. Quine, Logic as a Source of Syntactical Insights

Ann M. Singleterry; 496-497

Review: Paul Henle, Mysticism and Semantics

Y. Bar-Hillel; 497

Review: N. L. Wilson, The Indestructibility and Immutability of Substances

Y. Bar-Hillel; 497-498

Review: M. J. Cresswell, On the Logic of Incomplete Answers

Gerold Stahl; 498

Review: Boleslaw Sobocinski, A Contribution to the Axiomatization of Lewis' System $S_5$; Ivo Thomas, Ten Modal Models

Nuel D. Belnap; 498-500

Review: Federico M. Sioson, Further Axiomatizations of the Lukasiewicz Three-Valued Calculus

Atwell R. Turquette; 500-501

Review: Waclaw Sadowski, A Proof of Axiomatizability of Certain $n$-Valued Sentential Calculi

V. G. Kirin; 501

[Omnibus Review]

Arto Salomaa; 501-502

Review: A. Grzegorczyk, A Note on the Theory of Propositional Types

Peter Andrews; 502-503

Review: M. R. Krom, Separation Principles in the Hierarchy Theory of Pure First-Order Logic

D. A. Clarke; 503-504

Review: Erwin Engeler, Aquivalenzklassen von n-Tupeln

G. Fuhrken; 504

Review: Lars Svenonius, $\aleph_0$-Categoricity in First-Order Predicate Calculus

G. Fuhrken; 504

Review: C. Ryll-Nardzewski, On the Categoricity in Power $\leqslant \aleph_0$

G. Fuhrken; 505

Review: Lars Svenonius, A Theorem on Permutations in Models

William Hanf; 505

Review: Lars Svenonius, Some Problems in Logical Model-Theory

William Hanf; 505-506

Review: T. Frayne, A. C. Morel, D. S. Scott, Reduced Direct Products

Arnold Oberschelp; 506-507

Review: H. Jerome Keisler, Reduced Products and Horn Classes

Arnold Oberschelp; 507

Review: Donald Monk, On Representable Relation Algebras

Thomas Frayne; 508

Review: Roman Sikorski, Algebra of Formalized Languages

Donald Monk; 508-509

Review: B. van Rootselaar, Algebraische Kennzeichnung Freier Wortarithmetiken

Vladeta Vuckovic; 509

Review: W. W. Tait, Functionals Defined by Transfinite Recursion

R. E. Vesley; 509-510

Review: John Myhill, Recursive Equivalence Types and Combinatorial Functions

J. C. E. Dekker; 510-511

Review: G. Kreisel, J. Shoenfield, Hao Wang, Number Theoretic Concepts and Recursive Well-Orderings

Ann M. Singleterry; 511-512

Review: Shih-Chao Liu, A Note on Many-One Reducibility

Gerald E. Sacks; 512

Review: Shih-Chao Liu, On Many-One Degrees

Gerald E. Sacks; 512-513

Review: Hartley Rogers, The Present Theory of Turing Machine Computability

C. E. M. Yates; 513

Review: Hartley Rogers, On Universal Functions

C. E. M. Yates; 513

Review: Z. A. Melzak, An Informal Arithmetical Approach to Computability and Computation; Joachim Lambek, How to Program an Infinite Abacus

Ann M. Singleterry; 514

Review: H. Gelernter, A Note on Syntactic Symmetry and the Manipulation of Formal Systems by Machine

Y. Bar-Hillel; 514

Review: J. A. Robinson, Theorem-Proving on the Computer

David Luckham; 514-515

Review: J. A. Robinson, A Machine-Oriented Logic based on the Resolution Principle

David Luckham; 515-516

Review: John Alan Robinson, On Automatic Deduction

David Luckham; 516

Review: Laszlo Kalmar, A New Principle of Construction of Logical Machines

Ann M. Singleterry; 516

Review: A. A. Lapunov, Mathematical Investigations Connected with the Operation of Electronic Computing Machines

Ann M. Singletery; 516

Review: , Mathematics in the USSR during the Forty Years 1917-1957. Vol. 2. Biobibliography

Ann M. Singleterry; 516-517

Review: A. Mostowski, Roczniki Polskiego Towarzystwa Matematycznego

Alonzo Church; 517

Further Citations

517-524

2013 © Association for Symbolic Logic