2,835 research outputs found
Two-Variable Logic with Two Order Relations
It is shown that the finite satisfiability problem for two-variable logic
over structures with one total preorder relation, its induced successor
relation, one linear order relation and some further unary relations is
EXPSPACE-complete. Actually, EXPSPACE-completeness already holds for structures
that do not include the induced successor relation. As a special case, the
EXPSPACE upper bound applies to two-variable logic over structures with two
linear orders. A further consequence is that satisfiability of two-variable
logic over data words with a linear order on positions and a linear order and
successor relation on the data is decidable in EXPSPACE. As a complementing
result, it is shown that over structures with two total preorder relations as
well as over structures with one total preorder and two linear order relations,
the finite satisfiability problem for two-variable logic is undecidable
Two-variable Logic with Counting and a Linear Order
We study the finite satisfiability problem for the two-variable fragment of
first-order logic extended with counting quantifiers (C2) and interpreted over
linearly ordered structures. We show that the problem is undecidable in the
case of two linear orders (in the presence of two other binary symbols). In the
case of one linear order it is NEXPTIME-complete, even in the presence of the
successor relation. Surprisingly, the complexity of the problem explodes when
we add one binary symbol more: C2 with one linear order and in the presence of
other binary predicate symbols is equivalent, under elementary reductions, to
the emptiness problem for multicounter automata
Satisfiability for two-variable logic with two successor relations on finite linear orders
We study the finitary satisfiability problem for first order logic with two
variables and two binary relations, corresponding to the induced successor
relations of two finite linear orders. We show that the problem is decidable in
NEXPTIME
Two-variable logics with some betweenness relations: Expressiveness, satisfiability and membership
We study two extensions of FO2[<], first-order logic interpreted in finite
words, in which formulas are restricted to use only two variables. We adjoin to
this language two-variable atomic formulas that say, "the letter appears
between positions and " and "the factor appears between positions
and ". These are, in a sense, the simplest properties that are not
expressible using only two variables.
We present several logics, both first-order and temporal, that have the same
expressive power, and find matching lower and upper bounds for the complexity
of satisfiability for each of these formulations. We give effective conditions,
in terms of the syntactic monoid of a regular language, for a property to be
expressible in these logics. This algebraic analysis allows us to prove, among
other things, that our new logics have strictly less expressive power than full
first-order logic FO[<]. Our proofs required the development of novel
techniques concerning factorizations of words
On Spatial Conjunction as Second-Order Logic
Spatial conjunction is a powerful construct for reasoning about dynamically
allocated data structures, as well as concurrent, distributed and mobile
computation. While researchers have identified many uses of spatial
conjunction, its precise expressive power compared to traditional logical
constructs was not previously known. In this paper we establish the expressive
power of spatial conjunction. We construct an embedding from first-order logic
with spatial conjunction into second-order logic, and more surprisingly, an
embedding from full second order logic into first-order logic with spatial
conjunction. These embeddings show that the satisfiability of formulas in
first-order logic with spatial conjunction is equivalent to the satisfiability
of formulas in second-order logic. These results explain the great expressive
power of spatial conjunction and can be used to show that adding unrestricted
spatial conjunction to a decidable logic leads to an undecidable logic. As one
example, we show that adding unrestricted spatial conjunction to two-variable
logic leads to undecidability. On the side of decidability, the embedding into
second-order logic immediately implies the decidability of first-order logic
with a form of spatial conjunction over trees. The embedding into spatial
conjunction also has useful consequences: because a restricted form of spatial
conjunction in two-variable logic preserves decidability, we obtain that a
correspondingly restricted form of second-order quantification in two-variable
logic is decidable. The resulting language generalizes the first-order theory
of boolean algebra over sets and is useful in reasoning about the contents of
data structures in object-oriented languages.Comment: 16 page
Extending Two-Variable Logic on Trees
The finite satisfiability problem for the two-variable fragment of first-order logic interpreted over trees was recently shown to be ExpSpace-complete. We consider two extensions of this logic. We show that adding either additional binary symbols or counting quantifiers to the logic does not affect the complexity of the finite satisfiability problem. However, combining the two extensions and adding both binary symbols and counting quantifiers leads to an explosion of this complexity. We also compare the expressive power of the two-variable fragment over trees with its extension with counting quantifiers. It turns out that the two logics are equally expressive, although counting quantifiers do add expressive power in the restricted case of unordered trees
- …