Switch to: References

Add citations

You must login to add citations.
  1. Reduction of finite and infinite derivations.G. Mints - 2000 - Annals of Pure and Applied Logic 104 (1-3):167-188.
    We present a general schema of easy normalization proofs for finite systems S like first-order arithmetic or subsystems of analysis, which have good infinitary counterparts S ∞ . We consider a new system S ∞ + with essentially the same rules as S ∞ but different derivable objects: a derivation d∈S ∞ + of a sequent Γ contains a derivation Φ∈S of Γ . Three simple conditions on Φ including a normal form theorem for S ∞ + easily imply a (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Natural deduction with general elimination rules.Jan von Plato - 2001 - Archive for Mathematical Logic 40 (7):541-567.
    The structure of derivations in natural deduction is analyzed through isomorphism with a suitable sequent calculus, with twelve hidden convertibilities revealed in usual natural deduction. A general formulation of conjunction and implication elimination rules is given, analogous to disjunction elimination. Normalization through permutative conversions now applies in all cases. Derivations in normal form have all major premisses of elimination rules as assumptions. Conversion in any order terminates.Through the condition that in a cut-free derivation of the sequent Γ⇒C, no inactive weakening (...)
    Download  
     
    Export citation  
     
    Bookmark   55 citations  
  • Cut-eliminability in Second Order Logic Calculus.Toshiyasu Arai - 2018 - Annals of the Japan Association for Philosophy of Science 27:45-60.
    Download  
     
    Export citation  
     
    Bookmark