Finite inseparability of some theories of cylindrification algebras

Journal of Symbolic Logic 34 (2):171-176 (1969)
  Copy   BIBTEX

Abstract

An elementary theory T in a language L is (strongly) finitely inseparable if the set of logically valid sentences of L and the set of T-finitely refutable sentences are recursively inseparable. In §1 we establish a sufficient condition for the elementary theory of a class of BA's with operators to be finitely inseparable. This is done using the methods developed independently by M. Rabin and D. Scott (see [6]) on the one hand and by Ershov on the other (see [2]).

Links

PhilArchive



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

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
19 (#821,503)

6 months
1 (#1,508,411)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

On varieties of cylindric algebras with applications to logic.I. Németi - 1987 - Annals of Pure and Applied Logic 36:235-277.
The Decision Problem for Certain Nilpotent Closed Varieties.Stephen D. Comer - 1981 - Mathematical Logic Quarterly 27 (31‐35):557-560.
The Decision Problem for Certain Nilpotent Closed Varieties.Stephen D. Comer - 1981 - Mathematical Logic Quarterly 27 (31-35):557-560.

Add more citations

References found in this work

Review: Alfred Tarski, Undecidable Theories. [REVIEW]Martin Davis - 1959 - Journal of Symbolic Logic 24 (2):167-169.

Add more references