The Journal of Symbolic Logic
, Volume 32
Volume 32, Number 1, March 1967
Nuel D. Belnap Jr.
: Intensional Models for First Degree Formulas. 1-22
BibTeX
H. Jerome Keisler
: Ultraproducts which are not Saturated. 23-46
BibTeX
H. Jerome Keisler
: Ultraproducts of Finite Sets. 47-57
BibTeX
M. J. Cresswell
: Note on a System of Aqvist. 58-60
BibTeX
C. C. Chang
: Omitting Types of Prenex Formulas. 61-74
BibTeX
John Riser
: A Gentzen-Type Calculus of Sequents for Single-Operator Propositional Logic. 75-80
BibTeX
Dag Prawitz
: A Note on Existential Instantiation. 81-82
BibTeX
Storrs McCall
: Connexive Class Logic. 83-90
BibTeX
Gerald J. Massey
: Binary Connectives Functionally Complete by Themselves in S5 Modal Logic. 91-92
BibTeX
Frederic Brenton Fitch
: A Complete and Consistent Modal Set Theory. 93-103
BibTeX
Volume 32, Number 2, June 1967
Mariko Yasugi
: Interpretations of Set Theory and Ordinal Number Theory. 145-161
BibTeX
Robert W. Robinson
: Simplicity of Recursively Enumerable Sets. 162-172
BibTeX
James C. Owings Jr.
: Recursion, Metarecursion, and Inclusion. 173-179
BibTeX
Robert A. Di Paola
: Some Theorems on Extensions of Arithmetic. 180-189
BibTeX
R. L. Graham
: On n-Valued Functionally Complete Truth Functions. 190-195
BibTeX
James Thomson
: Proof of the Law of Infinite Conjunction using the Perfect Disjunctive Normal Form. 196-197
BibTeX
William Tait
: Intensional Interpretations of Functionals of Finite Type I. 198-212
BibTeX
Bruce Lercher
: Strong Reduction and Normal Form in Combinatory Logic. 213-223
BibTeX
J. Roger Hindley
: Axioms for Strong Reduction in Combinatory Logic. 224-236
BibTeX
Bruce Lercher
: The Decidability of Hindley's Axioms for Strong Reduction. 237-239
BibTeX
Volume 32, Number 3, September 1967
Ralph Kopperman
: The L
omega1, omega1
-Theory of Hilbert Spaces. 295-304
BibTeX
E. G. K. López-Escobar
: Remarks on an Infinitary Language with Constructive Formulas. 305-318
BibTeX
Leslie H. Tharp
: On a Set Theory of Bernays. 319-321
BibTeX
K. I. Appel
: There Exist Two Regressive Sets Whose Intersection is Not Regressive. 322-324
BibTeX
Julia Robinson
: An Introduction to Hyperarithmetical Functions. 325-342
BibTeX
Akiko Kino
: Correction to a Paper on Definability of Ordinals in Infinite Logic. 343-344
BibTeX
Richmond H. Thomason
,
Hugues Leblanc
: All or None: A Novel Choice of Primitives for Elementary Logic. 345-351
BibTeX
Wilson E. Singletary
: A Note on Finite Axiomatization of Partial Propositional Calculi. 352-354
BibTeX
John L. Pollock
: Basic Modal Logic. 355-365
BibTeX
Vladimir Devide
: A Proof of Zermelo's Theorem. 366
BibTeX
Carol Karp
: Nonaxiomatizability Results for Infinitary Systems. 367-384
BibTeX
John Alan Robinson
,
Norman M. Martin
: Meeting of the Association for Symbolic Logic. 430
BibTeX
Volume 32, Number 4, December 1967
Herbert B. Enderton
: An Infinitistic Rule of Proof. 447-451
BibTeX
Kanji Namba
: N
0
-Complete Cardinals and Transcendency of Cardinals. 452-472
BibTeX
Robert L. Vaught
: Axiomatizability by a Schema. 473-479
BibTeX
J. Jay Zeman
: A System of Implicit Quantification. 480-504
BibTeX
M. D. Gladstone
: A Reduction of the Recursion Scheme. 505-508
BibTeX
H. A. Schmidt
,
K. Schutte
,
Ernst-Jochen Thiele
,
M. J. Cresswell
: Meeting of the Association for Symbolic Logic. 556-577
BibTeX
Copyright ©
Sun May 17 00:12:06 2009 by
Michael Ley
(
ley@uni-trier.de
)