A formally verified cut-elimination procedure for linear nested sequents for tense logic (Q2142082): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Haskell / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-030-86059-2_17 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3198628855 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Display logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formalized meta-theory of sequent calculi for linear logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine-Checked Interpolation Theorems for Substructural Logics Using Display Calculi / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Display Calculi to Deep Nested Sequent Calculi: Formalised for Full Intuitionistic Linear Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4484337 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generic Methods for Formalising Sequent Calculi Applied to Provability Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753601 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Syntactic cut-elimination and backward proof-search for tense logic via linear nested sequents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cut-free sequent calculi for some tense logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive decision via redundancy-free proof-search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A formal framework for specifying sequent calculus proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof analysis in modal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fresh view of linear logic as a logical framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural Focalization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formalizing Cut Elimination of Coalgebraic Logics in Coq / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4716271 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revisiting Cut-Elimination: One Difficult Proof Is Really a Proof / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mechanizing focused linear logic in Coq / rank
 
Normal rank

Latest revision as of 02:24, 29 July 2024

scientific article
Language Label Description Also known as
English
A formally verified cut-elimination procedure for linear nested sequents for tense logic
scientific article

    Statements

    A formally verified cut-elimination procedure for linear nested sequents for tense logic (English)
    0 references
    0 references
    0 references
    0 references
    25 May 2022
    0 references
    formalised proof theory
    0 references
    cut-elimination
    0 references
    linear nested sequent calculus
    0 references
    tense logic
    0 references
    Coq
    0 references
    extraction
    0 references
    program synthesis
    0 references
    0 references
    0 references
    0 references

    Identifiers