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.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,225

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Extensionality in Zermelo‐Fraenkel Set Theory.R. Hinnion - 1986 - Mathematical Logic Quarterly 32 (1-5):51-60.
A class of higher inductive types in Zermelo‐Fraenkel set theory.Andrew W. Swan - 2022 - Mathematical Logic Quarterly 68 (1):118-127.
The ∀ n∃‐Completeness of Zermelo‐Fraenkel Set Theory.Daniel Gogol - 1978 - Mathematical Logic Quarterly 24 (19-24):289-290.
On a Family of Models of Zermelo-Fraenkel Set Theory.Bruno Scarpellini - 1966 - Mathematical Logic Quarterly 12 (1):191-204.
Separablilty of metric measure spaces and choice axioms.Paul Howard - 2024 - Archive for Mathematical Logic 63 (7):987-1003.

Analytics

Added to PP
2017-12-28

Downloads
25 (#879,283)

6 months
7 (#704,497)

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.

Add more references