𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Formal proof of prefix adders

✍ Scribed by Feng Liu; Qingping Tan; Gang Chen

Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
308 KB
Volume
52
Category
Article
ISSN
0895-7177

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Formal proof of a program: Find
Formal proof of a program: Find
✍ Jean-Christophe FilliΓ’tre πŸ“‚ Article πŸ“… 2007 πŸ› Elsevier Science 🌐 English βš– 232 KB

In 1971, C.A.R. Hoare gave the proof of correctness and termination of a rather complex algorithm, in a paper entitled Proof of a program: Find. It is a handmade proof, where the program is given together with its formal specification and where each step is fully justified by mathematical reasoning.

Asymptotic Cyclic Expansion and Bridge G
Asymptotic Cyclic Expansion and Bridge Groups of Formal Proofs
✍ A. Carbone πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 515 KB

Formal proofs, even simple ones, may hide an unexpected intricate combinatorics. We define a new combinatorial invariant, the bridge group of a proof, which encodes the cyclic structure of proofs in the sequent calculus. We compute the bridge groups of two infinite families of proofs and identify th

On the Difficulty of Writing Out formal
On the Difficulty of Writing Out formal Proofs in Arithmetic
✍ Ryo Kashima; Takeshi Yamaguchi πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 266 KB

## Abstract Let β„Έ be the set of GΓΆdel numbers Gn(__f__) of function symbols __f__ such that PRA ⊒ and let Ξ³ be the function such that We prove: (1) The r. e. set β„Έ is m‐complete; (2) the function Ξ³ is not primitive recursive in any class of functions {__f__~1~, __f__~2~, ⃛} so long as each __f~i~