On the proof-theory of two formalisations of modal first-order logic (Q622627): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On modal systems having arithmetical interpretations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4052071 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Modal Extension of Weak Generalisation Predicate Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5812175 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the proof theory of the modal logic for arithmetic provability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4729754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modal sequent calculus for a fragment of arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: The modal logic of provability. The sequential approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4143279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5537599 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4787441 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4812323 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4822147 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The modal logic of provability: cut-elimination / rank
 
Normal rank

Latest revision as of 18:11, 3 July 2024

scientific article
Language Label Description Also known as
English
On the proof-theory of two formalisations of modal first-order logic
scientific article

    Statements

    On the proof-theory of two formalisations of modal first-order logic (English)
    0 references
    0 references
    0 references
    3 February 2011
    0 references
    Tourlakis and Kibedi introduced some modal first-order logics for a modal interpretation of the provability of classical logic. In this paper, a Gentzen-style sequential calculus is provided for them, and shown to enjoy the cut-elimination property. The modal logics, which have been given in a Hilbert-style axiomatization, are shown to be translatable into the Gentzen system (repspectively in different ways), so that the results obtained model-theoretically in the former works are reconstructed by proof-theoretical means. It is also proved that the form of ``weak reflection'', one of the results thus obtained, is as strong as possible.
    0 references
    0 references
    modal first-order logic
    0 references
    sequent calculus
    0 references
    cut-elimination
    0 references
    reflection theorem
    0 references
    modal interpretation of provability
    0 references

    Identifiers