188 search results - page 12 / 38 » Logic of Proofs for Bounded Arithmetic |
TPHOL
2007
IEEE
15 years 6 months ago
2007
IEEE
Abstract. In this proof pearl, we demonstrate the power of higherorder encodings in the logical framework Twelf[PS99] by investigating proofs about an algorithmic specification of...
TABLEAUX
2009
Springer
15 years 6 months ago
2009
Springer
We define a notion of formula schema handling arithmetic parameters, indexed propositional variables (e.g. Pi) and iterated conjunctions/disjunctions (e.g. Vn i=1 Pi, where n is a...
104
click to vote
TC
2011
14 years 6 months ago
2011
Abstract—The fused multiply accumulate-add (FMA) instruction, specified by the IEEE 754-2008 Standard for Floating-Point Arithmetic, eases some calculations, and is already avai...
CADE
1990
Springer
15 years 3 months ago
1990
Springer
We briefly review a mechanical theorem-prover for a logic of recursive functions over finitely generated objects including the integers, ordered pairs, and symbols. The prover, kn...
CAV
2008
Springer
15 years 1 months ago
2008
Springer
We consider an extension of integer linear arithmetic with a "star" operator takes closure under vector addition of the solution set of a linear arithmetic subformula. We...