5 problems
- 0 votes0 replies0 views
The tangle expressivity conjecture for the topological μ-calculus
Let be the modal language obtained by extending modal logic with the tangle operator , and let the topological -calculus be the…
- 0 votes0 replies0 views
Conjecture that the intuitionistic μ-calculus is trivial
Let the intuitionistic propositional calculus be extended with least and greatest fixed-point operators, forming an intuitionistic -calculus. A formula is fixed-point free if i…
- 0 votes0 replies0 views
Game-theoretic characterization of natural isomorphism for parity-game interpretations
Game-theoretic equivalence conjecture. The notion of game-theoretic equivalence can be defined so that two parity games are game-theoretically equivalent if and only if their inter…
- 0 votes0 replies0 views
Soundness and completeness of the tableau calculus for arbitrary formulas
The paper considers a tableau calculus for the coalgebraic -calculus whose inputs may be formula sequents. Tableau-calculus conjecture. The tableau calculus is sound and compl…
- 0 votes0 replies0 views
Soundness and completeness of the tableau calculus for arbitrary coalgebraic mu-calculus formulas
A formula is guarded if every fixpoint variable occurs only within the scope of a modal operator; the paper studies a tableau calculus for the coalgebraic -calculus, with form…