Completeness of Park induction
From MaRDI portal
Publication:1391869
DOI10.1016/S0304-3975(96)00240-XzbMath0901.68107OpenAlexW2091780332MaRDI QIDQ1391869
Publication date: 23 July 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(96)00240-x
Related Items (22)
A connection between concurrency and language theory ⋮ THE POWER OF THE GROUP-IDENTITIES FOR ITERATION ⋮ Axiomatizing the equational theory of regular tree languages ⋮ Equational properties of iteration in algebraically complete categories ⋮ Equational Properties of Fixed Point Operations in Cartesian Categories: An Overview ⋮ Precise Upper and Lower Bounds for the Monotone Constraint Satisfaction Problem ⋮ Equational Properties of Stratified Least Fixed Points (Extended Abstract) ⋮ The equational logic of fixed points ⋮ On the equational definition of the least prefixed point. ⋮ Equational axioms associated with finite automata for fixed point operations in cartesian categories ⋮ Equational properties of fixed-point operations in cartesian categories: An overview ⋮ Axiomatizing weighted synchronization trees and weighted bisimilarity ⋮ Completions of \(\mu \)-algebras ⋮ Unnamed Item ⋮ Superconformal symmetry in three dimensions ⋮ Algebraically complete semirings and Greibach normal form ⋮ Is observational congruence on \(\mu \)-expressions axiomatisable in equational Horn logic? ⋮ Dagger extension theorem ⋮ Domain mu-calculus ⋮ Kleene Theorem in Partial Conway Theories with Applications ⋮ Group axioms for iteration ⋮ Pushdown tree automata, algebraic tree systems, and algebraic tree series
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algebras of iteration theories
- Results on the propositional \(\mu\)-calculus
- Scott induction and closure under \(\omega\)-sups
- On flowchart theories. I. The deterministic case
- On flowchart theories. II: The nondeterministic case
- Independence of the equational axioms for iteration theories
- Complete systems of \(\mathcal B\)-rational identities
- On the algebraic structure of rooted trees
- A completeness theorem for Kleene algebras and the algebra of regular events
- Notes on equational theories of relations
- Predicate Transformer Semantics
- Une remarque sur les systèmes complets d'identités rationnelles
- Solutions of the Iteration Equation and Extensions of the Scalar Iteration Operation
- Vector Iteration in Pointed Iterative Theories
- Equational axioms for regular sets
- Solving polynomial fixed point equations
- ITERATION ALGEBRAS
- FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES
- A Perspective View of Discrete Automata and Their Design
This page was built for publication: Completeness of Park induction
