On the consistency problem for modular lattices and related structures
DOI10.1142/S0218196716500697zbMath1373.06006arXiv1607.03315MaRDI QIDQ2955411
Martin Ziegler, Christian Herrmann, Yasuyuki Tsukamoto
Publication date: 25 January 2017
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1607.03315
decidabilityrelation algebrasatisfiabilityGrassmann-Cayley algebraendomorphism ringsubspace latticeconsistency problemdatabase dependenciestriviality problem
Decidability of theories and sets of sentences (03B25) Computational aspects of associative rings (general theory) (16Z05) Modular lattices, Desarguesian lattices (06C05) Cylindric and polyadic algebras; relation algebras (03G15) Exterior algebra, Grassmann algebras (15A75) Word problems (aspects of algebraic structures) (08A50)
Related Items (3)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Presentations of finite simple groups: a computational approach.
- On coordinates in modular lattices with a homogeneous basis
- Congruences of lattices and ideals of rings
- Representation of Modular Lattices and Of Relation Algebras
- On the Arithmetic of Projective Coordinate Systems
- Finitely Presented Lattices
- ALGORITHMIC PROBLEMS IN VARIETIES
- A Finite Axiomatization of Conditional Independence and Inclusion Dependencies
- On the representation of lattices
- The decision problem for some classes of sentences without quantifiers
- Algorithms in invariant theory
This page was built for publication: On the consistency problem for modular lattices and related structures