J. Symbolic Logic, Tome 48 (1983) no. 1

p. 1171-1198

Project Euclid

Une Theorie de Galois Imaginaire

p. 1151-1170

Project Euclid

Downward Transfer of Satisfiability for Sentences of $L^{1,1}$

Malitz, Jerome

p. 1146-1150

Project Euclid

Addendum to "Logic of Reduced Power Structures"

Nelson, G. C.

Project Euclid

A Tableau System of Proof for Predicate-Functor Logic with Identity

Grunberg, Teo

p. 1140-1144

Project Euclid

Model-Complete Theories of Formally Real Fields and Formally $p$-Adic Fields

Wheeler, William H.

Jarden, Moshe ; Wheeler, William H.

p. 1130-1139

Project Euclid

Model-Complete Theories of $e$-Free AX Fields

Gurevich, Yuri ; Shelah, Saharon

p. 1125-1129

Project Euclid

Random Models and the Godel Case of the Decision Problem

Gurevich, Yuri ; Shelah, Saharon

p. 1120-1124

Project Euclid

Rabin's Uniformization Problem

Clote, Peter ; Mcaloon, Kenneth

p. 1105-1119

Project Euclid

Two Further Combinatorial Theorems Equivalent to the 1-Consistency of Peano Arithmetic

p. 1090-1104

Project Euclid

A Baire-Type Theorem for Cardinals

Wolfsdorf, Kurt

p. 1082-1089

Project Euclid

Degrees of Types and Independent Sequences

Knight, Julia F.

p. 1074-1081

Project Euclid

Blunt and Topless End Extensions of Models of Set Theory

Kaufmann, Matt

p. 1053-1073

Project Euclid

On a Generalization of Jensen's $\square_\kappa$, and Strategic Closure of Partial Orders

Velleman, Dan

p. 1046-1052

Project Euclid

On the Ramsey Property for Sets of Reals

Kastanas, Ilias G.

p. 1035-1045

Project Euclid

Forcing and Reducibilities. III. Forcing in Fragments of Set Theory

p. 1013-1034

Project Euclid

The Noncommutativity of Random and Generic Extensions

Truss, J. K.

p. 1008-1012

Project Euclid

Indecomposable Ultrafilters Over Small Large Cardinals

Sheard, Michael

p. 1000-1007

Project Euclid

Modal Analysis of Generalized Rosser Sentences

Svejdar, Vitezslav

p. 986-999

Project Euclid

Some Model Theory of Modules. II. On Stability and Categoricity of Flat Modules

Rothmaler, Philipp

p. 970-985

Project Euclid

Characterizing the Continuous Functionals

Normann, Dag

p. 965-969

Project Euclid

Algebraic Semantics for Quasi-Classical Modal Logics

Blok, W. J. ; Kohler, P.

Barendregt, Henk ; Coppo, Mario ; Dezani-Ciancaglini, Mariangiola

p. 941-964

Project Euclid

A Filter Lambda Model and the Completeness of Type Assignment

p. 931-940

Project Euclid

Wtt-Degrees and T-Degrees of R.E. Sets

Stob, Michael

Collins, William J. ; Young, Paul

p. 921-930

Project Euclid

Discontinuities of Provably Correct Operators on the Provably Recursive Real Numbers

p. 913-920

Project Euclid

Notices

Project Euclid

Annual Meeting of the Association for Symbolic Logic: Philadelphia 1981

Kochen, Simon ; Leblanc, Hughes ; Parsons, Charles D.

p. 898-910

Project Euclid

Meeting of the Association for Symbolic Logic: Singapore 1981

Chong, C. T.

p. 893-897

Project Euclid

Meeting of the Association for Symbolic Logic: Bogota, Colombia, 1981

Arruda, Ayda I. ; Caicedo, Xavier ; Chuaqui, Rolando ; da Costa, Newton C. A.

p. 884-892

Project Euclid

Review: Richard Laver, On the Consistency of Borel's Conjecture; James E. Baumgartner, Richard Laver, Iterated Perfect-Set Forcing

Miller, Arnold W.

p. 882-883

Project Euclid

Review: G. Metakides, A. Nerode, Recursively Enumerable Vector Spaces; G. Metakides, A. Nerode, Effective Content of Field Theory; G. Metakides, A. Nerode, Recursion Theory on Fields and Abstract Dependence

Hamilton, A. G.

p. 880-882

Project Euclid

Review: W. Pohlers, Cut-Elimination for Impredicative Infinitary Systems. Part I. Ordinal- Analysis for $ID_1$; W. Pohlers, Cut Elimination for Impredicative Infinitary Systems. Part II. Ordinal Analysis for Iterated Inductive Definitions

p. 879-880

Project Euclid

Review: Gerhard Jager, Beweistheorie von KPN

Project Euclid

Review: W. Buchholz, W. Pohlers, Provable Wellorderings of Formal Theories for Transfinitely Iterated Inductive Definitions

p. 878-879

Project Euclid

Review: W. Pohlers, Ordinals Connected with Formal Theories for Transfinitely Iterated Inductive Definitions

Project Euclid

Review: W. Pohlers, J. Diller, G. H. Muller, An Upper Bound for the Provability of Transfinite Induction in Systems with N-Times Iterated Inductive Definitions

Project Euclid

Review: Gaisi Takeuti, Mariko Yasugi, The Ordinals of the Systems of Second Order Arithmetic with the Provably $\triangle^1_2$-Comprehension Axiom and with the $\triangle^1_2$- Comprehension Axiom Respectively

p. 877-878

Project Euclid

[Omnibus Review]

Pfeiffer, Helmut

p. 876-877

Project Euclid

Review: R. G. Jeroslow, Redundancies in the Hilbert-Bernays Derivability Conditions for Godel's Second Incompleteness Theorem

Kent, C. F.

p. 875-876

Project Euclid

Review: Tadeusz Kubinski, An Outline of the Logical Theory of Questions

Harrah, David

p. 874-875

Project Euclid

Review: Mordchaj Wajsberg, Stanislaw J. Surma, Logical Works

McCall, Storrs

p. 873-874

Project Euclid

Review: Reuben Hersh, Some Proposals for Reviving the Philosophy of Mathematics

Isaacson, Daniel

p. 871-872

Project Euclid

Review: Douglas R. Hofstadter, Godel, Escher, Bach: An Eternal Golden Braid

Webb, Judson C.

p. 864-871

Project Euclid

Rungs and Trees

Masseron, Marcel

p. 847-863

Project Euclid

On the Strength of the Sikorski Extension Theorem for Boolean Algebras

Bell, J. L.

p. 841-846

Project Euclid

Kleene Index Sets and Functional $m$-Degrees

Mohrherr, Jeanleah

Gurevich, Yuri ; Shelah, Saharon

p. 829-840

Project Euclid

Interpreting Second-Order Logic in the Monadic Theory of Order

p. 816-828

Project Euclid

The Inverse of a Regressive Object

Gross, W. F.

p. 804-815

Project Euclid

Church's Thesis Without Tears

Richman, Fred

p. 797-803

Project Euclid

Intermediate $\beta$-R.E. Degrees and the Half-Jump

Homer, Steven

p. 790-796

Project Euclid

Sentences Implying Their Own Provability

Guaspari, David

p. 777-789

Project Euclid

A Weak Absolute Consistency Proof for Some Systems of Illative Combinatory Logic

Bunder, M. W.

p. 771-776

Project Euclid

Notions of Weak Genericity

Kurtz, Stuart A.

p. 764-770

Project Euclid

Closure Properties of Almost-Finiteness Classes in Recursive Function Theory

Rolletschek, Heinrich

p. 756-763

Project Euclid

Incompatible Extensions of Combinatorial Functions

Ellentuck, Erik

p. 752-755

Project Euclid

Hauptsatz for Higher-Order Modal Logic

Nishimura, Hirokazu

p. 744-751

Project Euclid

Forcing and Reducibilities. II. Forcing in Fragments of Analysis

p. 724-743

Project Euclid

Games Played on Boolean Algebras

Foreman, Matthew

p. 714-723

Project Euclid

Arithmetical Interpretations of Dynamic Logic

Hajek, Petr

p. 704-713

Project Euclid

The $\tau$-Theory for Free Groups Is Undecidable

Lo, Libo

p. 700-703

Project Euclid

Orbits of Hyperhypersimple Sets and the Lattice of $\sum^0_3$ Sets

Herrmann, E.

p. 693-699

Project Euclid

Some Local Definability Results on Countable Topological Structures

Eisenmenger, Holger

p. 683-692

Project Euclid

Forcing in Intuitionistic Systems Without Power-Set

Grayson, R. J.

p. 670-682

Project Euclid

Definability of R. E. Sets in a Class of Recursion Theoretic Structures

Byerly, Robert E.

p. 662-669

Project Euclid

On Forcing Without the Continuum Hypothesis

Abraham, Uri

Abraham, Uri ; Shelah, Saharon

p. 658-661

Project Euclid

Forcing Closed Unbounded Sets

p. 643-657

Project Euclid

Some Recent Developments in Higher Recursion Theory

Friedman, Sy D.

p. 629-642

Project Euclid

Additive Structure in Uncountable Models for a Fixed Completion of $P$

Knight, Julia F.

Kalantari, Iraj ; Remmel, J. B.

p. 623-628

Project Euclid

Degrees of Recursively Enumerable Topological Spaces

p. 610-622

Project Euclid

Sets Constructed from Sequences of Measures: Revisited

Mitchell, William J.

p. 600-609

Project Euclid

A Second Paper "On the Interpolation Theorem for the Logic of Constant Domains"

Lopez-Escobar, E. G. K.

Kirousis, Lefteris Miltiades

p. 595-599

Project Euclid

A Selection Theorem

p. 585-594

Project Euclid

Mapping a Set of Reals Onto the Reals

Miller, Arnold W.

p. 575-584

Project Euclid

Some Model Theory of Modules. I. On Total Transcendence of Modules

Rothmaler, Philipp

Paris, J. B. ; Dimitracopoulos, C.

p. 570-574

Project Euclid

A Note on the Undefinability of Cuts

p. 564-569

Project Euclid

On the Interpretation of Combinators with Weak Reduction

Shabunin, L. V.

Rubin, Matatyahu ; Shelah, Saharon

p. 558-563

Project Euclid

On the Expressibility Hierarchy of Magidor-Malitz Quantifiers

p. 542-557

Project Euclid

On the Number of Countable Homogeneous Models

Lo, Libo

Bernardi, Claudio ; Sorbi, Andrea

p. 539-541

Project Euclid

Classifying Positive Equivalence Relations

p. 529-538

Project Euclid

Notices

Malcolm, W. G. ; Cresswell, M. J.

p. 527-528

Project Euclid

Meeting of the Association for Symbolic Logic: Wellington, New Zealand, 1981

p. 519-526

Project Euclid

Meeting of the Association for Symbolic Logic: Milwaukee, 1981

Barwise, Jon ; Soare, Robert ; Millar, Terrence

p. 514-518

Project Euclid

Meeting of the Association for Symbolic Logic: San Francisco, 1981

Barwise, Jon ; Vaught, Robert ; Moschovakis, Yiannis

p. 505-513

Project Euclid

Review: Hubert C. Kennedy, Peano. Life and Works of Giuseppe Peano

p. 503-504

Project Euclid

Review: Soren Hallden, The Foundations of Decision Logic

Skyrms, Brian

p. 502-503

Project Euclid

Review: David R. Dowty, Word Meaning and Montague Grammar. The Semantics of Verbs and Times in Generative Semantics and in Montague's PTQ

Guenthner, F.

p. 501-502

Project Euclid

Review: Anil Gupta, The Logic of Common Nouns. An Investigation in Quantified Modal Logic

Vlach, Frank

p. 500-501

Project Euclid

Review: Michael R. Garey, David S. Johnson, Computers and Intractability. A Guide to the Theory of NP-Completeness

Lewis, Harry R.

p. 498-500

Project Euclid

Review: Peter G. Hinman, Recursion-Theoretic Hierarchies

Richter, Wayne

p. 497-498

Project Euclid

Review: Saharon Shelah, On Uniqueness of Prime Models

Cherlin, G. L.

Project Euclid

Review: H. Jerome Keisler, The Stability Function of a Theory

Cherlin, G. L.

p. 496-497

Project Euclid

Review: G. L. Cherlin, The Model-Companion of a Class of Structures; L. Lipshitz, D. Saracino, The Model Companion of the Theory of Commutative Rings Without Nilpotent Elements; Angus Macintyre, Model-Completeness for Sheaves of Structures

Comer, Stephen D.

Project Euclid

Review: Tyler Burge, Frege and the Hierarchy; Terence D. Parsons, Peter A. French, Theodore E. Uehling, Howard K. Wettstein, Frege's Hierarchies of Indirect Senses and the Paradox of Analysis

Cresswell, M. J.

p. 495-496

Project Euclid

[Omnibus Review]

Bull, R. A.

p. 488-495

Project Euclid

Review: Kit Fine, Failures of the Interpolation Lemma in Quantified Modal Logic

Kripke, Saul A.

p. 486-488

Project Euclid

[Omnibus Review]

Ressayre, J. P.

p. 484-485

Project Euclid

Review: K. McAloon, Modeles de l'arithmetique, Siminaire Paris VII

Paris, J. B.

p. 483-484

Project Euclid

Review: L. A. S. Kirby, J. B. Paris, A. Lachlan, M. Srebrny, A. Zarach, Initial Segments of Models of Peano's Axioms; J. B. Paris, Some Independence Results for Peano Arithmetic

Simpson, Stephen G.

Kunen, Kenneth ; Pelletier, Donald H.

p. 482-483

Project Euclid

On a Combinatorial Property of Menas Related to the Partition Property for Measures on Supercompact Cardinals

p. 475-481

Project Euclid

The Countably Based Functionals

Hartley, John P.

p. 458-474

Project Euclid

More About Uniform Upper Bounds on Ideals of Turing Degrees

Hodes, Harold T.

p. 441-457

Project Euclid

Some Useful Preservation Theorems

Compton, Kevin J.

p. 427-440

Project Euclid

Completeness in the Theory of Properties, Relations, and Propositions

Bealer, George

p. 415-426

Project Euclid

A Characterization of 2-Square Ultrafilters

Rosen, Ned I.

p. 409-414

Project Euclid

The Slow-Growing and the Grzecorczyk Hierarchies

Cichon, E. A. ; Wainer, S. S.

p. 399-408

Project Euclid

The Monadic Theory of $\omega^1_2$

Gurevich, Yuri ; Magidor, Menachem ; Shelah, Saharon

p. 387-398

Project Euclid

Compactness of a Supervaluational Language

Bencivenga, E.

p. 384-386

Project Euclid

Countable Models of Multidimensional $\aleph_0$-Stable Theories

Bouscaren, Elisabeth

p. 377-383

Project Euclid

R.E. Presented Linear Orders

Roy, Dev Kumar

Simpson, Stephen G. ; Weitkamp, Galen

p. 369-376

Project Euclid

High and Low Kleene Degrees of Coanalytic Sets

p. 356-368

Project Euclid

Groupes Stables, Avec Types Generiques Reguliers

p. 339-355

Project Euclid

Notices

p. 1285-1286

Project Euclid

Index of Reviews: Volumes 47, 48

p. 1273-1283

Project Euclid

Association for Symbolic Logic

p. 1240-1272

Project Euclid

Meeting of the Association for Symbolic Logic: Madison 1982

Keisler, H. Jerome

p. 1233-1239

Project Euclid

The Herbrand Symposium: (Marseilles July 16-July 24 1981)

Stern, J.

p. 1210-1232

Project Euclid

Review: Joseph G. Rosenstein, Linear Orderings

Myers, Dale

p. 1207-1209

Project Euclid

Review: Paul-Henri Steinauer, La Logique au Service du Droit. Etude de Logique Contemporaine pour une Meilleure Communication de la Pensee Juridique

Wolenski, Jan

p. 1206-1207

Project Euclid

Review: J. Zucker, The Correspondence Between Cut-Elimination and Normalization

Previale, Flavio

p. 1204-1206

Project Euclid

Review: Edward Nelson, Internal Set Theory: A New Approach to Nonstandard Analysis

Davis, Martin

p. 1203-1204

Project Euclid

Review: M. P. Fourman, D. S. Scott, C. J. Mulvey, Sheaves and Logic

van Dalen, Dirk

p. 1201-1203

Project Euclid

Review: Kurt Godel, Jesus Mosterin, Obras Completas

Chuaqui, Rolando

Hanf, William P. ; Myers, Dale

p. 1199-1201

Project Euclid

Boolean Sentence Algebras: Isomorphism Constructions

Woodrow, Robert E. ; Knight, Julia F.

p. 329-338

Project Euclid

A Complete Theory with Arbitrarily Large Minimality Ranks

p. 321-328

Project Euclid

A Certain Class of Models of Peano Arithmetic

Kossak, Roman

p. 311-320

Project Euclid

Forcing and Reducibilities

p. 288-310

Project Euclid

Set Theory With a Filter Quantifier

Kaufmann, Matt

p. 263-287

Project Euclid

On Cofinal Extensions of Models of Arithmetic

Kotlarski, Henryk

p. 253-262

Project Euclid

Large Families of Incomparable $A$-Isols

Heck, William S.

p. 250-252

Project Euclid

Paires de Structures Stables

p. 239-249

Project Euclid

Further Consistency and Independence Results in NF Obtained by the Permutation Method

Forster, T. E.

p. 236-238

Project Euclid

An Application of Ultrapowers to Changing Cofinality

Dehornoy, Patrick

p. 225-235

Project Euclid

Notices

p. 223-224

Project Euclid

Further Citations

Project Euclid

Review: Andrzej Grzegorczyk, Olgierd Wojtasiewicz, Waclaw Zawadowski, An Outline of Mathematical Logic. Fundamental Results and Notions Explained with All Details

Lopez-Escobar, E. G. K.

p. 220-222

Project Euclid

Review: Klaus Potthoff, Einfuhrung in die Modelltheorie und ihre Anwendungen

Fuhrken, Gebhard

p. 219-220

Project Euclid

Review: Detlef Laugwitz, Infinitesimalkalkul. Kontinuum und Zahlen--eine elementare Einfuhrung in die Nichtstandard-Analysis

Bos, H. J. M.

p. 217-219

Project Euclid

Review: Neil Tennant, Natural Logic

Sieg, Wilfried

p. 215-217

Project Euclid

Review: L. E. J. Brouwer, D. van Dalen, Brouwer's Cambridge Lectures on Intuitionism

Grayson, R. J.

p. 214-215

Project Euclid

Review: Zohar Manna, Lectures on the Logic of Computer Programming

Bull, Everett L.

p. 213-214

Project Euclid

Review: Dag Normann, Degrees of Functionals

Griffor, E.R.

p. 212-213

Project Euclid

Review: Mark Platts, Reference, Truth and Reality: Essays on the Philosophy of Language

Morton, Adam

p. 208-211

Project Euclid

[Omnibus Review]

Urquhart, Alasdair

Bouscaren, Elisabeth ; Lascar, Daniel

p. 206-208

Project Euclid

Countable Models of Nonmultidimensional $\aleph_0$-Stable Theories

p. 197-205

Project Euclid

Decision Problem for Separated Distributive Lattices

Gurevich, Yuri

p. 193-196

Project Euclid

Hyperhypersimple Supersets in Admissible Recursion Theory

Chong, C. T.

p. 185-192

Project Euclid

The Optimality of Induction as an Axiomatization of Arithmetic

Leivant, Daniel

p. 182-184

Project Euclid

Omitting Types, Type Spectrums, and Decidability

Millar, Terrence

p. 171-181

Project Euclid

The Existence of Countable Totally Nonconstructive Extensions of the Countable Atomless Boolean Algebra

Madison, E. W.

p. 167-170

Project Euclid

A Note on Finitely Generated Models

Pillay, Anand

Berline, Chantal ; Cherlin, Gregory

p. 163-166

Project Euclid

$QE$ Rings in Characteristic $p^n$

p. 140-162

Project Euclid

Proper Classes

Maddy, Penelope

Kalantari, Iraj ; Leggett, Anne

p. 113-139

Project Euclid

Maximality in Effective Topology

p. 100-112

Project Euclid

Antitheses in Systems of Relevant Implication

Porte, Jean

p. 97-99

Project Euclid

Real Functions on the Family of All Well-Ordered Subsets of a Partially Ordered Set

Todorcevic, Stevo

p. 91-96

Project Euclid

Core Models

Dodd, A. J.

p. 78-90

Project Euclid

Sone of George and $V = L$

Fleissner, William G.

p. 71-77

Project Euclid

Choice Principles, the Bar Rule and Autonomously Iterated Comprehension Schemes in Analysis

Feferman, S. ; Jager, G.

p. 63-70

Project Euclid

Post-Scriptum $\grave{A}$"Th$\acute{e}$ories Instables"

p. 60-62

Project Euclid

Logic of Reduced Power Structures

Nelson, G. C.

p. 53-59

Project Euclid

On Generic Extensions Without the Axiom of Choice

Monro, G. P.

p. 39-52

Project Euclid

On the Standard Part of Nonstandard Models of Set Theory

Magidor, Menachem ; Shelah, Saharon ; Stavi, Jonathan

Kierstead, H. A. ; Remmel, J. B.

p. 33-38

Project Euclid

Indiscernibles and Decidable Models

p. 21-32

Project Euclid

A Gentzen- or Beth-Type System, a Practical Decision Procedure and a Constructive Completeness Proof for the Counterfactual Logics $VC$ and $VC$S

de Swart, H. C. M.