A Cut-Free Cyclic Proof System for Kleene Algebra

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-319-66902-1_16
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer International Publishing

Related search

Kleene Algebra With Hypotheses

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2019English

Greedy-Like Algorithms in Modal Kleene Algebra

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events

English

An Algebraic Proof of Kleene-Myhill's Equivalence Theorem

Memoirs of the Faculty of Science, Kyushu University. Series A, Mathematics
1970English

Certification of Compiler Optimizations Using Kleene Algebra With Tests

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2000English

Proof Complexity Meets Algebra

ACM Transactions on Computational Logic
Computational MathematicsTheoretical Computer ScienceComputer ScienceLogic
2019English

Towards Interactive Verification of Programmable Logic Controllers Using Modal Kleene Algebra and KIV

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2015English

A Schütte-Tait Style Cut-Elimination Proof for First-Order Gödel Logic

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2002English

A Unified Proof System for QBF Preprocessing

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy