Iterated priority arguments in descriptive set theory

DOI10.1017/BSL.2024.23MaRDI QIDQ6636685zbMATH OpenFDO

Authors Adam R. Day, Noam Greenberg, Matthew Harrison-Trainor, Dan Turetsky

Publication date 12 November 2024

Published in The Bulletin of Symbolic Logic (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1017/BSL.2024.23

zbMATH Keywords

Borel hierarchypriority argumenttrue stages

Mathematics Subject Classification ID

Hierarchies of computability and definability (03D55) Applications of computability and recursion theory (03D80) Descriptive set theory (03E15)

Cites work

• \(\Pi_ 2^ 1\) Wadge degrees
• A framework for priority arguments
• A Glimm-Effros Dichotomy for Borel Equivalence Relations
• A Hierarchy of Turing Degrees
• A metatheorem for constructions by finitely many workers
• A Separation Theorem for ∑ 1 1 Sets
• A Theorem on Hypersimple Sets
• Analytic determinacy and 0^#
• Baire-class colorings: the first three levels
• Borel chromatic numbers
• Borel Classes and Closed Games: Wadge-Type and Hurewicz-Type Results
• Borel determinacy
• Borel liftings of Borel sets: some decidable and undecidable statements
• Completeness of the hyperarithmetic isomorphism equivalence relation
• Computability on the countable ordinals and the Hausdorff-Kuratowski theorem (extended abstract)
• Computable structures and the hyperarithmetical hierarchy
• Constructions by transfinitely many workers
• Descriptive set theory
• Effective properties in compact sets of Borel functions
• Grundzüge der Mengenlehre.
• Hierarchies of number-theoretic predicates
• Higher set theory and mathematical practice
• scientific article; zbMATH DE number 3117565 (Why is no real title available?)
• scientific article; zbMATH DE number 4061224 (Why is no real title available?)
• scientific article; zbMATH DE number 194101 (Why is no real title available?)
• scientific article; zbMATH DE number 1226875 (Why is no real title available?)
• scientific article; zbMATH DE number 722611 (Why is no real title available?)
• scientific article; zbMATH DE number 3011345 (Why is no real title available?)
• scientific article; zbMATH DE number 803269 (Why is no real title available?)
• scientific article; zbMATH DE number 3342831 (Why is no real title available?)
• Hyperarithmetically Encodable Sets
• Iterated trees of strategies and priority arguments
• Labelling systems and r.e. structures
• On definable sets of positive integers
• On degrees of unsolvability
• On the Forms of the Predicates in the Theory of Constructive Ordinals (Second Paper)
• PRIORITY ARGUMENTS VIA TRUE STAGES
• Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
• Recursive Predicates and Quantifiers
• Recursive well-orderings
• Separation principles in the hierarchies of classical and effective descriptive set theory
• Sur l'uniformisation des complémentaires analytiques et les ensembles projectifs de la seconde classe.
• Sur la classification de \textit{M. Baire}.
• Sur un ensamble non mesurable B.
• Sur une définition des ensembles mesurables B sans nombres transfinis.
• Sur une propriété des ensembles G_ non dénombrables.
• The Veblen functions for computability theorists
• Three topological reducibilities for discontinuous functions
• TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
• Wadge Degrees ofω-Languages of Deterministic Turing Machines

Cited in

(1)

• The metamathematics of separated determinacy

This page was built for publication: Iterated priority arguments in descriptive set theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6636685)