Fixed-Point Logic with the Approximation Modality and Its Kripke Completeness

Abstract. We present two modal typing systems with the approximation modality, which has been proposed by the author to capture selfreferences involved in computer programs and their specifications. The systems are based on the simple and the F-semantics of types, respectively, and correspond to the same modal logic, which is considered the intuitionistic version of the logic of provability. We also show Kripke completeness of the modal logic and its decidability, which implies the decidability of type inhabitance in the typing systems.

• Type: Conference
• Year: 2001
• Where: TACS
• Authors: Hiroshi Nakano
• Keywords: Approximation Modality, Modal Logic, Modal Typing Systems, Software Engineering, TACS 2001