Natural deduction systems for some non-commutative logics

@inproceedings{Kamide2007NaturalDS,
  title={Natural deduction systems for some non-commutative logics},
  author={Norihiro Kamide and Motohiko Mouri},
  year={2007}
}
Varieties of natural deduction systems are introduced for Wansing’s paraconsistent non-commutative substructural logic, called a constructive sequential propositional logic (COSPL), and its fragments. Normalization, strong normalization and Church-Rosser theorems are proved for these systems. These results include some new results on full Lambek logic (FL) and its fragments, because FL is a fragment of COSPL. 

Citations

Publications citing this paper.

Natural Deduction for Connexive Paraconsistent Quantum Logic

  • 2017 IEEE 47th International Symposium on Multiple-Valued Logic (ISMVL)
  • 2017

References

Publications referenced by this paper.
SHOWING 1-10 OF 15 REFERENCES

A proof-theoretic study of non-classical logics — natural deduction systems for intuitionistic substructural logics and implemetation of proof assistant system

M. Mouri
  • (in Japanese). Doctoral dissertation, Japan Advanced Institute of Science and Technology,
  • 2002
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

Varieties of Linear Calculi

  • J. Philosophical Logic
  • 2002
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

The Logic of Information Structures

  • Lecture Notes in Computer Science
  • 1993
VIEW 8 EXCERPTS
HIGHLY INFLUENTIAL

Formulas-as-types for a Hierarchy of Sublogics of Intuitionistic Propositional Logic

  • Nonclassical Logics and Information Processing
  • 1990
VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL