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 27, Issue 3

Publication Date: September, 1962

Early History of the Association for Symbolic Logic

C. J. Ducasse and Haskell B. Curry; 255-258

Transfinite Recursive Progressions of Axiomatic Theories

Solomon Feferman; 259-316

An Improved Prenex Normal Form

C. C. Chang and H. Jerome Keisler; 317-326

A Propositional Logic with Subjunctive Conditionals

R. B. Angell; 327-343

Some Forms of Completeness

P. C. Gilmore; 344-352

Reviews

Review: Paul Bernays, Zur Frage der Unendlichkeitsschemata in der Axiomatischen Mengenlehre

J. C. Shepherdson; 353-354

Review: Gaisi Takeuti, Axioms of Infinity of Set Theory

J. C. Shepherdson; 354-355

Review: Simon Kochen, Ultraproducts in the Theory of Models

C. C. Chang; 355-357

Review: H. Jerome Keisler, Ultraproducts and Elementary Classes

C. C. Chang; 357-358

Review: A. Grzegorczyk, An Example of Two Weak Essentially Undecidable Theories F and F$^\ast$

Raphael M. Robinson; 358

Review: S. C. Kleene, Countable Functionals; S. C. Kleene, Recursive Functionals of Higher Finite Types

Donald L. Kreider; 359-360

Review: N. M. Nagornyj, Some Generalizations of the Concept of Normal Algorithm

E. M. Fels; 360-362

Review: V. K. Detlovs, The Equivalence of Normal Algorithms and Recursive Functions

E. M. Fels; 362

Review: U. I. Anov, On Logical Schemata of Algorithms

E. M. Fels; 362-363

Review: L. A. Kaluznin, On Algorithmization of Mathematical Problems

E. M. Fels; 363-364

Review: A. P. Ersov, Operator Algorithms. I. Basic Concepts

E. M. Fels; 364-366

Review: V. S. Koroluk, On the Concept of Address Algorithm

E. M. Fels; 366

Review: N. V. Belakin, The Universality of a Computing Machine with Potentially Infinite Exterior Memory

E. M. Fels; 366

Review: Andras Adam, Uber Zweipolige Elektrische Netze

G. Pollak; 366-367

Review: Gyorgy Pollak, Bemerkung zur Arbeit "Uber Zweipolige Elektrische Netze, II." von A. Adam

A. Adam; 367

Review: Klaus Hartig, Zur Axiomatisierung der Nicht-Identitaten des Aussagenkalkuls

Gene F. Rose; 367

Review: Gr. C. Moisil, Sur les Ideaux des Algebres Lukasiewicziennes Trivalents

Gene F. Rose; 367-368

Review: Gr. C. Moisil, Sur la Logique a Trois Valeurs de Lukasiewicz

Gene F. Rose; 368

Further Citations

368-372

Meeting of the Association for Symbolic Logic, Leeds 1962

M. H. Lob; 373-382

2013 © Association for Symbolic Logic