Miscellaneous front pages, J. Symbolic Logic, Volume 41, Issue 1 (1976)

• View Abstract

An $\alpha$-Finite Injury Method of the Unbounded Type

C. T. Chong; 1-17

• View Abstract

The Unprovability in Intuitionistic Formal Systems of the Continuity of Effective Operations on the Reals

Michael Beeson; 18-24

• View Abstract

Omitting Types in Set Theory and Arithmetic

Julia F. Knight; 25-32

• View Abstract

Infinitary Compactness without Strong Inaccessibility

William Boos; 33-38

• View Abstract

Two Variable Implicational Calculi of Prescribed Many-One Degrees of Unsolvability

Charles E. Hughes; 39-44

• View Abstract

A Reduction Class Containing Formulas with one Monadic Predicate and one Binary Function Symbol

Charles E. Hughes; 45-49

• View Abstract

Probabilities on Finite Models

Ronald Fagin; 50-58

• View Abstract

Approximation Theorems and Model Theoretic Forcing

Victor Harnik; 59-72

• View Abstract

One More Aspect of Forcing and Omitting Types

Zofia Adamowicz; 73-80

• View Abstract

Completeness Properties of Heyting's Predicate Calculus with Respect to RE Models

Dov M. Gabbay; 81-94

• View Abstract

Negative-Existentially Complete Structures and Definability in Free Extensions

Volker Weispfenning; 95-108

• View Abstract

Uniform Inductive Definability and Infinitary Languages

Anders M. Nyberg; 109-120

• View Abstract

Semantics of the Infinitistic Rules of Proof

Krzysztof Rafal Apt; 121-138

• View Abstract

Elementary Extensions of Countable Models of Set Theory

John E. Hutchinson; 139-145

• View Abstract

ED-Regressive Sets of Order $n$

Seth Catlin; 146-152

• View Abstract

Selection in Abstract Recursion Theory

L. A. Harrington and D. B. MacQueen; 153-158

• View Abstract

An Intuitionistic Completeness Theorem for Intuitionistic Predicate Logic

Wim Veldman; 159-166

• View Abstract

On $\Sigma_1$ Well-Orderings of the Universe

Leo Harrington and Thomas Jech; 167-170

• View Abstract

Applications of Vaught Sentences and the Covering Theorem

Victor Harnik and Michael Makkai; 171-187

• View Abstract

Monotone Inductive Definitions over the Continuum

Douglas Cenzer; 188-198

• View Abstract

Diversity of Speed-Ups and Embeddability in Computational Complexity

Donald A. Alton; 199-214

• View Abstract

The $\prec$-Order on Submodels

Leo Marcus; 215-221

• View Abstract

An Abstraction Algorithm for Combinatory Logic

S. Kamal Abdali; 222-224

• View Abstract

A Combinatorial Property of $p_\kappa\lambda$

Telis K. Menas; 225-234

• View Abstract

Boolean Combinations of R.E. Open Sets

Louise Hay; 235-238

• View Abstract

The Truth about Some Post Numbers

Krister Segerberg; 239-244

• View Abstract

A Boolean Ultrapower which is not an Ultrapower

Bernd Koppelberg and Sabine Koppelberg; 245-249

• View Abstract

Minimal Upper Bounds for Ascending Sequences of $\alpha$-Recursively Enumerable Degrees

C. T. Chong; 250-260

• View Abstract

European Meeting of the Association for Symbolic Logic, Kiel, Federal Republic of Germany, 1974

G. H. Muller, A. Oberschelp and K. Potthoff; 261-278

• View Abstract

Meeting of the Association for Symbolic Logic Washington, D.C., 1975

James Owings, Hilary Putnam and Gerald Sacks; 279-288

• View Abstract

Miscellaneous back pages, J. Symbolic Logic, Volume 41, Issue 1 (1976)

• View Abstract