A General Framework for Priority Arguments

DOI10.2307/421040zbMath0841.03025OpenAlexW2062860612MaRDI QIDQ4847389

Steffen Lempp, Manuel Lerman

Publication date: 20 September 1995

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

Full work available at URL: http://www.math.ucla.edu/~asl/bsl/0102-toc.htm

zbMATH Keywords

priority methoddegrees of unsolvability

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (5)

Three topological reducibilities for discontinuous functions ⋮ PRIORITY ARGUMENTS VIA TRUE STAGES ⋮ Classification of computably approximable real numbers ⋮ Degree Structures: Local and Global Investigations ⋮ Coding a family of sets

Cites Work

• Non-bounding constructions
• Labelling systems and r.e. structures
• Stability of recursive structures in arithmetical degrees
• Borel determinacy
• Logical methods. In honor of Anil Nerode's 60th birthday
• On some games which are relevant to the theory of recursively enumerable sets
• Cambridge summer school in mathematical logic, held in Cambridge/England, August 1-21, 1971
• The upper semi-lattice of degrees of recursive unsolvability
• TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
• A metatheorem for constructions by finitely many workers
• The jump is definable in the structure of the degrees of unsolvability
• On homogeneity and definability in the first-order theory of the Turing degrees
• Banach–Mazur games, comeager sets and degrees of unsolvability
• TOPOLOGICAL FRAMEWORK FOR FINITE INJURY
• Topological Framework for Non‐Priority
• Degrees of Unsolvability. (AM-55)
• Recursively enumerable sets of positive integers and their decision problems

This page was built for publication: A General Framework for Priority Arguments