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

DOI10.2307/2274483zbMath0722.03031OpenAlexW2130922919MaRDI QIDQ5753943

J. S. Roy 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)

Related Items (4)

Unnamed Item ⋮ Does Bohm's quantum force have a classical origin? ⋮ 2003-04 Winter Meeting of the Association for Symbolic Logic ⋮ Computability of Fraïssé limits

Cites Work

• Unnamed Item
• The quantity of nonautoequivalent constructivizations

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