The provability logics of recursively enumerable theories extending Peano arithmetic at arbitrary theories extending Peano arithmetic (Q1068069): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4196401 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremely undecidable sentences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3852250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relatively precomplete numerations and arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calculating self-referential statements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Provability interpretations of modal logic / rank
 
Normal rank

Latest revision as of 19:47, 14 June 2024

scientific article
Language Label Description Also known as
English
The provability logics of recursively enumerable theories extending Peano arithmetic at arbitrary theories extending Peano arithmetic
scientific article

    Statements

    The provability logics of recursively enumerable theories extending Peano arithmetic at arbitrary theories extending Peano arithmetic (English)
    0 references
    0 references
    0 references
    1984
    0 references
    We fully characterize the provability logics of RE theories T extending PA at PA and at T. We show that ''nearly all'' provability logics of RE theories T extending PA at arbitrary U extending PA are between Löb's logic L and Solovay's logic S. At the end of the paper we take a brief look at what goes on between L and S. We give examples of new phenomena there.
    0 references
    0 references
    Löb's logic
    0 references
    Solovay's logic
    0 references