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

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

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.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,100

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
30 (#534,180)

6 months
4 (#794,133)

Historical graph of downloads
How can I increase my downloads?