Name
Abstract | ||
|---|---|---|
study an extension of FO^2[u003c], first-order logic interpreted in finite words, in which formulas are restricted to use only two variables. adjoin to this language two-variable atomic formulas that say, `the letter a appears between positions x and yu0027. This is, in a sense, the simplest property that is 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. also give an effective necessary condition, in terms of the syntactic monoid of a regular language, for a property to be expressible in this logic. show that this condition is also sufficient for words over a two-letter alphabet. This algebraic analysis allows us us to prove, among other things, that our new logic has strictly less expressive power than full first-order logic FO[u003c]. |
Year | Venue | Field |
|---|---|---|
2016 | arXiv: Logic in Computer Science | Algebraic sentence,Discrete mathematics,Predicate variable,Algorithm,Predicate functor logic,Many-valued logic,Predicate logic,Higher-order logic,Intermediate logic,Mathematics,Dynamic logic (modal logic) |
DocType | Volume | Citations |
Journal | abs/1603.05625 | 0 |
PageRank | References | Authors |
0.34 | 1 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Andreas Krebs | 1 | 21 | 8.20 |
| Kamal Lodaya | 2 | 225 | 19.53 |
| Paritosh K. Pandya | 3 | 944 | 91.64 |
| Howard Straubing | 4 | 528 | 60.92 |