Proof Search Analysis in Sequent Calculus for Intuitionistic Logic

Please enable javascript in your browser.

Raeisi Mobarakeh, Zahra | 2009

296 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 40028 (02)
University: Sharif University of Technology
Department: Mathematical Sciences
Advisor(s): Ardeshir, Mohammad
Abstract:
In this thesis the sequent calculi for intuitionistic logic have been studied and compared with these calculi in classical logic, moreover soundness and completeness theorems for these calculi have been proved. Also an algorithmic method is presented to construct the proof-search with this feature that proof-search terminates and the subformula property preserved. In particular the analysis and comparison of two calculi IG and SIC provided by Tassi and Corsi have been done. Finally, we consider the calculus SJC, stack-based Jankov calculus which is similar to SIC and describes proof-search procedure for weak excluded middle logic. If the proof-search is successful in each calculus SIC or SJC, it can be constructed a Gentzen-style proof; otherwise it can be transformed into the countermodel for non-theorem A.
Keywords:
Intuitionistic Logic ; Sequent Calculus ; Hypersequent Calculus ; Stack-Based Intuitionistic Calculus ; Weak Excluded Middle Logic

No TOC