Set theoretical analogues of the Barwise-Schlipf theorem

Annals of Pure and Applied Logic 173 (9):103158 (2022)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2022.103158

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,440

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

A proofless proof of the Barwise compactness theorem.Mark Howard - 1988 - Journal of Symbolic Logic 53 (2):597-602.
Model Theory and Algebra.Jon Barwise, John Schlipf, D. H. Saracino & V. B. Weispfenning - 1987 - Journal of Symbolic Logic 52 (1):279-284.
An introduction to recursively saturated and resplendent models.Jon Barwise & John Schlipf - 1976 - Journal of Symbolic Logic 41 (2):531-536.
An Introduction to Recursively Saturated and Resplendent Models.Jon Barwise & John Schlipf - 1982 - Journal of Symbolic Logic 47 (2):440-440.
An algebraic treatment of the Barwise compactness theory.Isidore Fleischer & Philip Scott - 1991 - Studia Logica 50 (2):217 - 223.
Review: Jon Barwise, John Schlipf, D. H. Saracino, V. B. Weispfenning, Model Theory and Algebra. [REVIEW]J.-P. Ressayre - 1987 - Journal of Symbolic Logic 52 (1):279-284.
Review: Jon Barwise, John Schlipf, An Introduction to Recursively Saturated and Resplendent Models. [REVIEW]Julia F. Knight - 1982 - Journal of Symbolic Logic 47 (2):440-440.
An Algebraic Proof of the Barwise Compactness Theorem.Carol Karp & Jon Barwise - 1974 - Journal of Symbolic Logic 39 (2):335-335.
Review: Carol Karp, Jon Barwise, An Algebraic Proof of the Barwise Compactness Theorem. [REVIEW]N. J. Cutland - 1974 - Journal of Symbolic Logic 39 (2):335-335.
Condensable models of set theory.Ali Enayat - 2022 - Archive for Mathematical Logic 61 (3):299-315.
Karp Carol. An algebraic proof of the Barwise compactness theorem. The syntax and semantics of infinitary languages, edited by Barwise Jon, Lecture notes in mathematics, no. 72, Springer-Verlag, Berlin, Heidelberg, and New York, 1968, pp. 80–95. [REVIEW]N. J. Cutland - 1974 - Journal of Symbolic Logic 39 (2):335-335.
Jon Barwise and John Schlipf. An introduction to recursively saturated and resplendent models. The journal of symbolic logic, vol. 41 , pp. 531–536.Julia F. Knight - 1982 - Journal of Symbolic Logic 47 (2):440.
Unary quantification revisited.Bart Geurts - unknown
Jump Theorems for REA Operators.Alistair H. Lachlan & Xiaoding Yi - 1993 - Mathematical Logic Quarterly 39 (1):1-6.
A converse of the Barwise completeness theorem.Jonathan Stavi - 1973 - Journal of Symbolic Logic 38 (4):594-612.

Analytics

Added to PP
2022-06-24

Downloads
13 (#1,043,322)

6 months
5 (#649,106)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

Destructibility and axiomatizability of Kaufmann models.Corey Bacal Switzer - 2022 - Archive for Mathematical Logic 61 (7):1091-1111.

Add more citations

References found in this work

Subsystems of Second Order Arithmetic.Stephen G. Simpson - 1999 - Studia Logica 77 (1):129-129.
Admissible Sets and Structures.Jon Barwise - 1978 - Studia Logica 37 (3):297-299.
Classes and truths in set theory.Kentaro Fujimoto - 2012 - Annals of Pure and Applied Logic 163 (11):1484-1523.
Condensable models of set theory.Ali Enayat - 2022 - Archive for Mathematical Logic 61 (3):299-315.
Recursively saturated nonstandard models of arithmetic.C. Smoryński - 1981 - Journal of Symbolic Logic 46 (2):259-286.

View all 6 references / Add more references