J. Symbolic Logic, Tome 52 (1987) no. 1

p. 1143-1144

Project Euclid

Index of Reviews: Volumes LI, LII

p. 1136-1142

Project Euclid

Association for Symbolic Logic

p. 1095-1135

Project Euclid

European Summer Meeting of the Association for Symbolic Logic: Hull, 1986

p. 1057-1094

Project Euclid

Review: Dan Haran, Moshe Jarden, Bounded Statements in the Theory of Algebraically Closed Fields with Distinguished Automorphisms

Project Euclid

Review: Rainer Weissauer, Der Hilbertsche Irreduzibilitatssatz

Project Euclid

Review: Peter Roquette, Nonstandard Aspects of Hilbert's Irreducibility Theorem

Project Euclid

Review: William H. Wheeler, Model-Complete Theories of Pseudo-Algebraically Closed Fields

p. 1055-1056

Project Euclid

Review: Allan Adler, Catarina Kiefe, Pseudofinite Fields, Procyclic Fields and Model-Completion

Project Euclid

Review: Catarina Kiefe, Sets Definable over Finite Fields :Their Zeta-Functions

Project Euclid

Review: Wilfried Sieg, Fragments of Arithmetic

Clote, Peter G.

p. 1054-1055

Project Euclid

Review: Stuart M. Shieber, An Introduction to Unification-Based Approaches to Grammar

Garson, James W.

p. 1052-1054

Project Euclid

Review: Anthony Appiah, Assertion and Conditionals

Cohen, Daniel

p. 1051-1052

Project Euclid

Review: Fred Feldman, Doing the Best We Can. An Essay in Informal Deontic Logic

Makinson, David

p. 1050-1051

Project Euclid

Review: Zarko Mijajlovic, Zoran Markovic, Kosta Dosen, Hilbert's Problems and Logic

Velickovic, Boban

p. 1049-1050

Project Euclid

Review: James M. Henle, An Outline of Set Theory

Roitman, Judith

p. 1048-1049

Project Euclid

Review: Errett Bishop, Douglas Bridges, Constructive Analysis

Goodman, Nicolas D.

p. 1047-1048

Project Euclid

Review: Kenneth Kunen, Jerry E. Vaughan, Handbook of Set-Theoretic Topology

Baldwin, Stewart

p. 1044-1046

Project Euclid

Theories d'Algebres de Boole Munies d'Ideaux Distingues. I. Theories Elementaires

Touraille, Alain

p. 1027-1043

Project Euclid

Omitting Types and the Real Line

Newelski, Ludomir

p. 1020-1026

Project Euclid

Properties of Subtle Cardinals

Henrion, Claudia

p. 1005-1019

Project Euclid

Corps Portant Un Nombre Fini de Valuations

Delon, Francoise

p. 994-1004

Project Euclid

On the Rowbottom $M$-Ultrafilters

Feng, Qi

p. 990-993

Project Euclid

Categorical Semantics for Higher Order Polymorphic Lambda Calculus

Seely, R. A. G.

p. 969-989

Project Euclid

On Two Hierarchies of Dimensions

Baudisch, Andreas

p. 959-968

Project Euclid

Uncountable Master Codes and the Jump Hierarchy

Lubarsky, Robert S.

p. 952-958

Project Euclid

A Constructive Analysis of $\mathbf{RM}$

Avron, Arnon

p. 939-951

Project Euclid

Gap-2 Morasses of Height $\omega$

Velleman, Dan

p. 928-938

Project Euclid

Polynomial Size Proofs of the Propositional Pigeonhole Principle

Buss, Samuel R.

p. 916-927

Project Euclid

Minimality in the $\triangle^1_3$-Degrees

Welch, Philip

p. 908-915

Project Euclid

Partition Properties of M-Ultrafilters and Ideals

Takahashi, Joji

p. 897-907

Project Euclid

Notices

p. 895-896

Project Euclid

Open Days in Set Theory and Arithmetic

Dunn, Michael ; Lipshitz, Leonard

p. 888-894

Project Euclid

Meeting of the Association for Symbolic Logic: Indianapolis

p. 883-887

Project Euclid

Review: M. J. Cresswell, Structured Meanings: The Semantics of Propositional Attitudes

Israel, David

p. 878-882

Project Euclid

Review: Johan van Benthem, Alice ter Meulen, Generalized Quantifiers in Natural Language

Mundici, Daniele

p. 876-878

Project Euclid

Review: J. F. A. K. van Benthem, The Logic of Time. A Model-Theoretic Investigation into the Varieties of Temporal Antology and Temporal Discourse

Kuhn, Steven T.

p. 874-876

Project Euclid

Review: Michael J. O'Donnell, Equational Logic as a Programming Language

Taylor, Walter

p. 873-874

Project Euclid

Review: Saharon Shelah, Differential Closed Fields

Poizat, Bruno

p. 870-873

Project Euclid

[Omnibus Review]

Louveau, Alain

p. 869-870

Project Euclid

Review: Herman Rubin, Jean E. Rubin, Equivalents of the Axiom of Choice, II

Pincus, David

p. 867-869

Project Euclid

Review: Keith J. Devlin, Constructibility

Stanley, Lee J.

p. 864-867

Project Euclid

Nonstandard Characterizations of Recursive Saturation and Resplendency

Smith, Stuart T.

p. 842-863

Project Euclid

Quantum Logic and the Classical Propositional Calculus

Malhas, Othman Qasim

p. 834-841

Project Euclid

On the Existence of Extensional Partial Combinatory Algebras

Bethke, Ingemarie

p. 819-833

Project Euclid

Monotone but not Positive Subsets of the Cantor Space

Dougherty, Randall

p. 817-818

Project Euclid

An Analytic Completeness Theorem for Logics with Probability Quantifiers

Hoover, Douglas N.

p. 802-816

Project Euclid

Open Induction and the True Theory of Rationals

Adamowicz, Zofia

Albert, Michael H. ; Willard, Ross

p. 793-801

Project Euclid

Injectives in Finitely Generated Universal Horn Classes

p. 786-792

Project Euclid

A Preservation Theorem for EC-Structures with Applications

Albert, Michael H.

p. 779-785

Project Euclid

First Order Topological Structures and Theories

Pillay, Anand

p. 763-778

Project Euclid

Modal Sequents and Definability

Kapron, Bruce M.

p. 756-762

Project Euclid

Von Mises' Definition of Random Sequences Reconsidered

Lambalgen, Michiel Van

Sankappanavar, Hanamantagouda P.

p. 725-755

Project Euclid

Semi-De Morgan Algebras

p. 712-724

Project Euclid

Complete Theories with Only Universal and Existential Axioms

Lachlan, A. H.

p. 698-711

Project Euclid

Monadic Binary Relations and the Monad Systems at Near-Standard Points

Vakil, Nader

p. 689-697

Project Euclid

On $\Pi_1$-Automorphism of Recursive Linear Orders

Kierstead, Henry A.

p. 681-688

Project Euclid

Natural Deduction and Sequent Calculus for Intuitionistic Relevant Logic

Tennant, Neil

p. 665-680

Project Euclid

A Model in which the Base-Matrix Tree Cannot have Cofinal Branches

Dordal, Peter Lars

p. 651-664

Project Euclid

Proper Classes via the Iterative Conception of Set

Sharlow, Mark F.

Paola, Robert A. Di ; Heller, Alex

p. 636-650

Project Euclid

Dominical Categories: Recursion Theory without Elements

p. 594-635

Project Euclid

Combinatorics on Ideals and Forcing with Trees

Groszek, Marcia J.

p. 582-593

Project Euclid

A Simple Relationship between Buchholz's New System of Ordinal Notations and Takeuti's System of Ordinal Diagrams

Okada, Mitsuhiro

p. 577-581

Project Euclid

Notices

p. 575-576

Project Euclid

[Omnibus Review]

Landraitis, Charles

p. 571-574

Project Euclid

Review: Kenneth McAloon, On the Sequence of Models $\operatorname{HOD}_n$; Thomas J. Jech, Forcing with Trees and Ordinal Definability; Wlodzimierz Zadrozny, Iterating Ordinal Definability

David, Rene

p. 570-571

Project Euclid

Review: Michael Hallett, Cantorian Set Theory and Limitation of Size

Moore, Gregory H.

p. 568-570

Project Euclid

Review: Gregory Cherlin, Lou van Den Dries, Angus Macintyre, Decidability and Undecidability Theorems for PAC-fields

Project Euclid

Review: Moshe Jarden, The Elementary Theory of $\omega$free Ax Fields

p. 567-568

Project Euclid

Review: Moshe Jarden, Ursel Kiehne, The Elementary Theory of Algebraic Fields of Finite Corank

Project Euclid

Review: S. G. Gindikin, Algebra Logiki v Zadacah; Moshe Jarden, Elementary Statements over large Algebraic Fields

Project Euclid

Review: S. G. Gindikin, Robert H. Silverman, Algebraic Logic

Nelson, Raymond J.

p. 565-567

Project Euclid

Review: H. E. Rose, Subrecursion. Functions and Hierarchies

Schwichtenberg, H.

p. 563-565

Project Euclid

Review: David Marker, J. Stern, Degrees of Models of True Arithmetic; Julia Knight, Alistair H. Lachlan, Robert I. Soare, Two Theorems on Degrees of Models of True Arithmetic

Millar, Terrence S.

p. 562-563

Project Euclid

[Omnibus Review]

Scedrov, Andre

Project Euclid

Review: Ermanno Bencivenga, Una Logic Dei Termini Singolari

Angelelli, Ignacio

p. 558-561

Project Euclid

Review: Johan van Benthem, Modal Logic and Classical Logic

Bull, R. A.

p. 557-558

Project Euclid

Review: Alan Bundy, The Computer Modelling of Mathematical Reasoning

Lifschitz, Vladimir

p. 555-557

Project Euclid

Review: Edward L. Keenan, Leonard M. Faltz, Boolean Semantics for Natural Language

Moss, Lawrence S.

p. 554-555

Project Euclid

Review: Paul Benacerraf, Mathematical Truth; Michael Jubien, Ontology and Mathematical Truth; Philip Kitcher, The Plight of the Platonist

Hart, W. D.

p. 552-554

Project Euclid

On Nontrivial Types of $U$-Rank

Buechler, Steven

p. 548-551

Project Euclid

Isolated Types in a Weakly Minimal Set

Buechler, Steven

p. 543-547

Project Euclid

Complete Boolean Ultraproducts

Canjar, R. Michael

p. 530-542

Project Euclid

A Contractionless Semilattice Semantics

Giambrone, Steve ; Meyer, Robert K. ; Urquhart, Alasdair

Krishnamurthy, E. V. ; Vickers, B. P.

p. 526-529

Project Euclid

Compact Numeral Representation with Combinators

p. 519-525

Project Euclid

Inconsistent Nonstandard Arithmetic

Mortensen, Chris

p. 512-518

Project Euclid

Provability in Finite Subtheories of Pa and Relative Interpretability: A Modal Investigation

Montagna, Franco

p. 494-511

Project Euclid

Systematization of Finite Many-Valued Logics Through the Method of Tableaux

Carnielli, Walter A.

p. 473-493

Project Euclid

A Theory of Properties

Turner, Ray

p. 455-472

Project Euclid

Limit Ultrapowers and Abstract Logics

Lipparini, Paolo

p. 437-454

Project Euclid

On the Consistency of Self-Referential Systems

Sobrinho, J. Zimbarg

p. 425-436

Project Euclid

Reduced Coproducts of Compact Hausdorff Spaces

Bankston, Paul

p. 404-424

Project Euclid

Pas D'Imaginaires Dans L'Infini!

Pillay, Anand ; Poizat, Bruno

p. 400-403

Project Euclid

Martin's Axiom and a Regular Topological Space with Uncountable Net Weight Whose Countable Product is Hereditarily Separable and Hereditarily Lindelof

Ciesielski, Krzysztof

p. 396-399

Project Euclid

A Hierarchy of Filters On Regular Uncountable Cardinals

Jech, Thomas

p. 388-395

Project Euclid

Term Models for Weak Set Theories with a Universal Set

Forster, T. E.

p. 374-387

Project Euclid

A Note on Elementary Equivalence of $C(K)$ Space

Heinrich, S. ; Henson, C. Ward ; Moore, L. C.

p. 368-373

Project Euclid

Semiproper Forcing Axiom Implies Martin Maximum but Not $|mathrm{PFA}^+$

Shelah, Saharon

p. 360-367

Project Euclid

On Partitions of the Real Line Into Compact Sets

Newelski, Ludomir

p. 353-359

Project Euclid

Notices

p. 351-352

Project Euclid

European Summer Meeting of the Association for Symbolic Logic, Paris, 1985

p. 295-349

Project Euclid

Review: Martin Davis, Computability & Unsolvability; Martin Davis, Hilbert's Tenth Problem is Unsolvable

Enderton, H. B.

Project Euclid

Review: Martin D. Davis, Elaine J. Weyuker, Computability, Complexity, and Languages. Fundamentals of Theoretical Computer Science

Maass, Wolfgang

p. 293-294

Project Euclid

Review: Nigel Cutland, Computability. An Introduction to Recursive Function Theory

Enderton, H. B.

p. 292-293

Project Euclid

Review: A. J. Kfoury, Robert N. Moll, Michael A. Arbib, A Programming Approach to Computability

Edmundson, H. P.

p. 289-291

Project Euclid

Review: J. W. Lloyd, Foundations of Logic Programming

Shepherdson, John C.

p. 288-289

Project Euclid

Review: Ferenc Gecseg, Magnus Steinby, Tree Automata

Siefkes, Dirk

p. 287-288

Project Euclid

Review: C. T. Chong, Techniques of Admissible Recursion Theory

Leggett, Anne

p. 285-287

Project Euclid

Review: C. P. J. Koymans, Models of the Lambda Calculus

Longo, Giuseppe

p. 284-285

Project Euclid

Review: Jon Barwise, John Schlipf, D. H. Saracino, V. B. Weispfenning, Model Theory and Algebra

Ressayre, J.-P.

p. 279-284

Project Euclid

Review: Michael J. Beeson, Foundations of Constructive Mathematics. Metamathematical Studies

Howard, William A.

p. 278-279

Project Euclid

Review: Harvey M. Friedman, Stephen G. Simpson, Rick L. Smith, Countable Algebra and Set Existence Axioms; Harvey M. Friedman, Stephen G. Simpson, Rick L. Smith, Addendum to "Countable Algebra and Set Existence Axioms."

Clote, Peter G.

p. 276-278

Project Euclid

Completeness of Transfinite Evaluation in an Extension of the Lambda Calculus

Sanchis, Luis E.

p. 243-275

Project Euclid

Sequential Discreteness and Clopen-$I$-Boolean Classes

Dougherty, Randall

p. 232-242

Project Euclid

Some New Natural $\alpha$-RE-Degrees

Bailey, Colin G.

Lauchli, Hans ; Savioz, Christian

p. 227-231

Project Euclid

Monadic Second Order Definable Relations on the Binary Tree

p. 219-226

Project Euclid

Strong Analogues of Martin's Axiom Imply Axiom R

Beaudoin, Robert E.

p. 216-218

Project Euclid

A Note on a Proof of Hilbert's Second $\varepsilon$-Theorem

Ferrari, Pier Luigi

p. 214-215

Project Euclid

Simple R. E. Degree Structures

Lubarsky, Robert S.

p. 208-213

Project Euclid

A Strongly Minimal Expansion of $(\omega, s)$

Marker, David

p. 205-207

Project Euclid

Elementary Axioms for Canonical Points of Toposes

McLarty, Colin

p. 202-204

Project Euclid

A Constructive Interpretation of the Full Set Theory

Turchin, Valentin F.

p. 172-201

Project Euclid

The Degree of the Set of Sentences of Predicate Provability Logic that are True Under Every Interpretation

Boolos, George ; McGee, Vann

Pillay, Anand ; Steinhorn, Charles

p. 165-171

Project Euclid

On Dedekind Complete O-Minimal Structures

p. 156-164

Project Euclid

Definability in Number Fields

Tung, S. P.

p. 152-155

Project Euclid

Concerning Ultrafilters on Ultrapowers

Henle, J. M.

Kaufmann, Matt ; Schmerl, James H.

p. 149-151

Project Euclid

Remarks on Weak Notions of Saturation in Models of Peano Arithmetic

p. 129-148

Project Euclid

Elimination of Quantifiers for Ordered Valuation Rings

Dickmann, M. A.

p. 116-128

Project Euclid

Morasses and the Levy-Collapse

Komjath, P.

p. 111-115

Project Euclid

Some Consistency Proofs and a Characterization of Inconsistency Proofs in Illative Combinatory Logic

Bunder, M. W.

p. 89-110

Project Euclid

Relative Lawlessness in Intuitionistic Analysis

Moschovakis, Joan Rand

p. 68-88

Project Euclid

The Reals in Core Models

Welch, Philip

Eklof, Paul C. ; Mez, Hans-Christian

p. 64-67

Project Euclid

Modules of Existentially Closed Algebras

p. 54-63

Project Euclid

No Jonsson Filters Over $\aleph_\omega$

Tryba, Jan

p. 51-53

Project Euclid

Prikry Forcing at $\kappa^+$ and Beyond

Mitchell, William

p. 44-50

Project Euclid

Classifying the Computational Complexity of Problems

Stockmeyer, Larry