• PhilPapers
  • PhilPeople
  • PhilArchive
  • PhilEvents
  • PhilJobs
  • Sign in
PhilPeople
 
  • Sign in
  • News Feed
  • Find Philosophers
  • Departments
  • Radar
  • Help
 
profile-cover
Drag to reposition
profile picture

Mitsuhiro Okada

  •  Home
  •  Publications
    35
    • Most Recent
    • Most Downloaded
    • Topics
  •  Events
    1
  •  News and Updates
    19

 More details
  • All publications (35)
  •  158
    A new correctness criterion for the proof nets of non-commutative multiplicative linear logics
    with Misao Nagayama
    Journal of Symbolic Logic 66 (4): 1524-1542. 2001.
    This paper presents a new correctness criterion for marked Danos-Reginer graphs (D-R graphs, for short) of Multiplicative Cyclic Linear Logic MCLL and Abrusci's non-commutative Linear Logic MNLL. As a corollary we obtain an affirmative answer to the open question whether a known quadratic-time algorithm for the correctness checking of proof nets for MCLL and MNLL can be improved to linear-time
    Logic and Philosophy of LogicNonclassical LogicsProof Theory
  •  140
    On a theory of weak implications
    Journal of Symbolic Logic 53 (1): 200-211. 1988.
    Logic and Philosophy of LogicLogic and Philosophy of Logic, Miscellaneous
  •  338
    A simple relationship between Buchholz's new system of ordinal notations and Takeuti's system of ordinal diagrams
    Journal of Symbolic Logic 52 (3): 577-581. 1987.
    Logic and Philosophy of LogicProof Theory
  •  253
    The finite model property for various fragments of intuitionistic linear logic
    with Kazushige Terui
    Journal of Symbolic Logic 64 (2): 790-802. 1999.
    Recently Lafont [6] showed the finite model property for the multiplicative additive fragment of linear logic (MALL) and for affine logic (LLW), i.e., linear logic with weakening. In this paper, we shall prove the finite model property for intuitionistic versions of those, i.e. intuitionistic MALL (which we call IMALL), and intuitionistic LLW (which we call ILLW). In addition, we shall show the finite model property for contractive linear logic (LLC), i.e., linear logic with contraction, and for…Read more
    Recently Lafont [6] showed the finite model property for the multiplicative additive fragment of linear logic (MALL) and for affine logic (LLW), i.e., linear logic with weakening. In this paper, we shall prove the finite model property for intuitionistic versions of those, i.e. intuitionistic MALL (which we call IMALL), and intuitionistic LLW (which we call ILLW). In addition, we shall show the finite model property for contractive linear logic (LLC), i.e., linear logic with contraction, and for its intuitionistic version (ILLC). The finite model property for related substructural logics also follow by our method. In particular, we shall show that the property holds for all of FL and GL - -systems except FL c and GL - c of Ono [11], that will settle the open problems stated in Ono [12]
    Proof TheoryIntuitionistic Logic
  •  114
    A direct independence proof of Buchholz's Hydra Game on finite labeled trees
    with Masahiro Hamano
    Archive for Mathematical Logic 37 (2): 67-89. 1998.
    We shall give a direct proof of the independence result of a Buchholz style-Hydra Game on labeled finite trees. We shall show that Takeuti-Arai's cut-elimination procedure of $(\Pi^{1}_{1}-CA) + BI$ and of the iterated inductive definition systems can be directly expressed by the reduction rules of Buchholz's Hydra Game. As a direct corollary the independence result of the Hydra Game follows.
    Proof Theory
  • Prev.
  • 1
  • 2
  • Next
PhilPeople logo

On this site

  • Find a philosopher
  • Find a department
  • The Radar
  • Index of professional philosophers
  • Index of departments
  • Help
  • Acknowledgments
  • Careers
  • Contact us
  • Terms and conditions

Brought to you by

  • The PhilPapers Foundation
  • The American Philosophical Association
  • Centre for Digital Philosophy, Western University
PhilPeople is currently in Beta Sponsored by the PhilPapers Foundation and the American Philosophical Association
Feedback