Self-reference and modal logic
provability predicatewitness comparisonsRosser sentencesfixed point sentenceHenkin sentencemodal analysis of fixed pointsmodal provability logicmulti-modal schemesself-referential sentencessentential self-referenceGödel sentence
Philosophical and critical aspects of logic and foundations (03A05) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Modal logic (including the logic of norms) (03B45) Foundations of classical theories (including reverse mathematics) (03B30) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01)
- Infinitary combinatorics and modal logic
- Arithmetical interpretations and Kripke frames of predicate modal logic of provability
- A set-theoretic translation method for polymodal logics
- Friedman-reflexivity
- Languages with self-reference. II: Knowledge, belief, and modality
- A quantified logic of evidence
- scientific article; zbMATH DE number 664031 (Why is no real title available?)
- Reflection calculus and conservativity spectra
- Self-reference in arithmetic. I
- Self-reference in arithmetic. II
- The decision problem of provability logic with only one atom
- The paradox of the knower revisited
- Logic of proofs and provability
- Hierarchical incompleteness results for arithmetically definable extensions of fragments of arithmetic
- The knower paradox in the light of provability interpretations of modal logic
- On bimodal logics of provability
- Logic of proofs
- The logic of \(\Pi_ 1\)-conservativity
- Strictly primitive recursive realizability. II: Completeness with respect to iterated reflection and a primitive recursive \(\omega\)-rule
- Multilanguage hierarchical logics, or: How we can do without modal logics
- A small reflection principle for bounded arithmetic
- European Summer Meeting of the Association for Symbolic Logic
- Sentences implying their own provability
- Self-referential justifications in epistemic logic
- Languages with self-reference. I: Foundations (or: We can have everything in first-order logic!)
- Topological interpretations of provability logic
- The closed fragment of the interpretability logic of PRA with a constant for I\(\Sigma^1\)
- Interacting explicit evidence systems
- AXIOMATIZATION OF PROVABLE n-PROVABILITY
- The Henkin sentence
- scientific article; zbMATH DE number 54202 (Why is no real title available?)
- Modal analysis of generalized rosser sentences
- The modal logic of Gödel sentences
- Explicit provability and constructive semantics
- The single-conclusion proof logic and inference rules specification
- Undecidability in diagonalizable algebras
- A note on the diagonalizable algebras of PA and ZF
- On \(\Sigma _ 1\) and \(\Pi _ 1\) sentences and degrees of interpretability
- Inverse images of box formulas in modal logic
- On the Difficulty of Writing Out formal Proofs in Arithmetic
- On the complexity of arithmetical interpretations of modal formulae
- On partial disjunction properties of theories containing Peano arithmetic
- Arithmetic analogues of McAloon's unique Rosser sentences
- Basic Propositional Calculus I
- Collapsing probabilistic hierarchies. I
- The interpretability logic of Peano arithmetic
- Closed Fragments of Provability Logics of Constructive Theories
- A note on the fixed point for the polynomials of a Boolean algebra with an operator of endomorphism
- The \(\Sigma_1\)-provability logic of \(\mathsf{HA}\)
- Rosser orderings and free variables
- Bimodal logics for extensions of arithmetical theories
- Parameter free induction and provably total computable functions
- Rules and arithmetics
- A course on bimodal provability logic
- Definability and commonsense reasoning
- Provability in finite subtheories of PA and relative interpretability: a modal investigation
- scientific article; zbMATH DE number 5029987 (Why is no real title available?)
- On first-order theories with provability operator
- Faith \& falsity
- The logic of arithmetical hierarchy
- Interpretability over peano arithmetic
- The de Jongh property for basic arithmetic
- Fixed points and unfounded chains
- THE MODAL LOGICS OF KRIPKE–FEFERMAN TRUTH
- On non-self-referential fragments of modal logics
- Mathematical modal logic: A view of its evolution
- Substitutions of \(\Sigma_1^0\)-sentences: Explorations between intuitionistic propositional logic and intuitionistic arithmetic
- Montague's paradox, informal provability, and explicit modal logic
- Uniform self-reference
- scientific article; zbMATH DE number 3928959 (Why is no real title available?)
- On the proof of Solovay's theorem
- A remark on equivalent Rosser sentences
- Henkin sentences and local reflection principles for Rosser provability
- Gödel's second incompleteness theorem: how it is derived and what it delivers
- An Arithmetically Complete Predicate Modal Logic
- Model Theoretic Syntax and Parsing
- ON DOUBLE-MEMBERSHIP GRAPHS OF MODELS OF ANTI-FOUNDATION
- Another look at the second incompleteness theorem
- Axiomatizing provable \(n\)-provability
- GETTING BELIEF FUNCTIONS FROM KRIPKE MODELS
- Referential logic of proofs
- An abstract look at the fixed-point theorem for provability logic
- Lewisian fixed points. I: Two incomparable constructions
- Notes on my scientific life
- 1998 European Summer Meeting of the Association for Symbolic Logic
- Paradoxes of interaction?
- European Summer Meeting of the Association for Symbolic Logic (Logic Colloquium '88), Padova, 1988
- Varieties of self-reference in metamathematics
- Lewis meets Brouwer: constructive strict implication
- Paradoxes behind the Solovay sentences
- scientific article; zbMATH DE number 823604 (Why is no real title available?)
- Self-ascription and the \textit{de se}
- NON–WELL-FOUNDED DERIVATIONS IN THE GÖDEL-LÖB PROVABILITY LOGIC
- Effectively constructible fixed points in Sacchetti's modal logics of provability
- Incompleteness and fixed points
- Solutions to the knower paradox in the light of Haack's criteria
- Beyond logical approach to systems theory
- The fixed point and the Craig interpolation properties for sublogics of \textbf{IL}
- Reflection algebras and conservation results for theories of iterated truth
- Generalizations of Gödel's incompleteness theorems for \(\Sigma_n\)-definable theories of arithmetic
This page was built for publication: Self-reference and modal logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1078163)