Access the full text.
Sign up today, get DeepDyve free for 14 days.
Greg Restall (2000)
An Introduction to Substructural Logics
(1933)
Eine Interpretation des intuitionistischen Aussagenkalküls
D. Kozen, J. Tiuryn (2001)
On the completeness of propositional Hoare logic
GS (qw) These programs exist by Lemma 3.1, and GS (p) = GS (r ⊕ s)
D. Kozen (1997)
Kleene algebra with testsACM Trans. Program. Lang. Syst., 19
M. Boffa (1990)
Une remarque sur les systèmes complets d'identités rationnellesRAIRO Theor. Informatics Appl., 24
T. Critchlow, R. Musick, T. Slezak (2001)
Experiences applying meta-data to bioinformaticsInf. Sci., 139
D. Kozen, Maria-Christina Patron (2000)
Certification of Compiler Optimizations Using Kleene Algebra with Tests
A. Troelstra (1992)
Lectures on linear logic
D. Kozen (1999)
On Hoare logic and Kleene algebra with testsProceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158)
D. Kozen (1994)
On Action Algebras, 21
(2003)
ACM Transactions on Computational Logic
Bernhard Beckert, V. Klebanov, Steffen Schlager (2001)
Dynamic logicSIGACT News, 32
P. Lincoln (1992)
Linear logicSIGACT News, 23
(2001)
Received September
M. Boffa (1995)
Une condition impliquant toutes les identités rationnellesRAIRO Theor. Informatics Appl., 29
Tony Gardiner, P. Johnstone (1990)
Notes on logic and set theoryActa Applicandae Mathematica, 19
Tiuryn
M. Fischer, R. Ladner (1979)
Propositional Dynamic Logic of Regular ProgramsJ. Comput. Syst. Sci., 18
By Lemma 3.2, τ ∈ [ [qw] ] M , therefore no prefix of τ is in
D. Kaplan (1969)
Regular Expressions and the Equivalence of ProgramsJ. Comput. Syst. Sci., 3
D. Kozen, F. Smith (1996)
Kleene Algebra with Tests: Completeness and Decidability
D. Krob (1991)
Complete Systems of B-Rational IdentitiesTheor. Comput. Sci., 89
Y. Venema (2002)
Dynamic Logic by David Harel, Dexter Kozen and Jerzy Tiuryn. The MIT Press, Cambridge, Massachusetts. Hardback: ISBN 0–262–08289–6, $50, xv + 459 pagesTheory and Practice of Logic Programming, 2
D. Kozen (2001)
Automata on Guarded Strings and Applications
Sergei Artëmov (2001)
Explicit provability and constructive semanticsBull. Symb. Log., 7
P. Johnstone (1987)
Notes on logic and set theory: Ordinals and well-orderings
Saul Kripke (1963)
Semantical Analysis of Modal Logic I Normal Modal Propositional CalculiMathematical Logic Quarterly, 9
J. Conway (1971)
Regular algebra and finite machines
Let r and s be programs such that GS (r) = GS (p) ∩ GS (qw) and GS (s)
P. Brézillon, Paolo Bouquet (1999)
Lecture Notes in Artificial Intelligence
V. Pratt (1990)
Action Logic and Pure Induction
D. Krob (1990)
A Complete System of B-Rational Identities
D. Yetter (1990)
Quantales and (noncommutative) linear logicJournal of Symbolic Logic, 55
Saul Kripke (1965)
Semantical Analysis of Intuitionistic Logic IStudies in logic and the foundations of mathematics, 40
We formulate a noncommutative sequent calculus for partial correctness that subsumes propositional Hoare Logic. Partial correctness assertions are represented by intuitionistic linear implication. We prove soundness and completeness over relational and trace models. As a corollary, we obtain a complete sequent calculus for inclusion and equivalence of regular expressions.
ACM Transactions on Computational Logic (TOCL) – Association for Computing Machinery
Published: Jul 1, 2003
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.