620 search results - page 31 / 124 » About the logical relations between cases and rules |
103
click to vote
AIML
2008
15 years 1 months ago
2008
In 1983, Valentini presented a syntactic proof of cut-elimination for a sequent calculus GLSV for the provability logic GL where we have added the subscript V for "Valentini&q...
81
Voted
DT
1998
14 years 11 months ago
1998
The logic blocks of most modern FPGAs contain clusters of look-up tables and flip flops, yet little is known about good choices for several key architectural parameters related ...
SOFTVIS
2005
ACM
15 years 5 months ago
2005
ACM
Software archives contain historical information about the development process of a software system. Using data mining techniques rules can be extracted from these archives. In th...
RTA
2005
Springer
15 years 5 months ago
2005
Springer
We present constructive arithmetic in Deduction modulo with rewrite rules only. In natural deduction and in sequent calculus, the cut elimination theorem and the analysis of the st...
106
click to vote
CADE
2000
Springer
15 years 4 months ago
2000
Springer
Abstract. Proof-carrying code and other applications in computer security require machine-checkable proofs of properties of machine-language programs. These in turn require axioms ...