Rosser and Mostowski sentences (Q1263586): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01620761 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2028855113 / rank
 
Normal rank

Latest revision as of 08:57, 30 July 2024

scientific article
Language Label Description Also known as
English
Rosser and Mostowski sentences
scientific article

    Statements

    Rosser and Mostowski sentences (English)
    0 references
    0 references
    0 references
    1988
    0 references
    The authors provide a modal framework for the study of Rosser and Mostowski sentences of Peano Arithmetic. The properties of the operator called witness comparison, with which Rosser sentences can be discussed, have been analysed in a modal system by \textit{D. Guaspari} and \textit{R. M. Solovay} [Ann. Math. Logic 16, 81-99 (1979; Zbl 0426.03062)]. In the system, however, it has been shown that there are no fixed points for Rosser formulae. Several extensions of the system, therefore, are defined in this paper by adding new constants to fill the role of the fixed points so that not only Rosser sentences but also Mostowski sentences are discussed uniformly in a more complete modal setting. The main result is a lemma called intersection lemma, from which immediately follow the formalized Rosser theorem, the Friedman-Goldfarb-Harrington's principle, and so on. The arithmetical completeness and semantical completeness by Kripke models for the systems are also proved.
    0 references
    modal provability operators
    0 references
    Mostowski sentences
    0 references
    Peano Arithmetic
    0 references
    witness comparison
    0 references
    Rosser sentences
    0 references
    arithmetical completeness
    0 references
    semantical completeness
    0 references
    0 references

    Identifiers