Sciweavers

2152 search results - page 9 / 431
» On Automating the Calculus of Relations
Sort
View
ELP
1993
13 years 11 months ago
Finitary Partial Inductive Definitions as a General Logic
We describe how the calculus of partial inductive definitions is used to represent logics. This calculus includes the powerful principle of definitional reflection. We describe two...
Lars-Henrik Eriksson
CORR
2012
Springer
212views Education» more  CORR 2012»
12 years 3 months ago
A Bi-Directional Refinement Algorithm for the Calculus of (Co)Inductive Constructions
The paper describes the refinement algorithm for the Calculus of (Co)Inductive Constructions (CIC) implemented in the interactive theorem prover Matita. The refinement algorithm ...
Andrea Asperti, Wilmer Ricciotti, Claudio Sacerdot...
CADE
2003
Springer
14 years 7 months ago
Proof Search and Proof Check for Equational and Inductive Theorems
This paper presents on-going researches on theoretical and practical issues of combining rewriting based automated theorem proving and user-guided proof development, with the stron...
Eric Deplagne, Claude Kirchner, Hélè...
DEON
2010
Springer
14 years 5 days ago
Where Did Mally Go Wrong?
In 1926, Mally proposed the first formal deontic system. As Mally and others soon realized, this system had some rather strange consequences. We show that the strangeness of Mally...
Gert-Jan C. Lokhorst
LICS
1999
IEEE
13 years 11 months ago
Subtyping Recursive Types in Kernel Fun
The problem of defining and checking a subtype relation between recursive types was studied in [3] for a first order type system, but for second order systems, which combine subty...
Dario Colazzo, Giorgio Ghelli