[PDF][PDF] Two-variable logics with some betweenness relations: Expressiveness, satisfiability and membership

A Krebs, K Lodaya, PK Pandya… - Logical Methods in …, 2020 - lmcs.episciences.org
We study two extensions of FO 2 [<], first-order logic interpreted in finite words, in which
formulas are restricted to use only two variables. We adjoin to this language two-variable …

[PDF][PDF] Interval temporal logic

A Cau, B Moszkowski, H Zedan - URL: http://www. cms. dmu. ac …, 2006 - antonio-cau.co.uk
Abstract Interval Temporal Logic (ITL) is a flexible notation for both propositional and first-
order reasoning about periods of time found in descriptions of hardware and software …

The FO^ 2 alternation hierarchy is decidable

M Kufleitner, P Weil - arxiv preprint arxiv:1203.6152, 2012 - arxiv.org
We consider the two-variable fragment FO^ 2 [<] of first-order logic over finite words.
Numerous characterizations of this class are known. Th\'erien and Wilke have shown that it …

[PDF][PDF] Partially ordered automata and piecewise testability

T Masopust, M Krötzsch - Logical Methods in Computer …, 2021 - lmcs.episciences.org
Partially ordered automata are automata where the transition relation induces a partial order
on states. The expressive power of partially ordered automata is closely related to the …

On logical hierarchies within FO^ 2-definable languages

M Kufleitner, P Weil - Logical Methods in Computer Science, 2012 - lmcs.episciences.org
We consider the class of languages defined in the 2-variable fragment of the first-order logic
of the linear order. Many interesting characterizations of this class are known, as well as the …

Around dot depth two

K Lodaya, PK Pandya, SS Shah - International Conference on …, 2010 - Springer
It is known that the languages definable by formulae of the logics FO^2<,S,2<,S,LTLF,P,X,Y
are exactly the variety DA* D. Automata for this class are not known, nor is its precise …

The join levels of the Trotter-Weil hierarchy are decidable

M Kufleitner, A Lauser - International Symposium on Mathematical …, 2012 - Springer
The variety DA of finite monoids has a huge number of different characterizations, ranging
from two-variable first-order logic FO 2 to unambiguous polynomials. In order to study the …

The word problem for omega-terms over the Trotter-Weil hierarchy

M Kufleitner, JP Wächter - Theory of Computing Systems, 2018 - Springer
For two given ω-terms α and β, the word problem for ω-terms over a variety V asks whether
α= β in all monoids in V. We show that the word problem for ω-terms over each level of the …

The Word Problem for -Terms over

J Almeida, M Kufleitner, JP Wächter - arxiv preprint arxiv:2411.08523, 2024 - arxiv.org
We give a ranker-based description using finite-index congruences for the variety
$\boldsymbol {\mathrm {DAb}} $ of finite monoids whose regular $\mathcal {D} $-classes …

On the lattice of sub-pseudovarieties of DA

M Kufleitner, P Weil - Semigroup Forum, 2010 - Springer
The wealth of information that is available on the lattice of varieties of bands, is used to
illuminate the structure of the lattice of sub-pseudovarieties of DA, a natural generalization of …