You are not currently logged in.
Access JSTOR through your library or other institution:
Decision Problems for Classes of Diagonalizable Algebras
Studia Logica: An International Journal for Symbolic Logic
Vol. 44, No. 1 (1985), pp. 87-89
Published by: Springer
Stable URL: http://www.jstor.org/stable/20015200
Page Count: 3
You can always find the topics here!Topics: Algebra, Universal algebra, Mathematical problems, Undecidability
Were these topics helpful?See somethings inaccurate? Let us know!
Select the topics that are inaccurate.
Preview not available
We make use of a Theorem of Burris-McKenzie to prove that the only decidable variety of diagonalizable algebras is that defined by '$\tau 0=1$'. Any variety containing an algebra in which $\tau 0\supsetneqq 1$ is hereditarily undecidable. Moreover, any variety of intuitionistic diagonalizable algebras is undecidable.
Studia Logica: An International Journal for Symbolic Logic © 1985 Springer