HC of an admissible set

Journal of Symbolic Logic 44 (1):95-102 (1979)
  Copy   BIBTEX

Abstract

If A is an admissible set, let HC(A) = {x∣ x ∈ A and x is hereditarily countable in A}. Then HC(A) is admissible. Corollaries are drawn characterizing the "real parts" of admissible sets and the analytical consequences of admissible set theory

Categories

Keywords

Reprint years

DOI

10.2307/2273707

Links

PhilArchive



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

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

Σ1-separation.Fred G. Abramson - 1979 - Journal of Symbolic Logic 44 (3):374 - 382.
The pure part of HYP(M).Mark Nadel & Jonathan Stavi - 1977 - Journal of Symbolic Logic 42 (1):33-46.
Anti-admissible sets.Jacob Lurie - 1999 - Journal of Symbolic Logic 64 (2):407-435.
On self-admissible quasi-characterizing inference rules.V. V. Rybakov, M. Terziler & C. Gencer - 2000 - Studia Logica 65 (3):417-428.
Operational set theory and small large cardinals.Solomon Feferman with with R. L. Vaught - manuscript
An ordinal analysis of admissible set theory using recursion on ordinal notations.Jeremy Avigad - 2002 - Journal of Mathematical Logic 2 (1):91-112.
Upper Bounds for metapredicative mahlo in explicit mathematics and admissible set theory.Gerhard Jäger & Thomas Strahm - 2001 - Journal of Symbolic Logic 66 (2):935-958.

Analytics

Added to PP
2009-01-28

Downloads
31 (#515,963)

6 months
12 (#213,833)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

Steel forcing and barwise compactness.Sy D. Friedman - 1982 - Annals of Mathematical Logic 22 (1):31-46.
Steel forcing and Barwise compactness.S. D. Friedman - 1982 - Annals of Mathematical Logic 22 (1):31.

Add more citations

References found in this work

No references found.

Add more references