An abstract look at the fixed-point theorem for provability logic

DOI10.1007/978-3-031-47921-2_3MaRDI QIDQ6612809zbMATH OpenFDO

Authors Johan van Benthem

Publication date 1 October 2024

Full work available at URL https://doi.org/10.1007/978-3-031-47921-2_3

zbMATH Keywords

definabilitymodal provability logicwell-founded orderings

Mathematics Subject Classification ID

Subsystems of classical logic (including intuitionistic logic) (03B20) Modal logic (including the logic of norms) (03B45) Provability logics and related algebras (e.g., diagonalizable algebras) (03F45)

Cites work

• A new proof of the fixed-point theorem of provability logic
• Automata, logics, and infinite games. A guide to current research
• Essays in logical semantics
• Game solution, epistemic dynamics and fixed-point logics
• Guarded fixed point logics and the monadic theory of countable trees.
• scientific article; zbMATH DE number 4208062 (Why is no real title available?)
• scientific article; zbMATH DE number 1032008 (Why is no real title available?)
• scientific article; zbMATH DE number 803291 (Why is no real title available?)
• Hybrid logics: Characterization, interpolation and complexity
• Modal frame correspondences and fixed-points
• Modal logic
• Neighborhood semantics for modal logic
• Persistent and invariant formulas relative to theories of higher order
• Processes, Terms and Cycles: Steps on the Road to Infinity
• Self-reference and modal logic
• The undecidability of iterated modal relativization
• Weak Second‐Order Arithmetic and Finite Automata

Cited in

(2)

• Reasoning under uncertainty in the game of cops and robbers
• A modal approach towards substitutions

This page was built for publication: An abstract look at the fixed-point theorem for provability logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6612809)