Modal logics with several operators and probability interpretations (Q579232): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / reviewed by
 
Property / reviewed by: Q593409 / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Sergej N. Artemov / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: One hundred and two problems in mathematical logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of a problem of Leon Henkin / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5537599 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Provability interpretations of modal logic / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:04, 18 June 2024

scientific article
Language Label Description Also known as
English
Modal logics with several operators and probability interpretations
scientific article

    Statements

    Modal logics with several operators and probability interpretations (English)
    0 references
    0 references
    1986
    0 references
    The purpose of the paper is to study modal logics of provability in a sequence of extentions of Peano Arithmetic PA. The main result describes n-modal logics of provability in theories \(T_ 1,...,T_ n\) which contain PA and satisfy the following condition: \(T_ i\) contains \(Refl(T_ j)\) if \(i<j\) (Refl(T) is the schema of sentences of the form \(\Pr_ T(\ulcorner \phi \urcorner)\to \phi)\). These logics are proved to be decidable. Thus the paper proves the generalization of Smorynski's conjecture about decidability of the set of valid bimodal formulas with \(T_ 1=PA\) and \(T_ 2=ZF\). The appropriate Kripke-style semantics is developed. The paper contains an application: there is a Boolean combination of \(\Sigma_ 1\) formulas \(\phi\) such that \(PA+Con(PA)\vdash Con(PA+\phi)\) and \(PA+Con(PA)\vdash Con(PA+\neg \phi)\) while \(ZF\vdash Con(PA+Con(PA)+\phi)\) and \(ZF\vdash Con(PA+Con(PA)+\neg \phi)\).
    0 references
    sequence of extentions of Peano Arithmetic
    0 references
    n-modal logics of provability
    0 references
    decidability
    0 references
    Kripke-style semantics
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references