Self-reference and modal logic

MaRDI QIDQ1078163zbMATH OpenFDO

Authors Craig Smoryński

Publication date 1985

Published in Universitext (Search for Journal in Brave)

zbMATH Keywords

fixed point sentenceGödel sentenceHenkin sentencemodal analysis of fixed pointsmodal provability logicmulti-modal schemesprovability predicateRosser sentencesself-referential sentencessentential self-referencewitness comparisons

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Philosophical and critical aspects of logic and foundations (03A05) Foundations of classical theories (including reverse mathematics) (03B30) Modal logic (including the logic of norms) (03B45)

Recommendations

• scientific article; zbMATH DE number 3928959
• Self-reference in arithmetic. I
• Self-reference in arithmetic. II
• scientific article; zbMATH DE number 664031
• Generic generalized Rosser fixed points

Cited in

(only showing first 100 items - show all)

• Languages with self-reference. I: Foundations (or: We can have everything in first-order logic!)
• Uniform self-reference
• Languages with self-reference. II: Knowledge, belief, and modality
• Arithmetic analogues of McAloon's unique Rosser sentences
• On the proof of Solovay's theorem
• Rosser orderings and free variables
• A note on the fixed point for the polynomials of a Boolean algebra with an operator of endomorphism
• Multilanguage hierarchical logics, or: How we can do without modal logics
• The logic of arithmetical hierarchy
• Logic of proofs
• On bimodal logics of provability
• Definability and commonsense reasoning
• The fixed point property in modal logic
• Mathematical modal logic: A view of its evolution
• The decision problem of provability logic with only one atom
• Lewis meets Brouwer: constructive strict implication
• Axiomatizing provable \(n\)-provability
• On partial disjunction properties of theories containing Peano arithmetic
• The knower paradox in the light of provability interpretations of modal logic
• A course on bimodal provability logic
• A set-theoretic translation method for polymodal logics
• Parameter free induction and provably total computable functions
• Distilling the requirements of Gödel's incompleteness theorems with a proof assistant
• Self-ascription and the \textit{de se}
• Not all Kripke models of \(\mathsf{HA}\) are locally \(\mathsf{PA}\)
• Reflection algebras and conservation results for theories of iterated truth
• Effectively constructible fixed points in Sacchetti's modal logics of provability
• Friedman-reflexivity
• Rosser provability and normal modal logics
• The scope of Gödel's first incompleteness theorem
• The arithmetics of a theory
• Montague's paradox, informal provability, and explicit modal logic
• A remark on equivalent Rosser sentences
• A quantified logic of evidence
• Referential logic of proofs
• Paradoxes of interaction?
• The closed fragment of the interpretability logic of PRA with a constant for I\(\Sigma^1\)
• Hard provability logics
• Explicit provability and constructive semantics
• Incompleteness and fixed points
• Modal analysis of generalized rosser sentences
• Sentences implying their own provability
• NON–WELL-FOUNDED DERIVATIONS IN THE GÖDEL-LÖB PROVABILITY LOGIC
• The Henkin sentence
• Infinitary combinatorics and modal logic
• European Summer Meeting of the Association for Symbolic Logic (Logic Colloquium '88), Padova, 1988
• Closed Fragments of Provability Logics of Constructive Theories
• scientific article; zbMATH DE number 3928959 (Why is no real title available?)
• Provability in finite subtheories of PA and relative interpretability: a modal investigation
• Large discrete parts of the E-tree
• Inverse images of box formulas in modal logic
• Collapsing probabilistic hierarchies. I
• The paradox of the knower revisited
• scientific article; zbMATH DE number 54202 (Why is no real title available?)
• Basic Propositional Calculus I
• 1998 European Summer Meeting of the Association for Symbolic Logic
• scientific article; zbMATH DE number 664031 (Why is no real title available?)
• A small reflection principle for bounded arithmetic
• On first-order theories with provability operator
• Undecidability in diagonalizable algebras
• On the Difficulty of Writing Out formal Proofs in Arithmetic
• Generalizations of Gödel's incompleteness theorems for \(\Sigma_n\)-definable theories of arithmetic
• Reflection of formal tactics in a deductive reflection framework
• The de Jongh property for basic arithmetic
• European Summer Meeting of the Association for Symbolic Logic
• scientific article; zbMATH DE number 823604 (Why is no real title available?)
• GETTING BELIEF FUNCTIONS FROM KRIPKE MODELS
• Bimodal logics for extensions of arithmetical theories
• Arithmetical interpretations and Kripke frames of predicate modal logic of provability
• Model Theoretic Syntax and Parsing
• Interpretability over peano arithmetic
• Gödel's second incompleteness theorem: how it is derived and what it delivers
• THE MODAL LOGICS OF KRIPKE–FEFERMAN TRUTH
• Hierarchical incompleteness results for arithmetically definable extensions of fragments of arithmetic
• Beyond logical approach to systems theory
• On non-self-referential fragments of modal logics
• scientific article; zbMATH DE number 7577569 (Why is no real title available?)
• Another look at the second incompleteness theorem
• INCOMPLETENESS VIA PARADOX AND COMPLETENESS
• Self-reference in arithmetic. I
• Self-reference in arithmetic. II
• The interpretability logic of Peano arithmetic
• AXIOMATIZATION OF PROVABLE n-PROVABILITY
• Topological interpretations of provability logic
• Reflection calculus and conservativity spectra
• scientific article; zbMATH DE number 5029987 (Why is no real title available?)
• Reflecting in epistemic arithmetic
• Marginalia on a theorem of Woodin
• A note on derivability conditions
• ON DOUBLE-MEMBERSHIP GRAPHS OF MODELS OF ANTI-FOUNDATION
• Strictly primitive recursive realizability. II: Completeness with respect to iterated reflection and a primitive recursive -rule
• Rules and arithmetics
• Fixed points and unfounded chains
• Substitutions of \(\Sigma_1^0\)-sentences: Explorations between intuitionistic propositional logic and intuitionistic arithmetic
• The single-conclusion proof logic and inference rules specification
• Logic of proofs and provability
• The modal logic of Gödel sentences
• An Arithmetically Complete Predicate Modal Logic
• ON SHAVRUKOV’S NON-ISOMORPHISM THEOREM FOR DIAGONALIZABLE ALGEBRAS
• Dynamic Cantor Derivative Logic

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)