• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to previous page

A Study of Substractural Logics

Research Project

Project/Area Number 10640103
Research Category

Grant-in-Aid for Scientific Research (C)

Allocation TypeSingle-year Grants
Section一般
Research Field General mathematics (including Probability theory/Statistical mathematics)
Research InstitutionChiba University

Principal Investigator

KOMORI Yuichi  Chiba University, Faculty of Science, Professor, 理学部, 教授 (10022302)

Co-Investigator(Kenkyū-buntansha) KANAZAWA Makoto  Chiba University, Faculty of Science, Assistant Professor, 文学部, 助教授 (20261886)
YAMAMOTO Mitsuharu  Chiba University, Faculty of Science, Research Associate, 理学部, 助手 (00291295)
SAKURAI Takafumi  Chiba University, Faculty of Science, Assistant Professor, 理学部, 助教授 (60183373)
FUJITA Ken-etsu  Kyusyu University, Faculty of Informatic Technology, Lecturer, 情報工学部, 講師 (30228994)
HIROKAWA Sachiko  Kyusyu University, Computer Center, Professor, 大型計算センター, 教授 (40126785)
Project Period (FY) 1998 – 1999
Project Status Completed (Fiscal Year 1999)
Budget Amount *help
¥3,800,000 (Direct Cost: ¥3,800,000)
Fiscal Year 1999: ¥1,600,000 (Direct Cost: ¥1,600,000)
Fiscal Year 1998: ¥2,200,000 (Direct Cost: ¥2,200,000)
KeywordsSubstructural Logic / Classical Logic / Intuitionistic Logic / BCK Logic / Lambda Calculus / Type Theory
Research Abstract

1. Recently lambda calculus unites studies of substructural logics, the intutionistic logic and the classical logic. In this context, Kashima has posed a Natural deduction system for the classical implicational logic. His system has three rules, the elimination of the implication, the introduction of the implication and the case rule. Komori has noticed that the introduction of the implication is derivable from the case rule and the weakening. So we have gotten the system TAμ from Kashima's system by replacing the introduction of implication by the weakening. While the type assignment system TAλgives a natural deduction for implicational intuitionistic logic, the type assignment system TAμgives a natural deduction for classical implicational logic. Moreover for any classical implicational theorem α there exists a proof of α in TAμ enjoying the subformula property. Still more λ-calculus can be simulated in μ-calculus.
2. A new system of calculus comes out of the above result. We are investigating the meaning of the new calculus.
3. Fujita has actively studied on multiple-conclusion natural deduction system and λμ-calculus, and then has written many papers.
4. The problem on the decidablity of BB'IW logic in one of the most difficult mathematical problem. We are wrestling with the problem.
5. Kanazawa has investigated Categorial Grammars and has gotten excellent results.
6. Sakurai has investigated Categorical model of lambda-calculus and has written two good papers.

Report

(3 results)
  • 1999 Annual Research Report   Final Research Report Summary
  • 1998 Annual Research Report
  • Research Products

    (24 results)

All Other

All Publications (24 results)

  • [Publications] 廣川佐千男: "A lambda proof of the P-W theorem"The Journal of Symbolic Logic. (発表予定).

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1999 Final Research Report Summary
  • [Publications] 桜井貴文: "Categorical Model Construction for Proving Syntactic Properties"International J. F. Computer Science. (発表予定).

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1999 Final Research Report Summary
  • [Publications] 金沢誠: "Lambek calculus : Recognizing power and complexity"Essays Dedicated to Johan van Benthem. (1999)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1999 Final Research Report Summary
  • [Publications] 藤田憲悦: "Explicitly Typed λμ-Calculus for Polymorphism and Call-by-Value"TLCA '99, LNCS 1581. 162-176 (1999)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1999 Final Research Report Summary
  • [Publications] 藤田憲悦: "Multiple-Conclusion System as Communication Calculus"Electronic Notes in Theoretical Computer Science. 31・1. 167-182 (2000)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1999 Final Research Report Summary
  • [Publications] Keiichi Mishima: "GUI for Geometric Inference Engine on Internet"Proceedings of Webnet'99. 1360-1361 (1999)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1999 Final Research Report Summary
  • [Publications] Sachio Hirokawa: "A laambda proof of the P-W theorem"The Journal of Symbolic Logic. (To appear).

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      1999 Final Research Report Summary
  • [Publications] Takafumi Sakurai: "Categorical Model Construction for Proving Syntactic Properties"Int. Journal of Foundations of Computer Science. (To appear).

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      1999 Final Research Report Summary
  • [Publications] Makoto Kanazawa, Lambek calculus: "Recognizing power and complexity"In Essays Dedicaed to Johan van Benthem on the Occasion of his 50th Birthday (cf. http://turning.wins.uva.nl/j50/cdrom/). (1999)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      1999 Final Research Report Summary
  • [Publications] Ken-etsu Fujita: "Explicitly Typedλμ-Calculus for Polymorphism and Call-by-Value"Typed Lambda Calculi and Applications (TLCA '99), LNCS1581. 162-176 (1999)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      1999 Final Research Report Summary
  • [Publications] Ken-etsu Fujita: "Multiple-Conclusion System as Communication Calculus"Electronic Notes in Theoretical Computer Science (Elsevier Science). 31. 167-182 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      1999 Final Research Report Summary
  • [Publications] Keiichi Mishima: "GUI for Geometric Inference Engine on Internet"Proceedings of Webnet '99. 187-206 (1999)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      1999 Final Research Report Summary
  • [Publications] 廣川,古森,永山: "A lambda proof of the P-W theorem"The Journal of Symbolic Logic. (発表予定).

    • Related Report
      1999 Annual Research Report
  • [Publications] 桜井 貴文: "Categorical Model Construction for Proving Syntactic Properties"International J. F. Computer Science. (発表予定).

    • Related Report
      1999 Annual Research Report
  • [Publications] 金沢 誠: "Lambak calculus: Recognizing power and complexity"Essays Dedicated to Johan van Benthem. (1999)

    • Related Report
      1999 Annual Research Report
  • [Publications] 藤田 憲悦: "Explicitly Typed λμ-Calculus for Polymorphism and Call-by-Value"TLCA '99, LNCS 1581. 162-176 (1999)

    • Related Report
      1999 Annual Research Report
  • [Publications] 藤田 憲悦: "Multiple-Conclusion System as Communication Calculus"Electronic Notes in Theoretical Computer Science. 31・1. 167-182 (2000)

    • Related Report
      1999 Annual Research Report
  • [Publications] Mishima, Kato, Hirokawa: "GUI for Geometric Inference Engine on Internet"Proceedings of Webnet'99. 1360-1361 (1999)

    • Related Report
      1999 Annual Research Report
  • [Publications] 桜井 貴文: "Categorical Model Construction for Proving Syntactic Properties" Proceedings of Third Fuji International Symposium. 187-206 (1998)

    • Related Report
      1998 Annual Research Report
  • [Publications] 山本 光晴: "Formalization of Graph Search Algorithms and Its Applications" Lecture Notes in Computer Science. 1479. 479-496 (1998)

    • Related Report
      1998 Annual Research Report
  • [Publications] 廣川 佐千男: "Infiniteness of proof(α)is polynomial-space complete" Theoretical Computer Science. 206. 331-339 (1998)

    • Related Report
      1998 Annual Research Report
  • [Publications] 藤田 憲悦: "On Proof Terms and Embeddings of Classical Substructural Logics" Studia Logica. 61・2. 199-221 (1998)

    • Related Report
      1998 Annual Research Report
  • [Publications] 藤田 憲悦: "Calculus of Classical Proofs II" Transactions of Information Processing Society of Japan. 39・12. 3269-3281 (1998)

    • Related Report
      1998 Annual Research Report
  • [Publications] 藤田 憲悦: "Polymorphic Call-by-Value Calculus based on Classical Proofs" Lecture Notes in Artificial Intelligence. 1476. 170-182 (1998)

    • Related Report
      1998 Annual Research Report

URL: 

Published: 1998-04-01   Modified: 2016-04-21  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi