Sciweavers

884 search results - page 10 / 177
» A Proof Theory for DL-Lite
Sort
View
AML
2008
84views more  AML 2008»
14 years 12 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
ENGL
2007
94views more  ENGL 2007»
14 years 11 months ago
Common subproofs in proof pairs
Abstract—In any formal theory, a proof is a sequence of well formed formulas (wff). Here, we consider the digraph whose nodes are proofs and the edges are pairs of proofs such t...
Guillermo Morales-Luna
LICS
2002
IEEE
15 years 4 months ago
The Proof Complexity of Linear Algebra
We introduce three formal theories of increasing strength for linear algebra in order to study the complexity of the concepts needed to prove the basic theorems of the subject. We...
Michael Soltys, Stephen A. Cook
ITP
2010
163views Mathematics» more  ITP 2010»
15 years 3 months ago
Fast LCF-Style Proof Reconstruction for Z3
Abstract. The Satisfiability Modulo Theories (SMT) solver Z3 can generate proofs of unsatisfiability. We present independent reconstruction of these proofs in the theorem provers...
Sascha Böhme, Tjark Weber
CORR
2007
Springer
177views Education» more  CORR 2007»
14 years 11 months ago
Another Proof of Wright's Inequalities
We present a short way of proving the inequalities obtained by Wright in [Journal of Graph Theory, 4: 393 – 407 (1980)] concerning the number of connected graphs with ℓ edges m...
Vlady Ravelomanana