Volume 41,
Number 1,
March 1976
- Chi Tat Chong:
An alpha-Finite Injury Method of the Unbounded Type.
1-17 BibTeX
- Michael Beeson:
The Unprovability in Intuitionistic Formal Systems of the Continuity of Effective Operations on the Reals.
18-24 BibTeX
- Julia F. Knight:
Omitting Types in Set Theory and Arithmetic.
25-32 BibTeX
- William Boos:
Infinitary Compactness without Strong Inaccessibility.
33-38 BibTeX
- Charles E. Hughes:
Two Variable Implicational Calculi of Prescribed Many-One Degrees of Unsolvability.
39-44 BibTeX
- Charles E. Hughes:
A Reduction Class Containing Formulas with one Monadic Predicate and one Binary Function Symbol.
45-49 BibTeX
- Ronald Fagin:
Probabilities on Finite Models.
50-58 BibTeX
- Victor Harnik:
Approximation Theorems and Model Theoretic Forcing.
59-72 BibTeX
- Zofia Adamowicz:
One More Aspect of Forcing and Omitting Types.
73-80 BibTeX
- Dov M. Gabbay:
Completeness Properties of Heyting's Predicate Calculus with Respect to RE Models.
81-94 BibTeX
- Volker Weispfenning:
Negative-Existentially Complete Structures and Definability in Free Extensions.
95-108 BibTeX
- Anders M. Nyberg:
Uniform Inductive Definability and Infinitary Languages.
109-120 BibTeX
- Krzysztof R. Apt:
Semantics of the Infinitistic Rules of Proof.
121-138 BibTeX
- John E. Hutchinson:
Elementary Extensions of Countable Models of Set Theory.
139-145 BibTeX
- Seth Catlin:
ED-Regressive Sets of Order n.
146-152 BibTeX
- Leo Harrington, David B. MacQueen:
Selection in Abstract Recursion Theory.
153-158 BibTeX
- Wim Veldman:
An Intuitionistic Completeness Theorem for Intuitionistic Predicate Logic.
159-166 BibTeX
- Leo Harrington, Thomas Jech:
On sigma1 Well-Orderings of the Universe.
167-170 BibTeX
- Victor Harnik, Michael Makkai:
Applications of Vaught Sentences and the Covering Theorem.
171-187 BibTeX
- Douglas A. Cenzer:
Monotone Inductive Definitions over the Continuum.
188-198 BibTeX
- Donald A. Alton:
Diversity of Speed-Ups and Embeddability in Computational Complexity.
199-214 BibTeX
- Leo Marcus:
The <-Order on Submodels.
215-221 BibTeX
- S. Kamal Abdali:
An Abstraction Algorithm for Combinatory Logic.
222-224 BibTeX
- Telis Menas:
A Combinatorial Property of p kappa lambda.
225-234 BibTeX
- Louise Hay:
Boolean Combinations of R.E. Open Sets.
235-238 BibTeX
- Krister Segerberg:
The Truth about Some Post Numbers.
239-244 BibTeX
- Bernd Koppelberg, Sabine Koppelberg:
A Boolean Ultrapower which is not an Ultrapower.
245-249 BibTeX
- Chi Tat Chong:
Minimal Upper Bounds for Ascending Sequences of alpha-Recursively Enumerable Degrees.
250-260 BibTeX
- G. H. Muller, Arnold Oberschelp, K. Potthoff:
European Meeting of the Association for Symbolic Logic, Kiel, Federal Republic of Germany, 1974.
261-278 BibTeX
- James C. Owings, Hilary Putnam, Gerald E. Sacks:
Meeting of the Association for Symbolic Logic Washington, D.C., 1975.
279-288 BibTeX
Volume 41,
Number 2,
June 1976
- Alistair H. Lachlan, R. Lebeuf:
Countable Initial Segments of the Degrees of Unsolvability.
289-300 BibTeX
- Johan van Benthem:
Modal Reduction Principles.
301-312 BibTeX
- Zofia Adamowicz:
On Finite Lattices of Degrees of Constructibility of Reals.
313-322 BibTeX
- William C. Powell:
A Completeness Theorem for Zermelo-Fraenkel Set Theory.
323-327 BibTeX
- Michael Beeson:
Derived Rules of Inference Related to the Continuity of Effective Operations.
328-336 BibTeX
- Scott K. Lehmann:
An Interpretation of "Finite" Modal First-Order Languages in Classical Second-Order Languages.
337-340 BibTeX
- Harry R. Lewis:
Krom Formulas with One Dyadic Predicate Letter.
341-362 BibTeX
- Harvey Friedman:
Uniformly Defined Descending Sequences of Degrees.
363-367 BibTeX
- John Paulos:
Noncharacterizability of the Syntax Set.
368-372 BibTeX
- Douglas R. Busch:
lambda-Scales, kappa-Souslin Sets and a New Definition of Analytic Sets.
373-378 BibTeX
- Harold Simmons:
Large and Small Existentially Closed Structures.
379-390 BibTeX
- J. C. E. Dekker:
Projective Planes of Infinite But Isolic Order.
391-404 BibTeX
- Manuel Lerman:
Congruence Relations, Filters, Ideals, and Definability in Lattices of alpha-Recursively Enumerable Sets.
405-418 BibTeX
- Manuel Lerman:
Types of Simple alpha-Recursively Enumerable Sets.
419-426 BibTeX
- F. Lowenthal:
Equivalence of Some Definitions of Recursion in a Higher Type Object.
427-435 BibTeX
- Johan van Benthem:
Modal Formulas are Either Elementary or not sigma triangle-Elementary.
436-438 BibTeX
- Larry W. Miller:
Normal Functions and Constructive Ordinal Notations.
439-459 BibTeX
- Yuri Gurevich:
The Decision Problem for Standard Classes.
460-464 BibTeX
- John Lake:
Relative Consistency of an Extension of Ackermann's Set Theory.
465-466 BibTeX
- Martin W. Bunder:
The Inconsistency of F * 21.
467-468 BibTeX
- Dwight R. Bean:
Effective Coloration.
469-480 BibTeX
- James E. Baumgartner, Leo Harrington, E. M. Kleinberg:
Adding a Closed Unbounded Set.
481-482 BibTeX
- Northrup Fowler III:
alpha-Decompositions of alpha-Spaces.
483-488 BibTeX
- John E. Hutchinson:
Order Types of Ordinals in Models of Set Theory.
489-502 BibTeX
- A. Bezboruah, John C. Shepherdson:
Godel's Second Incompleteness Theorem for Q.
503-512 BibTeX
- Robert I. Soare:
The Infinite Injury Priority Method.
513-530 BibTeX
- Jon Barwise, John S. Schlipf:
An Introduction to Recursively Saturated and Resplendent Models.
531-536 BibTeX
- Gregory L. Cherlin:
Model Theoretic Algebra.
537-545 BibTeX
- John T. Baldwin, Donald A. Martin, Robert I. Soare, William W. Tait:
Meeting of the Association for Symbolic Logic.
551-560 BibTeX
Volume 41,
Number 3,
September 1976
Volume 41,
Number 4,
December 1976
Copyright © Sun May 17 00:12:04 2009
by Michael Ley (ley@uni-trier.de)
