Norihiro Kamide
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Norihiro Kamide has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Ken Kaneiwa
Department of Electrical Engineering and Computer Science, Iwate University, 4-3-5 Ueda, Morioka, Iwate 020-8551, Japan
5 shared publications - Sara Negri
University of Genoa, Genoa, Italy
4 shared publications - Heinrich Wansing
Ruhr University Bochum
3 shared publications - Yaroslav Shramko
Kryvyi Rih State Pedagogical University
3 shared publications Kazuki Endo
Teikyo University
2 shared publicationsHitoshi Omori
Kyoto University
1 shared publication
Latest Publications
- 25 February 2026
- Published by Springer Nature in Studia Logica
- p. 1-28
From First-Order Self-Extensional Paradefinite Four-Valued Logic to First-Order Classical Logic
- 25 February 2026
- Published by Springer Nature in Studia Logica
- p. 1-28
From First-Order Self-Extensional Paradefinite Four-Valued Logic to First-Order Classical Logic
- 8 September 2025
- Published by Springer Nature in Studia Logica
- p. 1-27
Proof Theory for Extended Belnap–Dunn and Intuitionistic Logics
- 8 September 2025
- Published by Springer Nature in Studia Logica
- p. 1-27
Proof Theory for Extended Belnap–Dunn and Intuitionistic Logics
- Open Access
- 30 June 2025
- Published by Uniwersytet Lodzki (University of Lodz) in Bulletin of the Section of Logic
- Vol. 54 (2) , 227-282
Unified Sequent Calculi and Natural Deduction Systems for Until-free Linear-time Temporal Logics
A unified Gentzen-style proof-theoretic framework for until-free propositional linear-time temporal logic and its intuitionistic variant is introduced. The framework unifies Gentzen-style single-succedent sequent calculi and natural deduction systems for both the classical and intuitionistic versions of these temporal logics. Theorems establishing the equivalence between the proposed sequent calculi and natural deduction systems are proved. Furthermore, the cut-elimination theorems for the proposed sequent calculi and the normalization theorems for the proposed natural deduction systems are established.
- 30 June 2025
- Published by Uniwersytet Lodzki (University of Lodz) in Bulletin of the Section of Logic
- Vol. 54 (2) , 227-282
Open AccessUnified Sequent Calculi and Natural Deduction Systems for Until-free Linear-time Temporal Logics
A unified Gentzen-style proof-theoretic framework for until-free propositional linear-time temporal logic and its intuitionistic variant is introduced. The framework unifies Gentzen-style single-succedent sequent calculi and natural deduction systems for both the classical and intuitionistic versions of these temporal logics. Theorems establishing the equivalence between the proposed sequent calculi and natural deduction systems are proved. Furthermore, the cut-elimination theorems for the proposed sequent calculi and the normalization theorems for the proposed natural deduction systems are established.
- Open Access
- 30 June 2025
- Published by Uniwersytet Lodzki (University of Lodz) in Bulletin of the Section of Logic
- Vol. 54 (2) , 157-205
Cut-elimination and Normalization Theorems for Connexive Logics over Wansing’s C
Gentzen-style sequent calculi and Gentzen-style natural deduction systems are introduced for a family (C-family) of connexive logics over Wansing’s basic constructive connexive logic C. The C-family is derived from C by incorporating Peirce’s law, the law of excluded middle, and the generalized law of excluded middle. Natural deduction systems with general elimination rules are also introduced for the C-family. Theorems establishing the equivalence between the proposed sequent calculi and natural deduction systems are demonstrated. Cut-elimination and normalization theorems are established for the proposed sequent calculi and natural deduction systems, respectively. Additionally, similar results are obtained for a family (N-family) of paraconsistent logics over Nelson’s constructive four-valued logic N4.
- 30 June 2025
- Published by Uniwersytet Lodzki (University of Lodz) in Bulletin of the Section of Logic
- Vol. 54 (2) , 157-205
Open AccessCut-elimination and Normalization Theorems for Connexive Logics over Wansing’s C
Gentzen-style sequent calculi and Gentzen-style natural deduction systems are introduced for a family (C-family) of connexive logics over Wansing’s basic constructive connexive logic C. The C-family is derived from C by incorporating Peirce’s law, the law of excluded middle, and the generalized law of excluded middle. Natural deduction systems with general elimination rules are also introduced for the C-family. Theorems establishing the equivalence between the proposed sequent calculi and natural deduction systems are demonstrated. Cut-elimination and normalization theorems are established for the proposed sequent calculi and natural deduction systems, respectively. Additionally, similar results are obtained for a family (N-family) of paraconsistent logics over Nelson’s constructive four-valued logic N4.
- 22 May 2025
- Published by Springer Nature in Journal of Philosophical Logic
- Vol. 54 (3) , 691-730
Proof theory of Abelian connexive logics
- 22 May 2025
- Published by Springer Nature in Journal of Philosophical Logic
- Vol. 54 (3) , 691-730
Proof theory of Abelian connexive logics
- Open Access
- 31 December 2024
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 415, 165-179
A Unified Gentzen-style Framework for Until-free LTL
A unified Gentzen-style framework for until-free propositional linear-time temporal logic is introduced. The proposed framework, based on infinitary rules and rules for primitive negation, can handle uniformly both a single-succedent sequent calculus and a natural deduction system. Furthermore, an equivalence between these systems, alongside with proofs of cut-elimination and normalization theorems, is established.
- 31 December 2024
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 415, 165-179
Open AccessA Unified Gentzen-style Framework for Until-free LTL
A unified Gentzen-style framework for until-free propositional linear-time temporal logic is introduced. The proposed framework, based on infinitary rules and rules for primitive negation, can handle uniformly both a single-succedent sequent calculus and a natural deduction system. Furthermore, an equivalence between these systems, alongside with proofs of cut-elimination and normalization theorems, is established.
- Open Access
- 31 December 2024
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 415, 214-228
Unified Gentzen Approach to Connexive Logics over Wansing's C
Gentzen-style sequent calculi and Gentzen-style natural deduction systems are introduced for a family (C-family) of connexive logics over Wansing's basic connexive logic C. The C-family is derived from C by incorporating the Peirce law, the law of excluded middle, and the generalized law of excluded middle. Theorems establishing equivalence between the proposed sequent calculi and natural deduction systems are demonstrated. Cut-elimination and normalization theorems are established for the proposed sequent calculi and natural deduction systems, respectively.
- 31 December 2024
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 415, 214-228
Open AccessUnified Gentzen Approach to Connexive Logics over Wansing's C
Gentzen-style sequent calculi and Gentzen-style natural deduction systems are introduced for a family (C-family) of connexive logics over Wansing's basic connexive logic C. The C-family is derived from C by incorporating the Peirce law, the law of excluded middle, and the generalized law of excluded middle. Theorems establishing equivalence between the proposed sequent calculi and natural deduction systems are demonstrated. Cut-elimination and normalization theorems are established for the proposed sequent calculi and natural deduction systems, respectively.
- Open Access
- 31 December 2024
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 415, 16-32
Twist Sequent Calculi for S4 and its Neighbors
Two Gentzen-style twist sequent calculi for the normal modal logic S4 are introduced and investigated. The proposed calculi, which do not employ the standard logical inference rules for the negation connective, are characterized by several twist logical inference rules for negated logical connectives. Using these calculi, short proofs can be generated for provable negated modal formulas that contain numerous negation connectives. The cut-elimination theorems for the calculi are proved, and the subformula properties for the calculi are also obtained. Additionally, Gentzen-style twist (hyper)sequent calculi for other normal modal logics including S5 are considered.
- 31 December 2024
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 415, 16-32
Open AccessTwist Sequent Calculi for S4 and its Neighbors
Two Gentzen-style twist sequent calculi for the normal modal logic S4 are introduced and investigated. The proposed calculi, which do not employ the standard logical inference rules for the negation connective, are characterized by several twist logical inference rules for negated logical connectives. Using these calculi, short proofs can be generated for provable negated modal formulas that contain numerous negation connectives. The cut-elimination theorems for the calculi are proved, and the subformula properties for the calculi are also obtained. Additionally, Gentzen-style twist (hyper)sequent calculi for other normal modal logics including S5 are considered.
- 21 September 2024
- Published by Springer Nature in Studia Logica
- Vol. 113 (6) , 1783-1811
G3-style Sequent Calculi for Gurevich Logic and Its Neighbors
- 21 September 2024
- Published by Springer Nature in Studia Logica
- Vol. 113 (6) , 1783-1811
G3-style Sequent Calculi for Gurevich Logic and Its Neighbors