2573 search results - page 373 / 515 » Combinations of Modal Logics |
174
click to vote
RTA
2005
Springer
15 years 12 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...
180
click to vote
FCCM
2003
IEEE
15 years 11 months ago
2003
IEEE
Hybrid architectures, which are composed of a conventional processor closely coupled with reconfigurable logic, seem to combine the advantages of both types of hardware. They pres...
210
click to vote
TPHOL
1999
IEEE
15 years 10 months ago
1999
IEEE
Abstract. We describe the key features of the proof description language of Declare, an experimental theorem prover for higher order logic. We take a somewhat radical approach to p...
172
click to vote
FPCA
1989
15 years 10 months ago
1989
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., v...
149
click to vote
LPNMR
1990
Springer
15 years 10 months ago
1990
Springer
We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in ...