The Complexity of intrinsically r.e. subsets of existentially decidable models

DOI10.2307/2274483MaRDI QIDQ5753943zbMATH OpenOpenAlexFDO

Authors John Chisholm

Publication date 1990

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

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

zbMATH Keywords

recursive modelintrinsically recursive relationdefinability of intrinsically r.e. relationsexistentially recursive

Mathematics Subject Classification ID

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

Recommendations

• A Completeness Theorem for Certain Classes of Recursive Infinitary Formulas
• Relations Intrinsically Recursive in Linear Orders
• Intrinsically Hyperarithmetical Sets
• The possible Turing degree of the nonzero member in a two element degree spectrum
• Recursive Structures and Ershov's Hierarchy
• Intrinsically \(\Sigma ^ 0_{\alpha}\) relations
• An application of a reflection principle
• Recursive expansions
• scientific article; zbMATH DE number 2047487
• Degrees of models

Cites work

• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• The quantity of nonautoequivalent constructivizations

Cited in

(7)

• Does Bohm's quantum force have a classical origin?
• 2003-04 Winter Meeting of the Association for Symbolic Logic
• Computability of Fraïssé limits
• Definability of models by means of existential formulas without identity
• Exact effective enumerations of total functional structures
• Intrinsically \(\Sigma ^ 0_{\alpha}\) relations
• The intrinsic enumerability of linear orders

This page was built for publication: The Complexity of intrinsically r.e. subsets of existentially decidable models

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