Pages that link to "Item:Q2957894"

The following pages link to \(\mathrm{FO}^2\) with one transitive relation is decidable (Q2957894):

Displaying 9 items.

• A double team semantics for generalized quantifiers (Q302243) (← links)
• Small substructures and decidability issues for first-order logic with two variables (Q2915891) (← links)
• Two-Variable Separation Logic and Its Inner Circle (Q2957697) (← links)
• Finite satisfiability for two‐variable, first‐order logic with one transitive relation is decidable (Q5109226) (← links)
• On the satisfiability problem for fragments of two-variable logic with one transitive relation (Q5212557) (← links)
• Regular Graphs and the Spectra of Two-Variable Logic with Counting (Q5258916) (← links)
• On the Decidability of Elementary Modal Logics (Q5277903) (← links)
• Two-Variable Logic with Counting and Trees (Q5278191) (← links)
• Complexity of Two-Variable Logic on Finite Trees (Q5278193) (← links)