Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

Decision Problems for Classes of Diagonalizable Algebras

Aldo Ursini
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
  • Download ($43.95)
  • Cite this Item
Decision Problems for Classes of Diagonalizable Algebras
Preview not available

Abstract

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.

Page Thumbnails

  • Thumbnail: Page 
[87]
    [87]
  • Thumbnail: Page 
88
    88
  • Thumbnail: Page 
89
    89