One platform for all researcher needs
AI-powered academic writing assistant
Your #1 AI companion for literature search
AI tool for graphics, illustrations, and artwork
Unlock unlimited use of all AI tools with the Editage Plus membership.
Explore Editage Plus
Audio Papers
Ask R Discovery
Translation
Auto-sync
Collaboration
https://doi.org/10.1007/978-0-85729-121-9_6
Copy DOI
Export
Save
Share
Cite Publication Date: Jan 1, 2011 |
AbstractThe semi-decidability of provability leads to the design of proof search algorithms. This chapter first introduces the sequent calculus, gives a proof of the cut elimination theorem and discusses proof search in the cut free sequent calculus.
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
