A sufficient condition for finite decidability
From MaRDI portal
Publication:1272241
DOI10.1007/BF01233917zbMath0901.03012MaRDI QIDQ1272241
Publication date: 24 November 1998
Published in: Algebra Universalis (Search for Journal in Brave)
Decidability of theories and sets of sentences (03B25) Model theory of finite structures (03C13) Subdirect products and subdirect irreducibility (08B26)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Reduced sub-powers and the decision problem for finite algebras in arithmetical varieties
- Varieties with decidable finite algebras. I: Linearity
- Varieties with decidable finite algebras. II: Permutability
- Finitely Decidable Congruence Modular Varieties
- Decidability problem for finite Heyting algebras
- The structure of finite algebras
- Sheaf Constructions and Their Elementary Properties
- Decidability of Second-Order Theories and Automata on Infinite Trees
This page was built for publication: A sufficient condition for finite decidability