Dr. Norihiro Kamide

Profile

Academic positionLecturer, Assistant Professor, Researcher
Research fieldsFundamentals of Mathematics, Logics, Set Theory,Theoretical Philosophy,Theoretical Computer Science
Keywordscompleteness theorem, Substructural logic, cut-elimination theorem, modal operator, natural deduction system

Current contact address

CountryJapan
CityTokyo
InstitutionCyber University
InstituteFaculty of Information Technology and Business

Host during sponsorship

Prof. Dr. Heinrich WansingInstitut für Philosophie, Technische Universität Dresden, Dresden
Start of initial sponsorship01/05/2008

Programme(s)

2007Humboldt Research Fellowship Programme

Publications (partial selection)

2011Norihiro Kamide and Heinrich Wansing: A paraconsistent linear-time temporal logic. In: Fundamenta Informaticae, 2011, 1-23
2011Norihiro Kamide and Heinrich Wansing: Completeness and cut-elimination theorems for trilattice logics. In: Annals of Pure and Applied Logic, 2011, 816-835
2011Norihiro Kamide: Phase semantics for linear-time formalism. In: Logic Journal of the IGPL, 2011, 121-143
2010Norihiro Kamide: An embedding-based completeness proof for Nelson's paraconsistent logic. In: Bulletin of the Section of Logic, 2010, 205-214
2010Norihiro Kamide: Automating and computing paraconsistent reasoning: Contraction-free, resolution and type systems. In: Reports on Mathematical Logic, 2010, 3-21
2010Norihiro Kamide and Heinrich Wansing: Combining linear-time temporal logic with constructiveness and paraconsistency. In: Journal of Applied Logic, 2010, 33-61
2010Norihiro Kamide: Dynamic non-commutative logic. In: Journal of Logic, Language and Information, 2010, 33-51
2010Heinrich Wansing, Norihiro Kamide: Intuitionistic trilattice logics. In: Journal of Logic and Computation, 2010, 1201-1229
2010Norihiro Kamide, Heinrich Wansing: Symmetric and dual paraconsistent logics. In: Logic and Logical Philosophy, 2010, 7-30
2009Norihiro Kamide: Embedding linear-time temporal logic into infinitary logic: application to cut-elimination for multi-agent infinitary epistemic linear-time temporal logic. In: Michael Fisher, Fariba Sadri, Michael Thielscher, Lecture Notes in Artificial Intelligence . Springer, 2009. 57-76
2009Norihiro Kamide and Ken Kaneiwa: Extended full computation-tree logic with sequence modal operator: representing hiearachical tree structutres . In: Ann Nicholson and Xiaodong Li, Lecture Notes in Artificial Intelligence 5866 (AI 2009: Advances in Artificial Intelligence, Proceedings of the 22nd Australasian Joint Conference on Artificial Intelligence). Springer, 2009. 485-494
2009Norihiro Kamide: Proof systems combining classical and paraconsistent negations. In: Studia Logica, 2009, 217-238
2009Norihiro Kamide, Heinrich Wansing: Sequent calculi for some trilattice logics. In: The Review of Symbolic Logic, 2009, 374-395
2009Norihiro Kamide: Strong normalization of program-indexed lambda calculus. In: K. Ambos-Spies, B. Lowe, W. Merkle, Abstract Booklet of the 5th International Conference Computability in Europe 2009: Mathematical Theory and Computational Practice. University of Heidelberg, 2009. 196-205
2009Norihiro Kamide: Temporal non-commutative logic: expressing time, resource, order and hierarchy. In: Logic and Logical Philosophy, 2009, 97-126
2008Norihiro Kamide: Embedding linear-time temporal logic into infinitary logic: Application to cut-elimination for multi-agent infinitary epistemic linear-time temporal logic. In: Michael Fisher, Michael Thielsher Informal Proceedings of the 9th International Workshop on Computational Logic in Multi-Agent Systems (CLIMA-9). 2008. 143-158
2008Norihiro Kamide: Linear exponentials as resource operators: A decidable first-order linear logic with bounded exponentials. In: Lecture Notes in Artifical Intelligence, 2008, 245-257
2008Norihiro Kamide, Motohiko Mouri: Strong normalizability of typed lambda calculi for substructural logics. In: Logica Universalis, 2008, 189-208