Constructions by transfinitely many workers

DOI10.1016/0168-0072(90)90022-TzbMATH Open0712.03035MaRDI QIDQ923078FDOQ923078

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)

Cites Work

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

Cited In (5)

• Computable isomorphisms, degree spectra of relations, and Scott families
• Pairs of recursive structures
• Iterated priority arguments in descriptive set theory
• Incomparable prime ideals of recursively enumerable degrees
• 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)