Lattice representations for computability theory

DOI10.1016/S0168-0072(97)00067-5MaRDI QIDQ1295402zbMATH OpenFDO

Authors Peter A. Fejer

Publication date 2 September 1999

Published in Annals of Pure and Applied Logic (Search for Journal in Brave)

zbMATH Keywords

degree-theoretic structuresembedding resultlattice representations

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Representation theory of lattices (06B15) Other degrees and reducibilities in computability and recursion theory (03D30)

Recommendations

• On computable presentations of some functional lattices
• Embedding finite lattices into the computably enumerable degrees -- a status survey
• Embedding finite lattices into the Σ₂⁰ enumeration degrees
• Embedding finite lattices into the ideals of computably enumerable turing degrees

Cites work

• scientific article; zbMATH DE number 3954890 (Why is no real title available?)
• scientific article; zbMATH DE number 3019695 (Why is no real title available?)
• scientific article; zbMATH DE number 3090626 (Why is no real title available?)
• A Proof of Whitman's Representation Theorem for Finite Lattices
• A perspective on algebraic representations of lattices
• Embedding Lattices with Top Preserved Below Non‐GL₂ Degrees
• Every finite lattice can be embedded in a finite partition lattice
• Finitely Generated Codings and the Degrees R.E. in a Degree d
• Initial segments of the degrees of unsolvability
• Lattice Embeddings in the Recursively Enumerable Truth Table Degrees
• Lattices, equivalence relations, and subgroups
• On the representation of lattices
• Representation of Modular Lattices and Of Relation Algebras
• Some nondistributive lattices as initial segments of the degrees of unsolvability
• Sublattices and Initial Segments of the Degrees of Unsolvability
• The p-T-degrees of the recursive sets: Lattice embeddings, extensions of embeddings and the two-quantifier theory

Cited in

(7)

• An application of lattice theory to knowledge representation
• On computable presentations of some functional lattices
• \(L^1\)-computability, layerwise computability and Solovay reducibility
• The Lattice of Computably Enumerable Vector Spaces
• Introduction to lattice theory with computer science applications
• A lattice of the paracomplete calculi
• Turing L-machines and recursive computability for L-maps

This page was built for publication: Lattice representations for computability theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1295402)