Fixed points in propositional nonmonotonic logic
An explicit description of fixed points for propositional theories in the nonmonotonic logic introduced by \textit{D. McDermott} and \textit{J. Doyle} [ibid. 13, 41-72 (1980; Zbl 0435.68074)] is given. Some preliminary results concerning the admissibility of a certain set of formulas are presented. From previously proved results, the convergence of the sequence \((NM^ i_ A(B))\) to the unique fixed point of \(NM_ A\) containing B is derived, when B is admissible for A. As a consequence, in Corollary 1.7, it is pointed out that the claim concerning the accessibility of the fixed point of \(NM_ A\) in case \(NM_ A\) has a unique fixed point, asserted by McDermott and Doyle, is not true.
- A context for belief revision: forward chaining-normal nonmonotonic rule systems
- A Fixed Point Semantics for the ATMS
- scientific article; zbMATH DE number 1163924 (Why is no real title available?)
- Evidence for Fixpoint Logic
- scientific article; zbMATH DE number 4183390 (Why is no real title available?)
- Characters and fixed points in provability logic
This page was built for publication: Fixed points in propositional nonmonotonic logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1115426)