A metatheorem for constructions by finitely many workers

DOI10.2307/2274665MaRDI QIDQ3489981zbMATH OpenOpenAlexFDO

Authors J. F. Knight

Publication date 1990

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

Full work available at URL https://doi.org/10.2307/2274665

zbMATH Keywords

coding subsets of \(\omega\) by pairs of recursive structurescomplete metric spaceHarrington's workersmodel representations of countable Scott setspath through a labelled treerecursive labelling systemsrecursive metric spaces

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Recommendations

• Constructions by transfinitely many workers
• Labelling systems and r.e. structures
• Requirement systems
• scientific article; zbMATH DE number 4012589
• scientific article; zbMATH DE number 2209800

Cited in

(8)

• Computable isomorphisms, degree spectra of relations, and Scott families
• Jumps of Orderings
• Every Low Boolean Algebra is Isomorphic to a Recursive One
• A General Framework for Priority Arguments
• Iterated priority arguments in descriptive set theory
• Incomparable prime ideals of recursively enumerable degrees
• Pairs of recursive structures
• Constructions by transfinitely many workers

This page was built for publication: A metatheorem for constructions by finitely many workers

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