Self-reference and modal logic

From MaRDI portal
Publication:1078163

zbMath0596.03001MaRDI QIDQ1078163

Craig Smorynski

Publication date: 1985

Published in: Universitext (Search for Journal in Brave)




Related Items (99)

Logic of proofsReflection algebras and conservation results for theories of iterated truthON DOUBLE-MEMBERSHIP GRAPHS OF MODELS OF ANTI-FOUNDATION1998 European Summer Meeting of the Association for Symbolic LogicOn bimodal logics of provabilityEffectively constructible fixed points in Sacchetti's modal logics of provabilityBeyond Logical Approach to Systems TheoryEuropean Summer Meeting of the Association for Symbolic LogicA course on bimodal provability logicThe Henkin SentenceLanguages with self-reference. II: Knowledge, belief, and modalityA set-theoretic translation method for polymodal logicsFriedman-reflexivityArithmetic analogues of McAloon's unique Rosser sentencesInfinitary combinatorics and modal logicHard provability logicsEuropean Summer Meeting of the Association for Symbolic Logic (Logic Colloquium '88), Padova, 1988Inverse images of box formulas in modal logicCollapsing probabilistic hierarchies. IProvability in finite subtheories of PA and relative interpretability: a modal investigationThe paradox of the knower revisitedA small reflection principle for bounded arithmeticRosser provability and normal modal logicsAn Arithmetically Complete Predicate Modal LogicHenkin sentences and local reflection principles for Rosser provabilityLewis meets Brouwer: constructive strict implicationANOTHER LOOK AT THE SECOND INCOMPLETENESS THEOREMUnnamed ItemOn first-order theories with provability operatorON SHAVRUKOV’S NON-ISOMORPHISM THEOREM FOR DIAGONALIZABLE ALGEBRASDynamic Cantor Derivative LogicDefinability and commonsense reasoningVarieties of self-reference in metamathematicsSolutions to the knower paradox in the light of Haack's criteriaGENERALIZATIONS OF GÖDEL’S INCOMPLETENESS THEOREMS FOR ∑n-DEFINABLE THEORIES OF ARITHMETICThe fixed point and the Craig interpolation properties for sublogics of \textbf{IL}The fixed point property in modal logicINCOMPLETENESS VIA PARADOX AND COMPLETENESSUndecidability in diagonalizable algebrasGETTING BELIEF FUNCTIONS FROM KRIPKE MODELSReflection calculus and conservativity spectraMathematical modal logic: A view of its evolutionParameter free induction and provably total computable functionsBimodal logics for extensions of arithmetical theoriesThe decision problem of provability logic with only one atomReflecting in epistemic arithmeticOn the Difficulty of Writing Out formal Proofs in ArithmeticInteracting explicit evidence systemsMontague's paradox, informal provability, and explicit modal logicOn the proof of Solovay's theoremRosser orderings and free variablesLarge discrete parts of the E-treeThe de Jongh property for basic arithmeticAxiomatizing provable \(n\)-provabilityExplicit Provability and Constructive SemanticsA remark on equivalent Rosser sentencesReflection of formal tactics in a deductive reflection frameworkA note on the diagonalizable algebras of PA and ZFOn \(\Sigma _ 1\) and \(\Pi _ 1\) sentences and degrees of interpretabilityOn the complexity of arithmetical interpretations of modal formulaeOn partial disjunction properties of theories containing Peano arithmeticA quantified logic of evidenceARITHMETICAL INTERPRETATIONS AND KRIPKE FRAMES OF PREDICATE MODAL LOGIC OF PROVABILITYThe scope of Gödel's first incompleteness theoremMARGINALIA ON A THEOREM OF WOODINModel Theoretic Syntax and ParsingSELF-REFERENCE IN ARITHMETIC IStrictly primitive recursive realizability. II: Completeness with respect to iterated reflection and a primitive recursive \(\omega\)-ruleRules and arithmeticsFixed points and unfounded chainsFaith \& falsityThe knower paradox in the light of provability interpretations of modal logicReferential logic of proofsSelf-referential justifications in epistemic logicThe \(\Sigma_1\)-provability logic of \(\mathsf{HA}\)Interpretability over peano arithmeticSubstitutions of \(\Sigma_1^0\)-sentences: Explorations between intuitionistic propositional logic and intuitionistic arithmeticThe single-conclusion proof logic and inference rules specificationLogic of proofs and provabilityThe interpretability logic of Peano arithmeticUnnamed ItemClosed Fragments of Provability Logics of Constructive TheoriesParadoxes of interaction?Distilling the requirements of Gödel's incompleteness theorems with a proof assistantThe logic of \(\Pi_ 1\)-conservativityAXIOMATIZATION OF PROVABLE n-PROVABILITYNON–WELL-FOUNDED DERIVATIONS IN THE GÖDEL-LÖB PROVABILITY LOGICGÖDEL’S SECOND INCOMPLETENESS THEOREM: HOW IT IS DERIVED AND WHAT IT DELIVERSNot all Kripke models of \(\mathsf{HA}\) are locally \(\mathsf{PA}\)Basic Propositional Calculus IThe closed fragment of the interpretability logic of PRA with a constant for I\(\Sigma^1\)THE MODAL LOGICS OF KRIPKE–FEFERMAN TRUTHA note on the fixed point for the polynomials of a Boolean algebra with an operator of endomorphismA NOTE ON DERIVABILITY CONDITIONSTopological Interpretations of Provability LogicThe arithmetics of a theoryMultilanguage hierarchical logics, or: How we can do without modal logicsThe logic of arithmetical hierarchyHIERARCHICAL INCOMPLETENESS RESULTS FOR ARITHMETICALLY DEFINABLE EXTENSIONS OF FRAGMENTS OF ARITHMETIC




This page was built for publication: Self-reference and modal logic