Dynamic non-commutative logic

Journal of Logic, Language and Information 19 (1):33-51 (2010)
  Copy   BIBTEX

Abstract

A first-order dynamic non-commutative logic, 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 reasoning.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,574

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2009-09-21

Downloads
53 (#303,597)

6 months
6 (#531,961)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Bunched sequential information.Norihiro Kamide - 2016 - Journal of Applied Logic 15:150-170.

Add more citations

References found in this work

The Mathematics of Sentence Structure.Joachim Lambek - 1958 - Journal of Symbolic Logic 65 (3):154-170.
Dynamic Logic.Lenore D. Zuck & David Harel - 1989 - Journal of Symbolic Logic 54 (4):1480.
Linear Logic.Jean-Yves Girard - 1987 - Theoretical Computer Science 50:1–102.

View all 10 references / Add more references