Add to ORKGWe consider the 10-fragment of second-order logic over the vocabulary h+;; 0; 1; <; S1; :::; Ski, interpreted over the reals, where the predicate symbols Si are interpreted as semialgebraic sets. We show that, in this context, satisability of formulas is decidable for the rst-order 9-quantier fragment and undecidable for the 98- and 8-fragments. We also show that for these three fragments the same (un)decidability results hold for containment and equivalence of formulas
First-order logic is one of the most prominent formalisms in computer science and mathematics. Since...
Using a recently introduced algebraic framework for classifying fragments of first-order logic, we s...
In general, first-order predicate logic extended with linear integer arithmetic is undecidable. We s...
We consider the Σ1 0-fragment of second-order logic over the vocabulary h+, ×, 0, 1, <, S1, ..., Ski...
We introduce a new decidable fragment of first-order logic with equality, which strictly generalizes...
International audienceFirst-order linear real arithmetic enriched with uninterpreted predicate symbo...
First-order linear real arithmetic enriched with uninterpreted predicate symbols yields an interesti...
First-order logic has a long tradition and is one of the most prominent and most important formalism...
During the last decades, a lot of effort was put into identifying decidable fragments of first-order...
One-dimensional fragment of first-order logic is obtained by restricting quantification to blocks of...
We prove that satisfiability over infinite words is decidable for a fragment of asymptotic monadic s...
We propose a fragment of many-sorted second order logic called EQSMT and show that checking satisfia...
International audienceFirst-order linear rational arithmetic enriched with uninterpreted predicates ...
We study first-order logic (FO) over the structure consisting of finite words over some alphabet $A$...
AbstractWe investigate the expressive power of second-order logic over finite structures, when two l...
First-order logic is one of the most prominent formalisms in computer science and mathematics. Since...
Using a recently introduced algebraic framework for classifying fragments of first-order logic, we s...
In general, first-order predicate logic extended with linear integer arithmetic is undecidable. We s...
We consider the Σ1 0-fragment of second-order logic over the vocabulary h+, ×, 0, 1, <, S1, ..., Ski...
We introduce a new decidable fragment of first-order logic with equality, which strictly generalizes...
International audienceFirst-order linear real arithmetic enriched with uninterpreted predicate symbo...
First-order linear real arithmetic enriched with uninterpreted predicate symbols yields an interesti...
First-order logic has a long tradition and is one of the most prominent and most important formalism...
During the last decades, a lot of effort was put into identifying decidable fragments of first-order...
One-dimensional fragment of first-order logic is obtained by restricting quantification to blocks of...
We prove that satisfiability over infinite words is decidable for a fragment of asymptotic monadic s...
We propose a fragment of many-sorted second order logic called EQSMT and show that checking satisfia...
International audienceFirst-order linear rational arithmetic enriched with uninterpreted predicates ...
We study first-order logic (FO) over the structure consisting of finite words over some alphabet $A$...
AbstractWe investigate the expressive power of second-order logic over finite structures, when two l...
First-order logic is one of the most prominent formalisms in computer science and mathematics. Since...
Using a recently introduced algebraic framework for classifying fragments of first-order logic, we s...
In general, first-order predicate logic extended with linear integer arithmetic is undecidable. We s...