An Easy Completeness Proof for the Modal mu-Calculus on Finite Trees.
Balder ten CateGaëlle FontainePublished in: FICS (2009)
Keyphrases
- decision trees
- proof search
- automated theorem proving
- natural deduction
- sequent calculus
- equational theories
- modal logic
- real numbers
- proof procedure
- theorem prover
- theorem proving
- finite automata
- cut elimination
- transition systems
- provably correct
- finite number
- complete axiomatization
- tableau calculus
- proof theoretic
- data quality
- inference rules
- tree automata
- linear logic
- tree models
- tree construction
- tree structures
- development environment
- machine learning