Cornell University
Library
Cornell UniversityLibrary

eCommons

Help
Log In(current)
  1. Home
  2. Cornell Computing and Information Science
  3. Computing and Information Science
  4. Computing and Information Science Technical Reports
  5. Completeness and Incompleteness in Nominal Kleene Algebra

Completeness and Incompleteness in Nominal Kleene Algebra

File(s)
NKA.pdf (217.16 KB)
Main article
Permanent Link(s)
https://hdl.handle.net/1813/38143
Collections
Computing and Information Science Technical Reports
Author
Kozen, Dexter
Mamouras, Konstantinos
Silva, Alexandra
Abstract

Gabbay and Ciancia (2011) presented a nominal extension of Kleene algebra as a framework for trace semantics with dynamic allocation of resources, along with a semantics consisting of nominal languages. They also provided an axiomatization that captures the behavior of the scoping operator and its interaction with the Kleene algebra operators and proved soundness over nominal languages. In this paper we show that the axioms are complete and describe the free language models.

Date Issued
2014-11-14
Keywords
Kleene algebra
•
nominal logic
Type
technical report

Site Statistics | Help

About eCommons | Policies | Terms of use | Contact Us

copyright © 2002-2026 Cornell University Library | Privacy | Web Accessibility Assistance