115 search results - page 11 / 23 » Proof Theory for Kleene Algebra |
CADE
2000
Springer
15 years 2 months ago
2000
Springer
Abstract. aRa is an automatic theorem prover for various kinds of relation algebras. It is based on Gordeev’s Reduction Predicate Calculi for n-variable logic (RPCn) which allow ...
APAL
2010
14 years 9 months ago
2010
The study of Borel equivalence relations under Borel reducibility has developed into an important area of descriptive set theory. The dichotomies of Silver ([19]) and Harrington-K...
101
click to vote
CADE
1990
Springer
15 years 1 months ago
1990
Springer
imps is an Interactive Mathematical Proof System intended as a general purpose tool for formulating and applying mathematics in a familiar fashion. The logic of imps is based on a...
ENTCS
2007
14 years 9 months ago
2007
We develop a sound and complete equational theory for the functional quantum programming language QML. The soundness and completeness of the theory are with respect to the previou...
JSYML
2010
14 years 8 months ago
2010
Continuous first-order logic has found interest among model theorists who wish to extend the classical analysis of “algebraic” structures (such as fields, group, and graphs) ...