Learn More
The satissability problem for the two-variable fragment of rst-order logic is investigated over nite and innnite linearly ordered, respectively wellordered domains, as well as over nite and innnite domains in which one or several designated binary predicates are interpreted as arbitrary wellfounded relations. It is shown that FO 2 over ordered, respectively(More)
We investigate model theoretic characterisations of the expressive power of modal logics in terms of bisimulation invariance. The paradigmatic result of this kind is van Benthem's theorem, which says that a first-order formula is invariant under bisimulation if and only if it is equivalent to a formula of basic modal logic. The present investigation(More)
Consider the class of all those properties of worlds in nite Kripke structures (or of states in inite transition systems), that are recognizable in polynomial time, and closed under bisimulation equivalence. It is shown that the class of these bisimulation-invariant Ptime queries has a natural logical characterization. It is captured by the straightforward(More)
This paper is a survey and systematic presentation of decidability and complexity issues for modal and non-modal two-variable logics. A classical result due to Mortimer says that the two-variable fragment of rst-order logic, denoted FO 2 , has the nite model property and is therefore decidable for satissability. One of the reasons for the signiicance of(More)
Guarded fixed-point logic μGF extends the guarded fragment by means of least and greatest fixed points, and thus plays the same role within the domain of guarded logics as the modal μ-calculus plays within the modal domain. We provide a semantic characterization of μGF within an appropriate fragment of second-order logic, in terms of invariance(More)
Evaluating a boolean conjunctive query q over a guarded first-order theory T is equivalent to checking whether (T \& not q) is unsatisfiable. This problem is relevant to the areas of database theory and description logic. Since q may not be guarded, well known results about the decidability, complexity, and finite-model property of the guarded fragment(More)
We consider \generic" (isomorphism-invariant) queries on rela-tional databases embedded in an innnite background structure. Assume a generic query is expressible by a rst-order formula over the embedded domain that may involve both the relations of the database and the relations and functions of the background structure. Then this query is already(More)
Lyndon's Interpolation Theorem asserts that for any valid implication between two purely relational sentences of rst-order logic, there is an interpolant in which each relation symbol appears only in those polarities in which it appears in both the antecedent and the succedent of the given implication. This note proves a similar interpolation result under(More)