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

DOI10.1002/malq.201600094zbMath1469.03133OpenAlexW2780947016WikidataQ122967649 ScholiaQ122967649MaRDI QIDQ5108130

Vassilios Gregoriades

Publication date: 29 April 2020

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.201600094

Mathematics Subject Classification ID

Descriptive set theory (03E15) Descriptive set theory (topological aspects of Borel, analytic, projective, etc. sets) (54H05) Applications of computability and recursion theory (03D80) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items (1)

A recursion theoretic property of $\mathbf {\Sigma ^1_1}$ equivalence relations

Cites Work

• A computability theoretic equivalent to Vaught's conjecture
• Arithmetical Predicates and Function Quantifiers
• Recursive well-orderings
• Counting the number of equivalence classes of Borel and coanalytic equivalence relations
• Dual Et Quasi-Dual D'Une Algebre de Banach Involutive
• On the Measurability of Orbits in Borel Actions
• The topological Vaught's conjecture and minimal counterexamples
• ANALYTIC EQUIVALENCE RELATIONS SATISFYING HYPERARITHMETIC-IS-RECURSIVE
• The Forcing Method and the Upper Semilattice of Hyperdegrees
• Some applications of forcing to hierarchy problems in arithmetic
• A Separation Theorem for ∑ 1 1 Sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A recursion theoretic characterization of the Topological Vaught Conjecture in the Zermelo‐Fraenkel set theory