A Formalisation of Weak Normalisation (with Respect to Permutations) of Sequent Calculus Proofs (Q4506460): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Automath / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Nuprl / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5610986 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contraction-free sequent calculi for intuitionistic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination of permutative conversions in intuitionistic Gentzen calculi / rank
 
Normal rank
Property / cites work
 
Property / cites work: On proof normalization in linear logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4264727 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutability of proofs in intuitionistic sequent calculi / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4716271 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cut-elimination and a permutation-free sequent calculus for intuitionistic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rippling: A heuristic for guiding inductive proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3817590 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Residual theory in λ-calculus: a formal development / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metamathematics, Machines and Gödel's Proof / rank
 
Normal rank

Latest revision as of 14:04, 30 May 2024

scientific article; zbMATH DE number 1509481
Language Label Description Also known as
English
A Formalisation of Weak Normalisation (with Respect to Permutations) of Sequent Calculus Proofs
scientific article; zbMATH DE number 1509481

    Statements

    A Formalisation of Weak Normalisation (with Respect to Permutations) of Sequent Calculus Proofs (English)
    0 references
    0 references
    25 September 2000
    0 references
    0 references
    cut-free intuitionistic sequent calculus
    0 references
    weak normalisation
    0 references
    implicational fragment of intuitionistic logic
    0 references
    0 references
    0 references
    0 references