3776 search results - page 398 / 756 » Partition-Based Logical Reasoning |
164
click to vote
CSL
2001
Springer
15 years 9 months ago
2001
Springer
We introduce the calculus of structures: it is more general than the sequent calculus and it allows for cut elimination and the subformula property. We show a simple extension of m...
150
Voted
ICALP
2001
Springer
15 years 9 months ago
2001
Springer
We present a logical framework Υ for reasoning on a very general class of languages featuring binding operators, called nominal , presented in higher-order abstract syntax (HOAS)....
151
Voted
CADE
2000
Springer
15 years 9 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 ...
134
click to vote
PLILP
1998
Springer
15 years 9 months ago
1998
Springer
: The bene ts of the object, logic or relational, functional, and constraint paradigms can be obtained from our previous combination of the object and functional paradigms in hidde...
142
Voted
TPHOL
1996
IEEE
15 years 9 months ago
1996
IEEE
Nuprl and HOL are both tactic-based interactive theorem provers for higher-order logic, and both have been used in many substantial applications over the last decade. However, the ...