A Completeness Theorem for Certain Classes of Recursive Infinitary Formulas

DOI10.1002/MALQ.19940400204MaRDI QIDQ4304103zbMATH OpenOpenAlexFDO

Authors C. J. Ash, J. F. Knight

Publication date 20 April 1995

Published in Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.19940400204

zbMATH Keywords

forcinginfinitary formulaerecursive structurerelatively recursive relations

Mathematics Subject Classification ID

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

Recommendations

• Relatively recursive expansions
• Intrinsically \(\Sigma ^ 0_{\alpha}\) relations
• scientific article; zbMATH DE number 695580
• Recursive Structures and Ershov's Hierarchy

Cites work

• Ramified systems

Cited in

(6)

• Realizing levels of the hyperarithmetic hierarchy as degree spectra of relations on computable structures
• scientific article; zbMATH DE number 6476595 (Why is no real title available?)
• scientific article; zbMATH DE number 4134026 (Why is no real title available?)
• An extension of the nondiamond theorem in classical and α-recursion theory
• Relatively recursive expansions
• The Complexity of intrinsically r.e. subsets of existentially decidable models

This page was built for publication: A Completeness Theorem for Certain Classes of Recursive Infinitary Formulas

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