This is a survey article on algebraic logic. It gives a historical background leading up to a modern perspective. Central problems in algebraic logic (like the representation problem) are discussed in connection to other branches of logic, like modal logic, proof theory, model-theoretic forcing, finite combinatorics, and Gödel’s incompleteness results. We focus on cylindric algebras. Relation algebras and polyadic algebras are mostly covered only insofar as they relate to cylindric algebras, and even there we have not told the whole story. (...) We relate the algebraic notion of neat embeddings (a notion special to cylindric algebras) to the metalogical ones of provability, interpolation and omitting types in variants of first logic. Another novelty that occurs here is relating the algebraic notion of atom-canonicity for a class of boolean algebras with operators to the metalogical one of omitting types for the corresponding logic. A hitherto unpublished application of algebraic logic to omitting types of first order logic is given. Proofs are included when they serve to illustrate certain concepts. Several open problems are posed. We have tried as much as possible to avoid exploring territory already explored in the survey articles of Monk [93] and Németi [97] in the subject. (shrink)

We will study the class RSA of -dimensional representable substitution algebras. RSA is a sub-reduct of the class of representable cylindric: algebras, and it was an open problem in Andréka [1] that whether RSA can be finitely axiomatized. We will show, that the answer is positive. More concretely, we will prove, that RSA is a finitely axiomatizable quasi-variety. The generated variety is also described. We note that RSA is the algebraic counterpart of a certain proportional multimodal logic and it is (...) related to a natural fragment of first order logic, as well. (shrink)

This paper is an introduction: in particular, to algebras of relations of various ranks, and in general, to the part of algebraic logic algebraizing quantifier logics. The paper has a survey character, too. The most frequently used algebras like cylindric-, relation-, polyadic-, and quasi-polyadic algebras are carefully introduced and intuitively explained for the nonspecialist. Their variants, connections with logic, abstract model theory, and further algebraic logics are also reviewed. Efforts were made to make the review part relatively comprehensive. In some (...) directions we tried to give an overview of the most recent results and research trends, too. (shrink)

We give a new characterization of the class of completely representable cylindric algebras of dimension 2 #lt; n ≤ w via special neat embeddings. We prove an independence result connecting cylindric algebra to Martin's axiom. Finally we apply our results to finite-variable first order logic showing that Henkin and Orey's omitting types theorem fails for Ln, the first order logic restricted to the first n variables when 2 #lt; n#lt;w. Ln has been recently (and quite extensively) studied as a many-dimensional (...) modal logic. (shrink)

We characterise the class S Ra CA n of subalgebras of relation algebra reducts of n -dimensional cylindric algebras by the notion of a ‘hyperbasis’, analogous to the cylindric basis of Maddux, and by representations. We outline a game–theoretic approximation to the existence of a representation, and how to use it to obtain a recursive axiomatisation of S Ra CA n.

We survey various results on the relationship among neat embeddings (a notion special to cylindric algebras), complete representations, omitting types, and amalgamation. A hitherto unpublished application of algebraic logic to omitting types of first-order logic is given.

In this work, we attempt to alleviate three equivalent negative results. These are non-axiomatizability of the valid formula schemas of first order logic, non-axiomatizability of any propositional logic equivalent with classical first order logic , and non-axiomatizability of the class of representable cylindric algebras . Here we present two finite schema axiomatizable classes of algebras that contain, as a reduct, the class of representable quasi-polyadic algebras and the class of representable cylindric algebras, respectively. We establish positive results in the direction (...) of finitary algebraization of first order logic without equality as well as that with equality. Finally, we will indicate how these constructions can be applied to turn negative results , above to positive one. (shrink)

We prove an Omitting Types Theorem for certain algebraizable extensions of first order logic without equality studied in [SAI 00] and [SAY 04]. This is done by proving a representation theorem preserving given countable sets of infinite meets for certain reducts of ?- dimensional polyadic algebras, the so-called G polyadic algebras (Theorem 5). Here G is a special subsemigroup of (?, ? o) that specifies the signature of the algebras in question. We state and prove an independence result connecting our (...) representation theorem to Martin's axiom (Theorem 6). Also we show that the countable atomic G polyadic algebras are completely representable (Corollary 16) contrasting results on cylindric algebras. Several related results are surveyed. (shrink)

What precisely are fragments of classical first-order logic showing “modal” behaviour? Perhaps the most influential answer is that of Gabbay 1981, which identifies them with so-called “finite-variable fragments”, using only some fixed finite number of variables (free or bound). This view-point has been endorsed by many authors (cf. van Benthem 1991). We will investigate these fragments, and find that, illuminating and interesting though they are, they lack the required nice behaviour in our sense. (Several new negative results support this claim.) (...) As a counterproposal, then, we define a large fragment of predicate logic characterized by its use of only bounded quantification. This so-called guarded fragment enjoys the above nice properties, including decidability, through an effectively bounded finite model property. (These are new results, obtained by generalizing notions and techniques from modal logic.) Moreover, its own internal finite variable hierarchy turns out to work well. Finally, we shall make another move. The above analogy works both ways. Modal operators are like quantifiers, but quantifiers are also like modal operators. This observation inspires a generalized semantics for first-order predicate logic with accessibility constraints on available assignments (cf. N´emeti 1986, 1992) which moves the earlier quantifier restrictions into the semantics. This provides a fresh look at the landscape of possible predicate logics, including candidates sharing various desirable features with basic modal logic – in particular, its decidability. (shrink)

SC , CA , QA and QEA stand for the classes of Pinter's substitution algebras, Tarski's cylindric algebras, Halmos' quasipolyadic algebras, and quasipolyadic equality algebras of dimension , respectively. Generalizing a result of Németi on cylindric algebras, we show that for K {SC, CA, QA, QEA} and ordinals , the class Nr K of -dimensional neat reducts of -dimensional K algebras, though closed under taking homomorphic images and products, is not closed under forming subalgebras (i.e. is not a variety) if (...) and only if > 1.From this it easily follows that for 1 , the operation of forming -neat reducts of algebras in K does not commute with forming subalgebras, a notion to be made precise. (shrink)

In this note we give an interpretation of cylindric algebras as algebras of sentences of first order logic. We show that the isomorphism types of such algebras of sentences coincide with the class of neat reducts of cylindric algebras. Also we show how this interpretation sheds light on some recent results. This is done by likening Henkin's Neat Embedding Theorem to his celebrated completeness proof.

Three classes are introduced which are closely related to the class included in the title. It is proven that the class obtained from by replacing axiom C4 by the commutativity of single substitutions can be considered as the abstract class in the Resek–Thompson theorem, thus it is representable by set algebras. Then the class is defined and it is shown that the necessary and sufficient condition for neat embeddability of an algebra in CAα into is the validity of the merry-go-round (...) properties. Finally, the class is introduced which class is a counterpart of among the polyadic like algebras. (shrink)

In this note we give an interpretation of cylindric algebras as algebras of sentences of first order logic. We show that the isomorphism types of such algebras of sentences coincide with the class of neat reducts of cylindric algebras. Also we show how this interpretation sheds light on some recent results. This is done by likening Henkin's Neat Embedding Theorem to his celebrated completeness proof.

We show that the existential preservation theorem fails for two-variable first-order logic FO2. It is known that for all k ≥ 3, FOk does not have an existential preservation theorem, so this settles the last open case, answering a question of Andreka, van Benthem, and Németi. In contrast, we prove that the homomorphism preservation theorem holds for FO2.

We give an algebraic version of first order logic without equality in which the class of representable algebras forms a finitely based equational class. Further, the representables are defined in terms of set algebras, and all operations of the latter are permutation invariant. The algebraic form of this result is Theorem 1.1 , while its logical form is Corollary 5.2.For first order logic with equality we give a result weaker than the one for first order logic without equality. Namely, in (...) this case - instead of finitely axiomatizing the corresponding class of all representable algebras - we finitely axiomatize only the equational theory of that class. Subsection 6.1, especially Remark 6.6 there.The proof of Theorem 1.1 is elaborated in Sections 3 and 4. These sections contain theorems which are interesting of their own rights, too, e.g. Theorem 4.2 is a purely semigroup theoretic result. Cf. also 'Further main results' in the Introduction. (shrink)

For any finite n 3 there are two atomic n-dimensional cylindric algebras with the same atom structure, with one representable, the other, not.Hence, the complex algebra of the atom structure of a representable atomic cylindric algebra is not always representable, so that the class RCAn of representable n-dimensional cylindric algebras is not closed under completions. Further, it follows by an argument of Venema that RCAn is not axiomatisable by Sahlqvist equations, and hence nor by equations where negation can only occur (...) in constant terms.Similar results hold for relation algebras. (shrink)

We give a new characterization of the class of completely representable cylindric algebras of dimension 2 #lt; n w via special neat embeddings. We prove an independence result connecting cylindric algebra to Martin''s axiom. Finally we apply our results to finite-variable first order logic showing that Henkin and Orey''s omitting types theorem fails for L n, the first order logic restricted to the first n variables when 2 #lt; n#lt;w. L n has been recently (and quite extensively) studied as a (...) many-dimensional modal logic. (shrink)

For every finite n ≥ 4 there is a logically valid sentence φ n with the following properties: φ n contains only 3 variables (each of which occurs many times); φ n contains exactly one nonlogical binary relation symbol (no function symbols, no constants, and no equality symbol): φ n has a proof in first-order logic with equality that contains exactly n variables, but no proof containing only n - 1 variables. This result was first proved using the machinery of (...) algebraic logic developed in several research monographs and papers. Here we replicate the result and its proof entirely within the realm of (elementary) first-order binary predicate logic with equality. We need the usual syntax, axioms, and rules of inference to show that φ n has a proof with only n variables. To show that φ n has no proof with only n - 1 variables we use alternative semantics in place of the usual, standard, set-theoretical semantics of first-order logic. (shrink)