Universal recursion theoretic properties of r.e. preordered structures

DOI10.2307/2274228zbMath0578.03026OpenAlexW2128742310MaRDI QIDQ3699683

Andrea Sorbi, Franco Montagna

Publication date: 1985

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

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

zbMATH Keywords

prelatticeBoolean prealgebrarecursively enumerable preordering

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Theory of numerations, effectively presented structures (03D45)

Related Items

Special classes of positive preorders, Effectively inseparable Boolean algebras in lattices of sentences, COMPLEXITY OF EQUIVALENCE RELATIONS AND PREORDERS FROM COMPUTABILITY THEORY, Word problems and ceers, Obituary: Franco Montagna (1948--2015), Classifying equivalence relations in the Ershov hierarchy, GENERALIZATIONS OF THE RECURSION THEOREM, Isomorphisms of splits of computably enumerable sets, Uniform density in Lindenbaum algebras, Precomplete numberings, Effectively dense Boolean algebras and their applications, EFFECTIVE INSEPARABILITY, LATTICES, AND PREORDERING RELATIONS, Effective inseparability and its applications

Cites Work

• Unnamed Item
• Unnamed Item
• On the relation provable equivalence and on partitions in effectively inseparable sets
• Theorie der Numerierungen I
• Theorie Der Numerierungen III