Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A proof-search procedure for intuitionistic propositional logic

A proof-search procedure for intuitionistic propositional logic A sequent root-first proof-search procedure for intuitionistic propositional logic is presented. The procedure is obtained from modified intuitionistic multi-succedent and classical sequent calculi, making use of Glivenko’s Theorem. We prove that a sequent is derivable in a standard intuitionistic multi-succedent calculus if and only if the corresponding prefixed-sequent is derivable in the procedure. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Archive for Mathematical Logic Springer Journals

A proof-search procedure for intuitionistic propositional logic

Archive for Mathematical Logic , Volume 52 (8) – May 28, 2013

Loading next page...
 
/lp/springer-journals/a-proof-search-procedure-for-intuitionistic-propositional-logic-TBjH5Gtnbr

References (14)

Publisher
Springer Journals
Copyright
Copyright © 2013 by Springer-Verlag Berlin Heidelberg
Subject
Mathematics; Mathematical Logic and Foundations; Mathematics, general; Algebra
ISSN
0933-5846
eISSN
1432-0665
DOI
10.1007/s00153-013-0342-y
Publisher site
See Article on Publisher Site

Abstract

A sequent root-first proof-search procedure for intuitionistic propositional logic is presented. The procedure is obtained from modified intuitionistic multi-succedent and classical sequent calculi, making use of Glivenko’s Theorem. We prove that a sequent is derivable in a standard intuitionistic multi-succedent calculus if and only if the corresponding prefixed-sequent is derivable in the procedure.

Journal

Archive for Mathematical LogicSpringer Journals

Published: May 28, 2013

There are no references for this article.