A Note on the Completeness of Kozen's Axiomatisation of the Propositional μ-Calculus

DOI10.2307/420995zbMath0868.03010OpenAlexW1998217091MaRDI QIDQ5689266

Igor Walukiewicz

Publication date: 19 August 1997

Published in: Bulletin of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: http://www.math.ucla.edu/~asl/bsl/0203-toc.htm

zbMATH Keywords

modal logictracerefutationpropositional \(\mu\)-calculusleast fixed point operatormodel-extractiontableau proof search procedure

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Proof theory in general (including proof-theoretic semantics) (03F03)

Related Items (1)

Topologies, Continuity and Bisimulations

Cites Work

• Results on the propositional \(\mu\)-calculus
• Proof methods for modal and intuitionistic logics
• An automata theoretic decision procedure for the propositional mu- calculus

This page was built for publication: A Note on the Completeness of Kozen's Axiomatisation of the Propositional μ-Calculus