Constructions by transfinitely many workers

DOI10.1016/0168-0072(90)90022-TMaRDI QIDQ923078zbMATH OpenFDO

Authors J. F. Knight

Publication date 1990

Published in Annals of Pure and Applied Logic (Search for Journal in Brave)

zbMATH Keywords

inductive argumentsconstructions in recursion theorymethod of workerspriority argumentsystems for transfinitely many workers

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Theory of numerations, effectively presented structures (03D45) Other degrees and reducibilities in computability and recursion theory (03D30)

Recommendations

• Labelling systems and r.e. structures
• Priority constructions
• Requirement systems
• Mixed systems
• Iterated trees of strategies and priority arguments

Cites work

• A metatheorem for constructions by finitely many workers
• Jumps of Orderings
• Pairs of recursive structures
• Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees

Cited in

(10)

• Mixed systems
• Labelling systems and r.e. structures
• Requirement systems
• Computable isomorphisms, degree spectra of relations, and Scott families
• Pairs of recursive structures
• A metatheorem for constructions by finitely many workers
• Iterated priority arguments in descriptive set theory
• Incomparable prime ideals of recursively enumerable degrees
• scientific article; zbMATH DE number 4150132 (Why is no real title available?)
• PRIORITY ARGUMENTS VIA TRUE STAGES

This page was built for publication: Constructions by transfinitely many workers

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