Search

• < Previous
• 1
• Next >

---

Existential Definability over the Subword Ordering

Pascal Baumann ; Moses Ganardi ; Ramanathan S. Thinniyam ; Georg Zetzsche.

We study first-order logic (FO) over the structure consisting of finite words over some alphabet $A$, together with the (non-contiguous) subword ordering. In terms of decidability of quantifier alternation fragments, this logic is well-understood: If every word is available as a constant, then even&nbsp;[&hellip;]

---

Defining Recursive Predicates in Graph Orders

Ramanathan S. Thinniyam.

We study the first order theory of structures over graphs i.e. structures of the form ($\mathcal{G},\tau$) where $\mathcal{G}$ is the set of all (isomorphism types of) finite undirected graphs and $\tau$ some vocabulary. We define the notion of a recursive predicate over graphs using Turing Machine&nbsp;[&hellip;]

---

General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond

Rupak Majumdar ; Ramanathan S. Thinniyam ; Georg Zetzsche.

The model of asynchronous programming arises in many contexts, from low-level systems software to high-level web programming. We take a language-theoretic perspective and show general decidability and undecidability results for asynchronous programs that capture all known results as well as show&nbsp;[&hellip;]

---