Dynamic Non-Commutative Logic



A first-order dynamic non-commutative logic (DN), which has no structural rules and has some program operators, is introduced as a Gentzen-type sequent calculus. Decidability, cut-elimination and completeness theorems are shown for DN or its fragments. DN is intended to represent not only program-based, resource-sensitive, ordered, sequence-based, but also hierarchical (tree-based) reasoning.


Completeness Cut-elimination Decidability Dynamic logic Non-commutative logic Sequent calculus 


  1. Abrusci V. M. (1990) Non-commutative intuitionistic linear logic. Zeitschrift fur mathematische Logik und Grundlagen 36: 297–318CrossRefGoogle Scholar
  2. Bull R. A. (1992) Cut elimination for propositional dynamic logic without *. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 38: 85–100CrossRefGoogle Scholar
  3. Girard J.-Y. (1987) Linear logic. Theoretical Computer Science 50: 1–102CrossRefGoogle Scholar
  4. Harel D., Kozen D., Tiuryn J. (2000) Dynamic logic (Foundations of Computing Series). The MIT Press, CambridgeGoogle Scholar
  5. Kamide N. (2008) Linear exponentials as resource operators: A decidable first-order linear logic with bounded exponentials. Lecture Notes in Artificial Intelligence 5293: 245–257Google Scholar
  6. Komori Y. (1986) Predicate logics without the structure rules. Studia Logica 45: 393–404CrossRefGoogle Scholar
  7. Kozen D., Tiuryn J. (2003) Substructural logic and partial correctness. ACM Transactions on Computational Logic 4(3): 1–24CrossRefGoogle Scholar
  8. Lambek J. (1958) The mathematics of sentence structure. The American Mathematical Monthly 65: 154–170CrossRefGoogle Scholar
  9. Nishimura H. (1979) Sequential method in propositional dynamic logic. Acta Informatica 12: 377–400CrossRefGoogle Scholar
  10. Okada M. (2002) A uniform semantic proof for cut-elimination and completeness of various first and higher order logics. Theoretical Computer Science 281: 471–498CrossRefGoogle Scholar
  11. Pratt, V. R. (1976). Semantical considerations on Floyed-Hoare logic. In Proceedings of the 17th IEEE Symposium on the Foundations of Computer Science (pp. 109–112).Google Scholar
  12. Reynolds, J. C. (2002). Separation logic: A logic for shared mutable data structures. In Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science (pp. 55–74).Google Scholar
  13. Wansing, H. (2005). On the negation of action types: constructive concurrent PDL. In Proceedings of the 12th International Congress: Logic, Methodology and Philosophy of Science (pp. 207–225).Google Scholar

Copyright information

© Springer Science+Business Media B.V. 2009

Authors and Affiliations

  1. 1.Waseda Institute for Advanced StudyWaseda UniversityTokyoJapan

Personalised recommendations