A sufficient condition for finite decidability
From MaRDI portal
Recommendations
Cites work
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Decidability problem for finite Heyting algebras
- Finitely Decidable Congruence Modular Varieties
- scientific article; zbMATH DE number 4035895 (Why is no real title available?)
- scientific article; zbMATH DE number 3554283 (Why is no real title available?)
- Reduced sub-powers and the decision problem for finite algebras in arithmetical varieties
- Sheaf Constructions and Their Elementary Properties
- The structure of finite algebras
- Varieties with decidable finite algebras. I: Linearity
- Varieties with decidable finite algebras. II: Permutability
Cited in
(16)- Finitely determined arithmetical varieties need not be universally- finite
- Decidable unary varieties
- Varieties with decidable finite algebras. II: Permutability
- Decidability of elementary theories of certain finitely defined algebras
- Type 2 subdirectly irreducible algebras in finitely decidable varieties
- Criterion for propositional calculi to be finitely generated
- Finitely Decidable Congruence Modular Varieties
- scientific article; zbMATH DE number 14392 (Why is no real title available?)
- scientific article; zbMATH DE number 125210 (Why is no real title available?)
- scientific article; zbMATH DE number 1197054 (Why is no real title available?)
- A decidable variety that is finitely undecidable
- scientific article; zbMATH DE number 1064596 (Why is no real title available?)
- Profiniteness in finitely generated varieties is undecidable
- Bounding essential arities of term operations in finitely decidable varieties
- A geometric generalization of Kaplansky’s direct finiteness conjecture
- Finitary PCF is not decidable
This page was built for publication: A sufficient condition for finite decidability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1272241)