Probabilities on first order models

It is known that set algebras corresponding to first order models (i.e cylindric set algebras associated with first order interpretations) are not ?-closed, but closed w.r.t. certain infima and suprema i.e. [FORMULA] and [FORMULA] for any infinite subsequence y1, y2,... yi,... of the individuum variables in the language. We investigate probabilities denned on these set algebras and being continuous w.r.t. the suprema and infima in (*). We can not use the usual technics, because these suprema and infima are not the usual unions and intersections of sets. These probabilities are interesting in computer science among others, because the probabilities of the quantifier-free formulas determine that of any formula and the probabilities of the former ones can be measured by statistical methods. .

Decidability of cylindric set algebras of dimension two and first-order logic with two variables

The aim of this paper is to give a new proof for the decidability and finite model property of first-order logic with two variables (without function symbols), using a combinatorial theorem due to Herwig. The results are proved in the framework of polyadic equality set algebras of dimension two (Pse2). The new proof also shows the known results that the universal theory of Pse2 is decidable and that every finite Pse2 can be represented on a finite base. Since the class Cs2 of cylindric set algebras of dimension 2 forms a reduct of Pse2, these results extend to Cs2 as well.

Undecidable relativizations of algebras of relations

In this paper we show that relativized versions of relation set algebras and cylindric set algebras have undecidable equational theories if we include coordinatewise versions of the counting operations into the similarity type. We apply these results to the guarded fragment of first-order logic.

Cylindric modal logic

Treating the existential quantification ∃νi as a diamond ♢i and the identity νi = νj as a constant δij, we study restricted versions of first order logic as if they were modal formalisms. This approach is closely related to algebraic logic, as the Kripke frames of our system have the type of the atom structures of cylindric algebras; the full cylindric set algebras are the complex algebras of the intended multidimensional frames called cubes.The main contribution of the paper is a characterization of these cube frames for the finite-dimensional case and, as a consequence of the special form of this characterization, a completeness theorem for this class. These results lead to finite, though unorthodox, derivation systems for several related formalisms, e.g. for the valid n-variable first order formulas, for type-free valid formulas and for the equational theory of representable cylindric algebras. The result for type-free valid formulas indicates a positive solution to Problem 4.16 of Henkin, Monk and Tarski [16].