Studia Logica 41 (4):347 - 349 (1982)

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.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1007/BF00403334
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 53,645
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

Sentences True in All Constructive Models.R. L. Vaught - 1960 - Journal of Symbolic Logic 25 (1):39-53.
Review: Abraham Robinson, Complete Theories. [REVIEW]Robert L. Vaught - 1960 - Journal of Symbolic Logic 25 (2):172-174.

Add more references

Citations of this work BETA

Undecidability in Diagonalizable Algebras.V. Yu Shavrukov - 1997 - Journal of Symbolic Logic 62 (1):79-116.

Add more citations

Similar books and articles


Added to PP index

Total views
24 ( #415,762 of 2,349,062 )

Recent downloads (6 months)
1 ( #512,311 of 2,349,062 )

How can I increase my downloads?


My notes