PRIORITY ARGUMENTS VIA TRUE STAGES

DOI10.1017/jsl.2014.11zbMath1353.03050arXiv1306.2623OpenAlexW2964068869MaRDI QIDQ5177887

Antonio Montalbán

Publication date: 6 March 2015

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

Full work available at URL: https://arxiv.org/abs/1306.2623

zbMATH Keywords

priority argumenttrue stages

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items (7)

Three topological reducibilities for discontinuous functions ⋮ Completeness of the hyperarithmetic isomorphism equivalence relation ⋮ On a question of Kalimullin ⋮ Turing reducibility in the fine hierarchy ⋮ Strength and Weakness in Computable Structure Theory ⋮ On the structure of the Wadge degrees of bqo-valued Borel functions ⋮ DEGREES OF CATEGORICITY ON A CONE VIAη-SYSTEMS

Cites Work

• Unnamed Item
• Pairs of recursive structures
• Labelling systems and r.e. structures
• Constructions by transfinitely many workers
• Stability of recursive structures in arithmetical degrees
• Ramified systems
• The Veblen functions for computability theorists
• Equivalence Relations on Classes of Computable Structures
• A General Framework for Priority Arguments

This page was built for publication: PRIORITY ARGUMENTS VIA TRUE STAGES