See this document in CiteSeerX!

Long Normal Form Proof Search and Counter-Model Generation (2000)  (Make Corrections)  
Sachio Hirokawa, Daisuke Nagano



  Home/Search   Context   Related

 
View or download:
matu.cc.kyushuu.a...awacade172000.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  matu.cc.kyushuu.ac.jp/e...papers (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: This paper describes an algorithm of proof search for implicational formula in intuitionistic logic. It is based on a natural deduction style formulation of long normal form of simply typed -calculus. The algorithm returns a deduction tree, which becomes a proof if the formula is provable. When the formula is unprovable, a counter-model is constructed by identifying the repeated nodes in the deduction tree. Simplicity of the model construction is due to long normal form. The completeness of the ... (Update)

Similar documents (at the sentence level):
30.2%:   Proof Search and Counter-Model Generation for Intuitionistic Logic - Nagano (1999)   (Correct)

Active bibliography (related documents):   More   All
0.3:   Case Calculus for Classical Logic - Baba, Hirokawa, Kashima, Komori.. (2000)   (Correct)
0.2:   Proof-search in Type-theoretic Languages: An Introduction - Galmiche, Pym (2000)   (Correct)
0.2:   Admissibility of Structural Rules for Contraction-Free.. - Dyckhoff, Negri (2000)   (Correct)

Similar documents based on text:   More   All
0.4:   Semantic Labelled Tableaux for Propositional BI (BI without.. - Galmiche, Méry   (Correct)
0.4:   Expressive Power of Tree and String Based Wrappers - Ikeda, Yamada   (Correct)
0.4:   Proof-search and countermodel generation in propositional BI.. - Galmiche, Méry (2001)   (Correct)

BibTeX entry:   (Update)

@misc{ hirokawa-long,
  author = "Sachio Hirokawa and Daisuke Nagano",
  title = "Long Normal Form Proof Search and Counter-Model Generation",
  url = "citeseer.ist.psu.edu/hirokawa00long.html" }
Citations (may not include all citations):
88   Basic Proof Theory (context) - Troelstra, Schwichtenberg - 1996
60   Contraction-free sequent calculi for intuitionistic logic (context) - Dyckhoff - 1992
19   Loop-free construction of counter-models for intuitionistic .. - Pinto, Dyckhoff - 1995
14   Almqvist and Wiksell (context) - Prawitz, Deduction - 1965
13   Information and Computation (context) - Takahashi, Akama et al. - 1996
7   Porgi: a Proof-Or-Refutation Generator for Intuitionistic pr.. (context) - Stoughton - 1996
6   Intuitionistic Logic (context) - Fitting - 1969
3   The Basic Type Theory (context) - Hindley - 1996
1   Structural sharing and efficient proof-search in proposition.. - Galmiche, Larchey-Wendling - 1999

Documents on the same site (http://matu.cc.kyushu-u.ac.jp/en/papers.html):
Integration of Search Sites of the World Wide Web - Tsuyoshi Taguchi Yasunori (2000)   (Correct)
Developing a Knowledge Network of URLs - Ikeda, Taguchi, Hirokawa (1999)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC