### 抄録

The logical system P-W is an implicational non-commutative intuitionistic logic defined by axiom schemes B = (b → c) → (a → b) → a → c. B′ = (a → b) → (b → c) → a → c. I = a → a with the rules of modus ponens and substitution. The P-W problem is a problem asking whether α = β holds if α → β and β → α are both provable in P-W. The answer is affirmative. The first to prove this was E. P. Martin by a semantical method. In this paper, we give the first proof of Martin's theorem based on the theory of simply typed λ-calculus. This proof is obtained as a corollary to the main theorem of this paper, shown without using Martin's Theorem, that any closed hereditary right-maximal linear (HRML) λ-term of type α → α is βη-reducible to λx.x. Here the HRML λ-terms correspond, via the Curry-Howard isomorphism, to the P-W proofs in natural deduction style.

元の言語 | 英語 |
---|---|

ページ（範囲） | 1841-1849 |

ページ数 | 9 |

ジャーナル | Journal of Symbolic Logic |

巻 | 65 |

発行部数 | 4 |

DOI | |

出版物ステータス | 出版済み - 1 1 2000 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Philosophy
- Logic

### これを引用

*Journal of Symbolic Logic*,

*65*(4), 1841-1849. https://doi.org/10.2307/2695080

**A lambda proof of the P-W theorem.** / Hirokawa, Sachio; Komori, Yuichi; Nagayama, Misao.

研究成果: ジャーナルへの寄稿 › 記事

*Journal of Symbolic Logic*, 巻. 65, 番号 4, pp. 1841-1849. https://doi.org/10.2307/2695080

}

TY - JOUR

T1 - A lambda proof of the P-W theorem

AU - Hirokawa, Sachio

AU - Komori, Yuichi

AU - Nagayama, Misao

PY - 2000/1/1

Y1 - 2000/1/1

N2 - The logical system P-W is an implicational non-commutative intuitionistic logic defined by axiom schemes B = (b → c) → (a → b) → a → c. B′ = (a → b) → (b → c) → a → c. I = a → a with the rules of modus ponens and substitution. The P-W problem is a problem asking whether α = β holds if α → β and β → α are both provable in P-W. The answer is affirmative. The first to prove this was E. P. Martin by a semantical method. In this paper, we give the first proof of Martin's theorem based on the theory of simply typed λ-calculus. This proof is obtained as a corollary to the main theorem of this paper, shown without using Martin's Theorem, that any closed hereditary right-maximal linear (HRML) λ-term of type α → α is βη-reducible to λx.x. Here the HRML λ-terms correspond, via the Curry-Howard isomorphism, to the P-W proofs in natural deduction style.

AB - The logical system P-W is an implicational non-commutative intuitionistic logic defined by axiom schemes B = (b → c) → (a → b) → a → c. B′ = (a → b) → (b → c) → a → c. I = a → a with the rules of modus ponens and substitution. The P-W problem is a problem asking whether α = β holds if α → β and β → α are both provable in P-W. The answer is affirmative. The first to prove this was E. P. Martin by a semantical method. In this paper, we give the first proof of Martin's theorem based on the theory of simply typed λ-calculus. This proof is obtained as a corollary to the main theorem of this paper, shown without using Martin's Theorem, that any closed hereditary right-maximal linear (HRML) λ-term of type α → α is βη-reducible to λx.x. Here the HRML λ-terms correspond, via the Curry-Howard isomorphism, to the P-W proofs in natural deduction style.

UR - http://www.scopus.com/inward/record.url?scp=0034561959&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0034561959&partnerID=8YFLogxK

U2 - 10.2307/2695080

DO - 10.2307/2695080

M3 - Article

AN - SCOPUS:0034561959

VL - 65

SP - 1841

EP - 1849

JO - Journal of Symbolic Logic

JF - Journal of Symbolic Logic

SN - 0022-4812

IS - 4

ER -