Lattice representations for computability theory

DOI10.1016/S0168-0072(97)00067-5zbMath0926.03046MaRDI QIDQ1295402

Peter A. Fejer

Publication date: 2 September 1999

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

zbMATH Keywords

lattice representationsdegree-theoretic structuresembedding result

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)

Cites Work

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

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