Constructions by transfinitely many workers

DOI10.1016/0168-0072(90)90022-TzbMath0712.03035MaRDI QIDQ923078

Julia 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) Other degrees and reducibilities in computability and recursion theory (03D30) Theory of numerations, effectively presented structures (03D45)

Related Items (3)

Incomparable prime ideals of recursively enumerable degrees ⋮ PRIORITY ARGUMENTS VIA TRUE STAGES ⋮ Computable isomorphisms, degree spectra of relations, and Scott families

Cites Work

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

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