A recursion theoretic characterization of the Topological Vaught Conjecture in the Zermelo‐Fraenkel set theory

Mathematical Logic Quarterly 63 (6):544-551 (2017)
  Copy   BIBTEX

Abstract

We prove a recursion theoretic characterization of the Topological Vaught Conjecture in the Zermelo‐Fraenkel set theory by using tools from effective descriptive set theory and by revisiting the result of Miller that orbits in Polish G‐spaces are Borel sets.

Categories

Add categories

Keywords

Reprint years

DOI

10.1002/malq.201600094

Links

PhilArchive



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

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 Vaught Conjecture: Do Uncountable Models Count?John T. Baldwin - 2007 - Notre Dame Journal of Formal Logic 48 (1):79-92.
Replacement versus collection and related topics in constructive Zermelo–Fraenkel set theory.Michael Rathjen - 2005 - Annals of Pure and Applied Logic 136 (1-2):156-174.
Categories of Topological Spaces and Scattered Theories.R. W. Knight - 2007 - Notre Dame Journal of Formal Logic 48 (1):53-77.
A recursion-theoretic approach to NP.Isabel Oitavem - 2011 - Annals of Pure and Applied Logic 162 (8):661-666.
Vaught’s Conjecture Without Equality.Nathanael Leedom Ackerman - 2015 - Notre Dame Journal of Formal Logic 56 (4):573-582.
Nonconstructive Properties of Well-Ordered T 2 topological Spaces.Kyriakos Keremedis & Eleftherios Tachtsis - 1999 - Notre Dame Journal of Formal Logic 40 (4):548-553.
Set theory: Constructive and intuitionistic ZF.Laura Crosilla - 2010 - Stanford Encyclopedia of Philosophy.
A Note on Counterexamples to the Vaught Conjecture.Greg Hjorth - 2007 - Notre Dame Journal of Formal Logic 48 (1):49-51.
An Interpretation of the Zermelo‐Fraenkel Set Theory and the Kelley‐Morse Set Theory in a Positive Theory.Olivier Esser - 1997 - Mathematical Logic Quarterly 43 (3):369-377.
Constructive Zermelo–Fraenkel set theory and the limited principle of omniscience.Michael Rathjen - 2014 - Annals of Pure and Applied Logic 165 (2):563-572.
Relative Vaught's Conjecture for Some Meager Groups.Ludomir Newelski - 2007 - Notre Dame Journal of Formal Logic 48 (1):115-132.
The topological Vaught's conjecture and minimal counterexamples.Howard Becker - 1994 - Journal of Symbolic Logic 59 (3):757-784.
The disjunction and related properties for constructive Zermelo-Fraenkel set theory.Michael Rathjen - 2005 - Journal of Symbolic Logic 70 (4):1233-1254.
Recursive constructions in topological spaces.Iraj Kalantari & Allen Retzlaff - 1979 - Journal of Symbolic Logic 44 (4):609-625.
Frege Meets Zermelo: A Perspective on Ineffability and Reflection.Stewart Shapiro - 2008 - Review of Symbolic Logic 1 (2):241-266.

Analytics

Added to PP
2017-12-28

Downloads
13 (#1,027,298)

6 months
3 (#974,323)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Recursive well-orderings.Clifford Spector - 1955 - Journal of Symbolic Logic 20 (2):151-163.
Descriptive Set Theory.Yiannis Nicholas Moschovakis - 1982 - Studia Logica 41 (4):429-430.
Some applications of forcing to hierarchy problems in arithmetic.Peter G. Hinman - 1969 - Mathematical Logic Quarterly 15 (20‐22):341-352.
Some applications of forcing to hierarchy problems in arithmetic.Peter G. Hinman - 1969 - Mathematical Logic Quarterly 15 (20-22):341-352.

View all 6 references / Add more references