Dynamic Non-Commutative Logic

Authors:
Norihiro Kamide
Affiliations:
Waseda Institute for Advanced Study, Waseda University, Tokyo, Japan 169-8050
Venue:
Journal of Logic, Language and Information
Year:
2010

Citing 6
Cited 0

Linear logic

Theoretical Computer Science
Dynamic Logic

Dynamic Logic
A uniform semantic proof for cut-elimination and completeness of various first and higher order logics

Theoretical Computer Science
Separation Logic: A Logic for Shared Mutable Data Structures

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Substructural logic and partial correctness

ACM Transactions on Computational Logic (TOCL)
Semantical consideration on floyo-hoare logic

SFCS '76 Proceedings of the 17th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.