The finite inseparability of the first-order theory of diagonalisable algebras
- Craig Smoryński
- … show all 1 hide
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.Get Access
In a recent paper, Montagna proved the undecidability of the first-order theory of diagonalisable algebras. This result is here refined — the set of finitely refutable sentences is shown effectively inseparable from the set of theorems. The proof is quite simple.
- C. Bernardi, On the equational class of diagonalisable algebras, Studia Logica 34 (1975), pp. 322–331.
- Ju. Eršov and M. Taiclin, The undecidability of certain theories, (Russian), Algebra i Logica 2 No. 5 (1963), pp. 37–42.
- R. Magari, Representation and duality theory for diagonalisable algebras, Studia Logica, 34 (1975), pp. 305–313.
- F. Montagna, The undecidability of the first-order theory of diagonalisable algebras, Studia Logica 39 (1980), pp. 355–359.
- K. Segerberg, An essay in classical modal logic, Uppsala, 1971.
- C. Smoryński, Fixed point algebras, Bulletin of the American Mathematical Society 6 (1982), pp, 317–356.
- R. Solovay, Probability interpretations of modal logic, Israel Journal of Mathematics 25 (1976), pp. 287–304.
- B. Trahtenbrot, On recursive separability, (Russian), Doklady AN SSSR 88 (1953), pp. 953–956.
- R. Vaught, Sentences true in all constructive models, Journal of Symbolic Logic 25 (1960), pp. 39–53.
- The finite inseparability of the first-order theory of diagonalisable algebras
Volume 41, Issue 4 , pp 347-349
- Cover Date
- Print ISSN
- Online ISSN
- Kluwer Academic Publishers
- Additional Links
- Craig Smoryński (1)
- Author Affiliations
- 1. Department of Mathematics, San José State University, 95 192, San José, CA, USA