Self-reference and modal logic
fixed point sentenceGödel sentenceHenkin sentencemodal analysis of fixed pointsmodal provability logicmulti-modal schemesprovability predicateRosser sentencesself-referential sentencessentential self-referencewitness comparisons
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)
Self-reference, as a general concept, is very complex. It penetrates deeply into the nature of language, as does the concept of reference, at least when conceived in general terms not excluding reference also to the fact of referring. By restricting the concept, however, both with respect to reference and to self, sufficient simplicity may be obtained to allow smooth formalization. The book under review is a well written, instructive text on selected aspects of self-reference that lend themselves to a uniform treatment in terms of modal logic. Its uniformity is obtained, first by restricting self-reference to sentential self-reference, where a sentence may refer to certain properties of itself, like in this subsentence contains exactly forty seven letters. The sentence is partially referring to itself through an external act of interpretation. Reference through description, which is also natural and known to generate other types of self-reference, is not considered in the book. Next, a restriction is made to a Gödel-context where the fixed point lemma is obtained: With any formula W x of a formal language, there is a fixed point sentence \(\phi\) of the language such that \(\vdash \phi \equiv W \ulcorner \phi \urcorner\). Here \(\ulcorner \phi \urcorner\) is the Gödel number of the sentence \(\phi\), which thus says of itself that it has the property expressed by W x - however with no assurance that \(\phi\) is provable or true. By way of example, a Henkin sentence h is the first point to Pr x, the provability predicate, and a Gödel sentence g the fixed point to \(\neg \Pr x\). The Gödel sentence g thus says of itself that it is not provable. Gödel showed in 1931, on the basis of certain soundness conditions, that g as well as \(\neg g\) are in fact unprovable (Gödel's first incompleteness theorem; Gödel's second incompleteness theorem concerns the nonprovability in a consistent theory T of the consistency of T). Not until the 1970s, however, did the subject of partial sentential self- reference itself become a subject of mathematical study. From several directions it was then recognized that the proofs of Gödel's theorems and Löb's (about the truth of h) were propositional in character with an additional modal operator for provability, i.e., themselves subject to mathematical study. This is what the book is about, namely to provide a modal analysis of fixed points to Pr x-related properties which lend themselves to such a study. In a modal provability logic, PRL, the modal operator \(\square\) (for provability) is provided with axioms that correspond to the conditions of Löb on Pr x that allow derivation of Gödel's second incompleteness theorem, as well as to the formalized Löb's theorem. As shown by detailed syntactical and semantical studies, PRL suffices for modal analysis of self-referential sentences arising from this particular context. Here, in part I of the book, smooth theory is obtained with extremely well-behaved self-reference: the fixed points are unique; they are explicitly definable; and they have common explicit definitions. Likewise for part II, which is devoted to multi-modal generalizations of the modal analysis in part I. In part III, more involved provability predicates are considered where the fixed points need be neither unique nor explicitly definable. Like for Rosser sentences, which are demonstrably nonprovable and nonrefutable on a weaker soundness, namely consistency, than that behind Gödel's first incompleteness theorem. A Rosser sentence asserts, not its outright unprovability, but rather that its negation must be provable before it is. A modal analysis of Rosser sentences is given by incorporating the ordering of derivations into the modal logic as so called witness comparisons. In the final chapter, witness comparisons are introduced to the multi-modal schemes, whereby a uniform treatment is obtained, covering many basic applications of self- reference in the 1970s. A goal of this final chapter is said to be a shift from the study of self-reference as an object of study towards laying a foundation of self-reference as a tool for application. Surely a well aimed goal (almost of a complementaristic nature) for a well written book. A book that may be recommended not only for metamathematicians, but also for scientists trying to develop languages for studies of language. That is, language (and self-reference) in a more general sense, including not only formal languages, but programming languages and even genetic languages [cf. \textit{R. Solovay}, Explicit Henkin sentences, J. Symb. Logic. 50, 91-93 (1985) for reference to such contexts]. Not that the book, with its strict mathematical nature obtained through fragmentation of self-reference, can allow a self- reference to include reference also to its applicability (a problem with complementaristic resolutions). But it provides the reader with a wealth of well understood specific instances of partial sentential self- reference, that may well come to function as building stones in a developing knowledge of self-reference in a more general sense, also with the partiality of self-reference as an object of study. (Hopefully, later editions will be supplied with an index!)
- 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)