A metatheorem for constructions by finitely many workers

DOI10.2307/2274665zbMath0708.03012OpenAlexW1995739498MaRDI QIDQ3489981

Julia 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

complete metric spacerecursive labelling systemscoding subsets of \(\omega\) by pairs of recursive structuresHarrington's workersmodel representations of countable Scott setspath through a labelled treerecursive metric spaces

Mathematics Subject Classification ID

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

Related Items (7)

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

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