Ramified systems

DOI10.1016/S0168-0072(94)90009-4MaRDI QIDQ1344627zbMATH OpenOpenAlexFDO

Authors C. J. Ash, J. 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)

Review text

The first author's \(\alpha\)-systems from Trans. Am. Math. Soc. 298, 497- 514 (1986; Zbl 0631.03017) are extended to handle ``ramified \(\alpha\)- systems which entail families of sets \(\Sigma^ 0_ \beta\) uniformly in \(\beta\) with \(1\leq \beta\leq \alpha\).

Recommendations

• Ramified analysis and the minimal β-models of higher order arithmetics
• scientific article; zbMATH DE number 1006801
• SYSTEM — A UNIFIED CONCEPT
• Weak systems of Gandy, Jensen and Devlin
• scientific article; zbMATH DE number 3313431

Cites work

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

Cited in

(8)

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

This page was built for publication: Ramified systems

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