The finite inseparability of the first-order theory of diagonalisable algebras

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

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.

Download options

PhilArchive



    Upload a copy of this work     Papers currently archived: 72,766

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2009-01-28

Downloads
24 (#478,682)

6 months
1 (#386,989)

Historical graph of downloads
How can I increase my downloads?

References found in this work

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