Universal recursion theoretic properties of r.e. preordered structures
From MaRDI portal
Publication:3699683
DOI10.2307/2274228zbMATH Open0578.03026OpenAlexW2128742310MaRDI QIDQ3699683FDOQ3699683
Authors: Franco Montagna, Andrea Sorbi
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
Recommendations
Theory of numerations, effectively presented structures (03D45) First-order arithmetic and fragments (03F30)
Cites Work
Cited In (14)
- Effective inseparability and its applications
- Complexity of equivalence relations and preorders from computability theory
- Uniform density in Lindenbaum algebras
- Special classes of positive preorders
- Precomplete numberings
- Effectively dense Boolean algebras and their applications
- EFFECTIVE INSEPARABILITY, LATTICES, AND PREORDERING RELATIONS
- Some properties of precompletely and positively numbered sets
- GENERALIZATIONS OF THE RECURSION THEOREM
- Word problems and ceers
- Effectively inseparable Boolean algebras in lattices of sentences
- Obituary: Franco Montagna (1948--2015)
- Isomorphisms of splits of computably enumerable sets
- Classifying equivalence relations in the Ershov hierarchy
This page was built for publication: Universal recursion theoretic properties of r.e. preordered structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3699683)