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]).

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,449

External links

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

Through your library

Similar books and articles

Scott sentences for certain groups.Julia F. Knight & Vikram Saraph - 2018 - Archive for Mathematical Logic 57 (3-4):453-472.
On the Possibility of Inference to the Best Explanation.Clark Glymour - 2012 - Journal of Philosophical Logic 41 (2):461-469.
Pseudoprojective strongly minimal sets are locally projective.Steven Buechler - 1991 - Journal of Symbolic Logic 56 (4):1184-1194.
Finitely based theories.Ehud Hrushovski - 1989 - Journal of Symbolic Logic 54 (1):221-225.
The model theory of finitely generated finite-by-Abelian groups.Francis Oger - 1984 - Journal of Symbolic Logic 49 (4):1115-1124.
There Are No Minimal Effectively Inseparable Theories.Yong Cheng - 2023 - Notre Dame Journal of Formal Logic 64 (4):425-439.
On Transfinite Levels of the Ershov Hierarchy.Cheng Peng - 2021 - Bulletin of Symbolic Logic 27 (2):220-221.

Analytics

Added to PP
2009-01-28

Downloads
49 (#476,215)

6 months
17 (#158,396)

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.

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