Abstract
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.
Similar content being viewed by others
References
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.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Smoryński, C. The finite inseparability of the first-order theory of diagonalisable algebras. Stud Logica 41, 347–349 (1982). https://doi.org/10.1007/BF00403334
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00403334