Skip to main content
SpringerLink
Log in

Dynamic Non-Commutative Logic

  • Published:
Journal of Logic, Language and Information Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Abrusci V. M. (1990) Non-commutative intuitionistic linear logic. Zeitschrift fur mathematische Logik und Grundlagen 36: 297–318

    Article  Google Scholar 

  • Bull R. A. (1992) Cut elimination for propositional dynamic logic without *. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 38: 85–100

    Article  Google Scholar 

  • Girard J.-Y. (1987) Linear logic. Theoretical Computer Science 50: 1–102

    Article  Google Scholar 

  • Harel D., Kozen D., Tiuryn J. (2000) Dynamic logic (Foundations of Computing Series). The MIT Press, Cambridge

    Google Scholar 

  • Kamide N. (2008) Linear exponentials as resource operators: A decidable first-order linear logic with bounded exponentials. Lecture Notes in Artificial Intelligence 5293: 245–257

    Google Scholar 

  • Komori Y. (1986) Predicate logics without the structure rules. Studia Logica 45: 393–404

    Article  Google Scholar 

  • Kozen D., Tiuryn J. (2003) Substructural logic and partial correctness. ACM Transactions on Computational Logic 4(3): 1–24

    Article  Google Scholar 

  • Lambek J. (1958) The mathematics of sentence structure. The American Mathematical Monthly 65: 154–170

    Article  Google Scholar 

  • Nishimura H. (1979) Sequential method in propositional dynamic logic. Acta Informatica 12: 377–400

    Article  Google Scholar 

  • Okada M. (2002) A uniform semantic proof for cut-elimination and completeness of various first and higher order logics. Theoretical Computer Science 281: 471–498

    Article  Google Scholar 

  • 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).

  • 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).

  • 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).

Download references

Author information

Authors and Affiliations

  1. Waseda Institute for Advanced Study, Waseda University, 1-6-1 Nishi Waseda, Shinjuku-ku, Tokyo, 169-8050, Japan

    Norihiro Kamide

Authors
  1. Norihiro Kamide
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Norihiro Kamide.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kamide, N. Dynamic Non-Commutative Logic. J of Log Lang and Inf 19, 33–51 (2010). https://doi.org/10.1007/s10849-009-9101-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10849-009-9101-1

Keywords

Search

Navigation