The following pages link to Ralf Treinen (Q437025):
Displaying 18 items.
- (Q198029) (redirect page) (← links)
- Reducing equational theories for the decision of static equivalence (Q437026) (← links)
- Automata for unordered trees (Q515668) (← links)
- Intruder deduction for the equational theory of abelian groups with distributive encryption (Q876047) (← links)
- A new method for undecidability proofs of first order theories (Q1209623) (← links)
- How to win a game with features (Q1271569) (← links)
- The first-order theory of linear one-step rewriting is undecidable (Q1275021) (← links)
- The first-order theory of lexicographic path orderings is undecidable (Q1392274) (← links)
- On rewrite constraints and context unification (Q1607044) (← links)
- A formally verified interpreter for a shell-like programming language (Q1630019) (← links)
- Deciding the first-order theory of an algebra of feature trees with updates (Q1799104) (← links)
- Logics for unordered trees with data constraints (Q2424682) (← links)
- Symbolic protocol analysis for monoidal equational theories (Q2482449) (← links)
- (Q2762628) (← links)
- (Q2762872) (← links)
- Logics for Unordered Trees with Data Constraints on Siblings (Q2799171) (← links)
- (Q3358706) (← links)
- How to win a game with features (Q5096316) (← links)
