Effectively dense Boolean algebras and their applications
From MaRDI portal
Publication:4505908
DOI10.1090/S0002-9947-00-02652-0zbMath0958.03023OpenAlexW1916240204MaRDI QIDQ4505908
Publication date: 3 October 2000
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0002-9947-00-02652-0
Complexity of computation (including implicit computational complexity) (03D15) Recursively (computably) enumerable sets and degrees (03D25) Interpolation, preservation, definability (03C40) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)
Related Items
On the Lattices of Effectively Open Sets, Effectively inseparable Boolean algebras in lattices of sentences, Coding in the partial order of enumerable sets, Initial segments of the lattice of Π10 classes, Isomorphisms of splits of computably enumerable sets, Calibrating Randomness, EFFECTIVE INSEPARABILITY, LATTICES, AND PREORDERING RELATIONS
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the theory of the PTIME degrees of the recursive sets
- The intervals of the lattice of recursively enumerable sets determined by major subsets
- Inhomogeneities in the polynomial-time degrees: The degrees of super sparse sets
- Coding in the partial order of enumerable sets
- Model theory
- Undecidability results for low complexity time classes
- The last question on recursively enumerable \(m\)-degrees
- Universal recursion theoretic properties of r.e. preordered structures
- On the Structure of Polynomial Time Reducibility
- Intervals of the Lattice of Computably Enumerable Sets and Effective Boolean Algebras
- Global properties of the lattice of $\Pi ^0_1$ classes
- On the Lattice of Recursively Enumerable Sets
- Axiomatizable theories with few axiomatizable extensions
- Hierarchies of Boolean algebras
