The following pages link to Completeness of Park induction (Q1391869):
Displaying 18 items.
- A connection between concurrency and language theory (Q265802) (← links)
- Axiomatizing the equational theory of regular tree languages (Q844887) (← links)
- Completions of \(\mu \)-algebras (Q925850) (← links)
- Is observational congruence on \(\mu \)-expressions axiomatisable in equational Horn logic? (Q979076) (← links)
- Equational properties of iteration in algebraically complete categories (Q1128480) (← links)
- Group axioms for iteration (Q1283821) (← links)
- The equational logic of fixed points (Q1391734) (← links)
- On the equational definition of the least prefixed point. (Q1401250) (← links)
- Algebraically complete semirings and Greibach normal form (Q1772777) (← links)
- Pushdown tree automata, algebraic tree systems, and algebraic tree series (Q1854412) (← links)
- Axiomatizing weighted synchronization trees and weighted bisimilarity (Q2447752) (← links)
- Superconformal symmetry in three dimensions (Q2738243) (← links)
- Equational Properties of Fixed Point Operations in Cartesian Categories: An Overview (Q2946322) (← links)
- Precise Upper and Lower Bounds for the Monotone Constraint Satisfaction Problem (Q2946352) (← links)
- Equational Properties of Stratified Least Fixed Points (Extended Abstract) (Q2947468) (← links)
- Equational axioms associated with finite automata for fixed point operations in cartesian categories (Q2973247) (← links)
- Dagger extension theorem (Q3094166) (← links)
- Kleene Theorem in Partial Conway Theories with Applications (Q3098034) (← links)
