Steel forcing and Barwise compactness

Annals of Mathematical Logic 22 (1):31 (1982)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0003-4843(82)90014-6

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,322

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

Steel forcing and barwise compactness.Sy D. Friedman - 1982 - Annals of Mathematical Logic 22 (1):31-46.
A proofless proof of the Barwise compactness theorem.Mark Howard - 1988 - Journal of Symbolic Logic 53 (2):597-602.
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.
Supercompactness and level by level equivalence are compatible with indestructibility for strong compactness.Arthur W. Apter - 2007 - Archive for Mathematical Logic 46 (3-4):155-163.
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.
Small forcing makes any cardinal superdestructible.Joel David Hamkins - 1998 - Journal of Symbolic Logic 63 (1):51-58.
An algebraic treatment of the Barwise compactness theory.Isidore Fleischer & Philip Scott - 1991 - Studia Logica 50 (2):217 - 223.
Small Forcing Makes any Cardinal Superdestructible.Joel Hamkins - 1998 - Journal of Symbolic Logic 63 (1):51-58.
Universal partial indestructibility and strong compactness.Arthur W. Apter - 2005 - Mathematical Logic Quarterly 51 (5):524-531.
Indestructibility, instances of strong compactness, and level by level inequivalence.Arthur W. Apter - 2010 - Archive for Mathematical Logic 49 (7-8):725-741.
Implicit Definability and Compactness in Infinitary Languages.Jon Barwise - 1968 - Lecture Notes in Mathematics 72 (1):1--35.
Indestructible Weakly Compact Cardinals and the Necessity of Supercompactness for Certain Proof Schemata.J. D. Hamkins & A. W. Apter - 2001 - Mathematical Logic Quarterly 47 (4):563-572.
Completing theories by forcing.J. Barwise - 1970 - Annals of Mathematical Logic 2 (2):119.
On Transferring Model Theoretic Theorems of $${\mathcal{L}_{{\infty},\omega}}$$ L ∞, ω in the Category of Sets to a Fixed Grothendieck Topos.Nathanael Leedom Ackerman - 2014 - Logica Universalis 8 (3-4):345-391.

Analytics

Added to PP
2017-02-19

Downloads
3 (#1,682,188)

6 months
3 (#1,023,809)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Applications of Fodor's lemma to Vaught's conjecture.Mark Howard - 1989 - Annals of Pure and Applied Logic 42 (1):1-19.
Model theory for L∞ω1.Sy D. Friedman - 1984 - Annals of Pure and Applied Logic 26 (2):103-122.
Projective subsets of separable metric spaces.Arnold W. Miller - 1990 - Annals of Pure and Applied Logic 50 (1):53-69.
Model theory for< i> L_< sub>∞ ω1.Sy D. Friedman - 1984 - Annals of Pure and Applied Logic 26 (2):103-122.
Model theory for "L"[infinity]omega 1.S. D. Friedman - 1984 - Annals of Pure and Applied Logic 26 (2):103.

Add more citations

References found in this work

Forcing with tagged trees.John R. Steel - 1978 - Annals of Mathematical Logic 15 (1):55.
The pure part of HYP(M).Mark Nadel & Jonathan Stavi - 1977 - Journal of Symbolic Logic 42 (1):33-46.
HC of an admissible set.Sy D. Friedman - 1979 - Journal of Symbolic Logic 44 (1):95-102.

Add more references