Universal recursion theoretic properties of r.e. preordered structures

DOI10.2307/2274228zbMath0578.03026MaRDI 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

prelattice; Boolean prealgebra; recursively enumerable preordering

Mathematics Subject Classification ID

03F30: First-order arithmetic and fragments

03D45: Theory of numerations, effectively presented structures

Related Items

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

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