Ramified systems

DOI10.1016/S0168-0072(94)90009-4zbMath0819.03024OpenAlexW4210937709MaRDI QIDQ1344627

C. J. Ash, Julia F. Knight

Publication date: 27 August 1995

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

Full work available at URL: https://doi.org/10.1016/s0168-0072(94)90009-4

zbMATH Keywords

ramified \(\alpha\)-systems

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57)

Related Items (8)

Possible degrees in recursive copies ⋮ Quasi-simple relations in copies of a given recursive structure ⋮ Possible degrees in recursive copies. II ⋮ A Completeness Theorem for Certain Classes of Recursive Infinitary Formulas ⋮ Realizing levels of the hyperarithmetic hierarchy as degree spectra of relations on computable structures ⋮ PRIORITY ARGUMENTS VIA TRUE STAGES ⋮ Computable trees of Scott rank ω₁^CK, and computable approximation ⋮ Coding a family of sets

Cites Work

• Labelling systems and r.e. structures
• Intrinsically \(\Sigma ^ 0_{\alpha}\) relations
• Generic copies of countable structures
• Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
• Relatively recursive expansions
• Mixed systems

This page was built for publication: Ramified systems