A proof system with names for modal mu-calculus

Abstract

Fixpoints are an important ingredient in semantics, abstract interpretation and program logics. Their addition to a logic can add considerable expressive power. One general issue is how to define proof systems for such logics. Here we examine proof systems for modal logic with fixpoints [4]. We present a tableau proof system for checking validity of formulas which uses names to keep track of unfoldings of fixpoint variables as devised in [7]. © Colin Stirling.