PRIORITY ARGUMENTS VIA TRUE STAGES

DOI10.1017/JSL.2014.11zbMATH Open1353.03050arXiv1306.2623OpenAlexW2964068869MaRDI QIDQ5177887FDOQ5177887

Authors: Antonio Montalbán 

Publication date: 6 March 2015

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

Abstract: We describe a variation of Ash's $eta$-system, and give a new proof of Ash's metatheorem. As an application, we prove a generalization of Ash and Knight's theorem on pairs of structures.

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

Recommendations

• A framework for priority arguments
• A General Framework for Priority Arguments
• Priority Arguments and Epsilon Substitutions
• Publication:3480023
• Priority arguments in the continuous r.e. degrees
• On the expressibility of priority
• Prioritized defaults and formal argumentation
• Iterated trees of strategies and priority arguments
• An axiomatic analysis of structured argumentation with priorities

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)

Cites Work

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

Cited In (11)

• Mixed systems
• Priority Arguments and Epsilon Substitutions
• Strength and weakness in computable structure theory
• Degrees of categoricity on a cone via \(\eta\)-systems
• Requirement systems
• On a question of Kalimullin
• Three topological reducibilities for discontinuous functions
• Iterated priority arguments in descriptive set theory
• On the structure of the Wadge degrees of bqo-valued Borel functions
• Completeness of the hyperarithmetic isomorphism equivalence relation
• Turing reducibility in the fine hierarchy

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

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