We present a proof technique in -calculus that can facilitate inductive reasoning on -terms by separating certain -developments from other -reductions. We give proofs based on thi...
We give limits defined in terms of abstract pointclasses of the amount of determinacy available in certain canonical inner models involving strong cardinals. We show for example: ...
Hybrid is a system developed to specify and reason about logics, programming languages, and other formal systems expressed in rder abstract syntax (HOAS). An important goal of Hyb...
First-order modal logics, as traditionally formulated, are not expressive enough. It is this that is behind the difficulties in formulating a good analog of Herbrand’s Theorem, ...
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...