Sciweavers

32 search results - page 2 / 7
» Herbrand's theorem and term induction
Sort
View
ENTCS
2006
131views more  ENTCS 2006»
13 years 6 months ago
Development Separation in Lambda-Calculus
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...
Hongwei Xi
JSYML
2011
50views more  JSYML 2011»
12 years 9 months ago
Determinacy in strong cardinal models
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: ...
Philip D. Welch
PPDP
2009
Springer
14 years 27 days ago
Reasoning with hypothetical judgments and open terms in hybrid
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...
Amy P. Felty, Alberto Momigliano
BIRTHDAY
1991
Springer
13 years 10 months ago
Modal Logic Should Say More Than It Does
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, ...
Melvin Fitting
CORR
2012
Springer
212views Education» more  CORR 2012»
12 years 2 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...