Pages that link to "Item:Q1921846"
From MaRDI portal
The following pages link to Undecidability of the positive \(\forall\exists^ 3\)-theory of a free semigroup (Q1921846):
Displaying 18 items.
- Finding all solutions of equations in free groups and monoids with involution (Q342722) (← links)
- The decision problem for some logics for finite words on infinite alphabets (Q843605) (← links)
- On equations in free semigroups with certain constraints on their solutions. (Q843606) (← links)
- Undecidability of a simple fragment of a positive theory with a single constant for a free semigroup of rank two (Q1582961) (← links)
- \(\forall \exists^{5}\)-equational theory of context unification is undecidable (Q1607219) (← links)
- Non-structural subtype entailment in automata theory (Q1887157) (← links)
- Inclusion problems for patterns with a bounded number of variables (Q1932172) (← links)
- On equations and first-order theory of one-relator monoids (Q2051781) (← links)
- Word equations in the context of string solving (Q2163975) (← links)
- On ``simple'' undecidable fragments of the positive theory of a free semigroup (Q2211367) (← links)
- On the decidability boundary of the infinite symmetric group (Q2736206) (← links)
- Undecidability of first order sentences in the theory of free groupoids (Q3240235) (← links)
- Theories of orders on the set of words (Q3374756) (← links)
- DECIDABILITY OF THE UNIVERSAL AND POSITIVE THEORIES OF A FREE GROUP (Q3699893) (← links)
- (Q4309578) (← links)
- (Q5239606) (← links)
- A closer look at the expressive power of logics based on word equations (Q6580075) (← links)
- Languages generated by conjunctive query fragments of FC[REG] (Q6661764) (← links)