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

DOI10.1007/978-3-031-47921-2_3MaRDI QIDQ6612809FDOQ6612809

Johan van Benthem

Publication date: 1 October 2024

zbMATH Keywords

definabilitymodal provability logicwell-founded orderings

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The undecidability of iterated modal relativization
• Modal logic
• Essays in logical semantics
• Game Solution, Epistemic Dynamics and Fixed-Point Logics
• Automata, logics, and infinite games. A guide to current research
• Weak Second‐Order Arithmetic and Finite Automata
• Hybrid logics: Characterization, interpolation and complexity
• Self-reference and modal logic
• Neighborhood semantics for modal logic
• Modal frame correspondences and fixed-points
• Persistent and invariant formulas relative to theories of higher order
• A new proof of the fixed-point theorem of provability logic
• Processes, Terms and Cycles: Steps on the Road to Infinity
• Guarded fixed point logics and the monadic theory of countable trees.

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)