Effective inseparability and its applications

DOI10.1007/978-3-030-80049-9_41OpenAlexW3184018578MaRDI QIDQ2117804

Andrea Sorbi

Publication date: 22 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-80049-9_41

zbMATH Keywords

computably enumerable structureseffective inseparabilitylattices of sentences

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items

Well-orders realized by C.E. equivalence relations

Cites Work

• Unnamed Item
• Unnamed Item
• Relatively precomplete numerations and arithmetic
• A note on uniform density in weak arithmetical theories
• Uniform density in Lindenbaum algebras
• Undecidable theories
• UNIVERSAL COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS
• Theory of Formal Systems. (AM-47)
• Creative Functions
• Universal recursion theoretic properties of r.e. preordered structures
• Remarks on Uniformly Finitely Precomplete Positive Equivalences
• Word problems and ceers