Varieties with decidable finite algebras I: Linearity (original) (raw)
Related papers
Reduced sub-powers and the decision problem for finite algebras in arithmetical varieties
Algebra Universalis, 1988
A Characterization of Finitely Decidable Congruence Modular Varieties
1993
Strong solvability and residual finiteness for finitely decidable varieties
algebra universalis, 2005
Congruence quasi-orderability in subtractive varieties
Journal of the Australian Mathematical Society, 2001
On the structure of varieties with equationally definable principal congruences III
Algebra Universalis, 1994
Axiomatizable and nonaxiomatizable congruence prevarieties
Algebra universalis, 2008
Fregean subtractive varieties with definable congruence
Journal of the Australian Mathematical Society, 2001
Congruence meet-semidistributive locally finite varieties and a finite basis theorem
Algebra universalis
2015
Algebra Universalis, 1990
A property of the solvable radical in flnitely decidable varieties
1992
Finite Basis Theorems for Relatively Congruence-Distributive Quasivarieties
Transactions of the American Mathematical Society, 1988
Konrad Zdanowski, Marcin Mostowski
Fundamenta Informaticae
Decidability of the class of all the rings : A problem of Ax
Forum of Mathematics, Sigma
Congruence intersection properties for varieties of algebras
Journal of the Australian Mathematical Society, 1999
Definability of principal congruences in equivalential algebras
Colloquium Mathematicum
The amalgamation class of a discriminator variety is finitely axiomatizable
Lecture Notes in Mathematics, 1983
Arithmetic of divisibility in finite models
MLQ, 2004
Lecture Notes in Computer Science, 1999
Residual smallness relativized to congruence types, I
Journal of Pure and Applied Algebra, 2001
Definable principal congruences and solvability
Annals of Pure and Applied Logic, 2009
Minimal varieties and quasivarieties
Journal of the Australian Mathematical Society, 1990
Computational Recognition of Properties of Finite Algebras
2008
Theories of arithmetics in finite models
The Journal of Symbolic Logic, 2005
Non-finite-axiomatizability results in algebraic logic
Journal of Symbolic Logic, 1992
Reducibility orderings: Theories, definability and automorphisms
Annals of Mathematical Logic, 1980
AN ALTERNATE ROUTE TO WILLARD'S FINITE BASIS THEOREM
Finitely generated equational classes
Degrees of insolubility of extensions of arithmetic by true propositions
Russian Mathematical Surveys, 1988
Deductive Varieties of Modules and Universal Algebras
Transactions of the American Mathematical Society, 1985
Computational Recognition of Properities of Finite Algebras
2003
Logic Journal of IGPL, 1993
Decidability and Complexity of Finitely Closable Linear Equational Theories
Lecture Notes in Computer Science, 2001