A General Framework for Priority Arguments
From MaRDI portal
Recommendations
Cites work
- A metatheorem for constructions by finitely many workers
- Banach–Mazur games, comeager sets and degrees of unsolvability
- Borel determinacy
- Cambridge summer school in mathematical logic, held in Cambridge/England, August 1-21, 1971
- Degrees of Unsolvability. (AM-55)
- Labelling systems and r.e. structures
- Logical methods. In honor of Anil Nerode's 60th birthday
- Non-bounding constructions
- On homogeneity and definability in the first-order theory of the Turing degrees
- On some games which are relevant to the theory of recursively enumerable sets
- Recursively enumerable sets of positive integers and their decision problems
- Stability of recursive structures in arithmetical degrees
- TOPOLOGICAL FRAMEWORK FOR FINITE INJURY
- TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
- The jump is definable in the structure of the degrees of unsolvability
- The upper semi-lattice of degrees of recursive unsolvability
- Topological Framework for Non‐Priority
Cited in
(11)- Priority Arguments and Epsilon Substitutions
- A framework for priority arguments
- scientific article; zbMATH DE number 2097605 (Why is no real title available?)
- Classification of computably approximable real numbers
- Coding a family of sets
- scientific article; zbMATH DE number 3914304 (Why is no real title available?)
- Non-bounding constructions
- Three topological reducibilities for discontinuous functions
- Degree Structures: Local and Global Investigations
- The expressive power of CHR with priorities
- PRIORITY ARGUMENTS VIA TRUE STAGES
This page was built for publication: A General Framework for Priority Arguments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4847389)