Sciweavers

3552 search results - page 34 / 711
» Proof theory in the abstract
Sort
View
TPHOL
2005
IEEE
15 years 7 months ago
Proof Pearl: Using Combinators to Manipulate let-Expressions in Proof
We discuss methods for dealing effectively with let-bindings in proofs. Our contribution is a small set of unconditional rewrite rules, found by the bracket abstraction translatio...
Michael Norrish, Konrad Slind
AML
2008
84views more  AML 2008»
15 years 2 months ago
Harrington's conservation theorem redone
Leo Harrington showed that the second-order theory of arithmetic WKL0 is 1 1-conservative over the theory RCA0. Harrington's proof is model-theoretic, making use of a forcing...
Fernando Ferreira, Gilda Ferreira
CADE
2008
Springer
16 years 2 months ago
Presenting TSTP Proofs with Inference Web Tools
Abstract. This paper describes the translation of proofs in the Thousands of Solutions from Theorem Provers (TSTP) solution library to the Proof Markup Language (PML), and the subs...
Paulo Pinheiro da Silva, Geoff Sutcliffe, Cynthia ...
POPL
2010
ACM
15 years 2 months ago
Nested interpolants
In this paper, we explore the potential of the theory of nested words for partial correctness proofs of recursive programs. Our conceptual contribution is a simple framework that ...
Matthias Heizmann, Jochen Hoenicke, Andreas Podels...
116
Voted
CIE
2005
Springer
15 years 7 months ago
A Logical Approach to Abstract Algebra
L APPROACH TO ABSTRACT ALGEBRA THIERRY COQUAND AND HENRI LOMBARDI Recent work in constructive mathematics show that Hilbert’s program works rge part of abstract algebra. Using in...
Thierry Coquand