Steel forcing and barwise compactness

Annals of Mathematical Logic 22 (1):31-46 (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,202

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.
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.
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.
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 strong compactness and level by level inequivalence.Arthur W. Apter - 2013 - Mathematical Logic Quarterly 59 (4-5):371-377.
A formalism for some class of forcing notions.Piotr Koszmider & P. Koszmider - 1992 - Mathematical Logic Quarterly 38 (1):413-421.
Projective absoluteness for Sacks forcing.Daisuke Ikegami - 2009 - Archive for Mathematical Logic 48 (7):679-690.
Distributive proper forcing axiom and cardinal invariants.Huiling Zhu - 2013 - Archive for Mathematical Logic 52 (5-6):497-506.

Analytics

Added to PP
2014-01-17

Downloads
21 (#695,936)

6 months
7 (#350,235)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

Some recent developments in higher recursion theory.Sy D. Friedman - 1983 - Journal of Symbolic Logic 48 (3):629-642.
Projective subsets of separable metric spaces.Arnold W. Miller - 1990 - Annals of Pure and Applied Logic 50 (1):53-69.
Model theory for LāˆžĻ‰1.Sy D. Friedman - 1984 - Annals of Pure and Applied Logic 26 (2):103-122.
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< i> L_< sub>āˆž Ļ‰1.Sy D. Friedman - 1984 - Annals of Pure and Applied Logic 26 (2):103-122.

View all 6 citations / Add more citations

References found in this work

Countable models of set theories.Harvey Friedman - 1973 - In A. R. D. Mathias & H. Rogers (eds.), Cambridge Summer School in Mathematical Logic. New York: Springer Verlag. pp. 539--573.
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