Fixed points of modal schemes
The concepts of a \(\Sigma\)-formula and \(\Sigma\)-scheme are used in pedicate calculus [\textit{S. S. Goncharov} and \textit{D. I. Sviridenko}, Vychisl. Sist. 107, 3-29 (1985; Zbl 0628.03015)]. In this paper we transfer them to modal propositional logic, which holds a position between classical propositional and predicate logics. In our case, the use of schemes considerably, but not completely, simplifies the situation as compared to that in the predicate logic setting. We prove that a scheme over a transitive Kripke model arrives at its least fixed point in finitely many steps, and that this point is definable by suitable formulas.
- Least fixed points in Grzegorczyk's logic and in the intuitionistic propositional logic
- Least fixed points in the Gödel-Löb logic
- Graded modal operators and fixed points
- Fixed points of formulas with double modalities
- scientific article; zbMATH DE number 5186437 (Why is no real title available?)
- scientific article; zbMATH DE number 1286447 (Why is no real title available?)
- Fixed points of modal DS-formulas
- Fixed Points in Tense Models
This page was built for publication: Fixed points of modal schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1317626)