Universal recursion theoretic properties of r.e. preordered structures
From MaRDI portal
Recommendations
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
- Obituary: Franco Montagna (1948--2015)
- Effectively inseparable Boolean algebras in lattices of sentences
- Classifying equivalence relations in the Ershov hierarchy
- Isomorphisms of splits of computably enumerable sets
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)