EFFECTIVE INSEPARABILITY, LATTICES, AND PREORDERING RELATIONS
From MaRDI portal
Publication:5027663
DOI10.1017/S1755020319000273MaRDI QIDQ5027663
Publication date: 7 February 2022
Published in: The Review of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1901.06136
uniform densityeffective inseparabilitycomputable reducibility on preordersuniform finite precompleteness
Other degrees and reducibilities in computability and recursion theory (03D30) Theory of numerations, effectively presented structures (03D45)
Related Items
Word problems and ceers, On the main scientific achievements of Victor Selivanov, A note on uniform density in weak arithmetical theories
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reducibilities among equivalence relations induced by recursively enumerable structures
- Relatively precomplete numerations and arithmetic
- Logical number theory I. An introduction
- Classical recursion theory. Vol. II
- Shavrukov's theorem on the subalgebras of diagonalizable algebras for theories containing \(I\Delta_ 0 + \exp\)
- Uniform density in Lindenbaum algebras
- Graphs realised by r.e. equivalence relations
- Effectively inseparable Boolean algebras in lattices of sentences
- UNIVERSAL COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS
- COMPLEXITY OF EQUIVALENCE RELATIONS AND PREORDERS FROM COMPUTABILITY THEORY
- A Survey on Universal Computably Enumerable Equivalence Relations
- A Note on Positive Equivalence Relations
- LINEAR ORDERS REALIZED BY C.E. EQUIVALENCE RELATIONS
- Equivalence relations induced by extensional formulae: classification by means of a new fixed point property
- Universal recursion theoretic properties of r.e. preordered structures
- Periodicity in generations of automata
- Effectively dense Boolean algebras and their applications
- On the completenes principle: A study of provability in heyting's arithmetic and extensions
- Remarks on Uniformly Finitely Precomplete Positive Equivalences
- Distributive Sublattices of a Free Lattice
- Isomorphism relations on computable structures
- Deduction-preserving "Recursive Isomorphisms" between theories
