Strict-Π1 1 predicates on countable and cofinality ω transitive sets

Journal of Symbolic Logic 42 (2):161 - 173 (1977)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2272116

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

The baire category theorem and cardinals of countable cofinality.Arnold W. Miller - 1982 - Journal of Symbolic Logic 47 (2):275-288.
Applications of strict π11 predicates to infinitary logic.Jon Barwise - 1969 - Journal of Symbolic Logic 34 (3):409 - 423.
On hereditarily countable sets.Thomas Jech - 1982 - Journal of Symbolic Logic 47 (1):43-47.
On the cofinality of the smallest covering of the real line by Meager sets.Tomek Bartoszynski & Jaime I. Ihoda - 1989 - Journal of Symbolic Logic 54 (3):828-832.
On consistent subsets of large sets of satisfiable sentences.Stephen H. Hechler - 2001 - Studia Logica 69 (3):339-349.
The axiom of choice for countable collections of countable sets does not imply the countable union theorem.Paul E. Howard - 1992 - Notre Dame Journal of Formal Logic 33 (2):236-243.
The meta-r.E. Sets, but not the π11 sets, can be enumerated without repetition.James C. Owings - 1970 - Journal of Symbolic Logic 35 (2):223 - 229.

Analytics

Added to PP
2009-01-28

Downloads
34 (#456,993)

6 months
8 (#352,434)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Countably decomposable admissible sets.Menachem Magidor, Saharon Shelah & Jonathan Stavi - 1984 - Annals of Pure and Applied Logic 26 (3):287-361.

Add more citations

References found in this work

Elementary Induction on Abstract Structures.Wayne Richter - 1979 - Journal of Symbolic Logic 44 (1):124-125.

Add more references