• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Methods of Cut-Elimination

Methods of Cut-Elimination

Paperback

Series: Trends in Logic, Book 34

FictionGeneral ComputersProgramming

ISBN10: 9400734972
ISBN13: 9789400734975
Publisher: Springer
Published: Feb 25 2013
Pages: 290
Weight: 0.92
Height: 0.62 Width: 6.14 Depth: 9.21
Language: English

This is the first book on cut-elimination in first-order predicate logic from an algorithmic point of view. Instead of just proving the existence of cut-free proofs, it focuses on the algorithmic methods transforming proofs with arbitrary cuts to proofs with only atomic cuts (atomic cut normal forms, so-called ACNFs). The first part investigates traditional reductive methods from the point of view of proof rewriting. Within this general framework, generalizations of Gentzen's and Sch\utte-Tait's cut-elimination methods are defined and shown terminating with ACNFs of the original proof. Moreover, a complexity theoretic comparison of Gentzen's and Tait's methods is given.

1 different editions

Also available

Also in

Fiction