Constructive enumeration of Boolean lattices

DOI10.1007/BF01980735zbMATH Open0716.03030OpenAlexW2071549821MaRDI QIDQ752699FDOQ752699

Authors: V. D. Dzgoev 

Publication date: 1988

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01980735

zbMATH Keywords

Boolean algebraBoolean latticerecursive modelconstructivization

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Boolean algebras (Boolean rings) (06Exx)

Cites Work

• Recursive isomorphism types of recursive Boolean algebras
• Recursive Boolean algebras with recursive atoms
• Examples of nonautostable systems

Cited In (4)

• On the effective universality of mereological theories
• Enumerating lattices of subsets
• The number of linear extensions of the Boolean lattice
• The complete \(\mathbf{cd}\)-index of Boolean lattices

This page was built for publication: Constructive enumeration of Boolean lattices

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