Computable isomorphisms of distributive lattices

DOI10.1007/978-3-030-14812-6_3MaRDI QIDQ2327454zbMATH OpenOpenAlexFDO

Authors M. M. Yamaleev, Nikolay Bazhenov, Mustafa Manat

Publication date 15 October 2019

Full work available at URL https://doi.org/10.1007/978-3-030-14812-6_3

zbMATH Keywords

computable categoricitycomputable metric spacecomputable reducibilitydistributive latticeequivalence relationHeyting algebra

Mathematics Subject Classification ID

Recommendations

• Effective categoricity for distributive lattices and Heyting algebras
• Equivalence relations that are ^0_3 complete for computable reducibility (extended abstract)
• Isomorphism relations on computable structures
• Completeness of the hyperarithmetic isomorphism equivalence relation

Cited in

(4)

• Minimal equivalence relations in hyperarithmetical and analytical hierarchies
• Equivalence structures and isomorphisms in the difference hierarchy
• Isomorphism of Computable Structures and Vaught's Conjecture
• Computable embeddability for algebraic structures

This page was built for publication: Computable isomorphisms of distributive lattices

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