Results 1 to 10 of about 342,984 (310)
Applying Gödel's Dialectica Interpretation to Obtain a Constructive Proof of Higman's Lemma [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 We use Gödel's Dialectica interpretation to analyse Nash-Williams' elegant but non-constructive "minimal bad sequence" proof of Higman's Lemma. The result is a concise constructive proof of the lemma (for arbitrary decidable well-quasi-orders) in which ...
Thomas Powell
doaj +4 more sources
The Completeness of Propositional Resolution: A Simple and Constructive Proof [PDF]
Logical Methods in Computer Science, 2006 It is well known that the resolution method (for propositional logic) is complete. However, completeness proofs found in the literature use an argument by contradiction showing that if a set of clauses is unsatisfiable, then it must have a resolution ...
Jean Gallier
doaj +5 more sources
A constructive proof of Simpson's Rule [PDF]
Journal of Logic and Analysis, 2012 For most purposes, one can replace the use of Rolle's theorem and the mean value theorem, which are not constructively valid, by the law of bounded change.
Coquand, Thierry, Spitters, Bas
core +16 more sources
Constructive proof of the Carpenter's Theorem [PDF]
Canadian Mathematical Bulletin, 2013 We give a constructive proof of Carpenter's Theorem due to Kadison.
Bownik, Marcin, Jasper, John
core +2 more sources
Proof search in constructive logics [PDF]
, 1999 We present an overview of some sequent calculi organised not for "theorem-proving" but for proof search, where the proofs themselves (and the avoidance of known proofs on backtracking) are objects of interest.
Dyckhoff, Roy, Pinto, Luís F.
core +5 more sources
Limits of real numbers in the binary signed digit representation [PDF]
Logical Methods in Computer Science, 2022 We extract verified algorithms for exact real number computation from constructive proofs. To this end we use a coinductive representation of reals as streams of binary signed digits.
Franziskus Wiesnet, Nils Köpp
doaj +1 more source
Algorithm and proof as Ω-invariance and transfer: A new model of computation in nonstandard analysis [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 We propose a new model of computation based on nonstandard analysis. Intuitively, the role of "algorithm" is played by a new notion of finite procedure, called Omega-invariance and inspired by physics, from nonstandard analysis.
Sam Sanders
doaj +1 more source
Central and Local Limit Theorems for Numbers of the Tribonacci Triangle
Mathematics, 2021 In this research, we continue studying limit theorems for combinatorial numbers satisfying a class of triangular arrays. Using the general results of Hwang and Bender, we obtain a constructive proof of the central limit theorem, specifying the rate of ...
Igoris Belovas
doaj +1 more source
The RedPRL Proof Assistant (Invited Paper) [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 RedPRL is an experimental proof assistant based on Cartesian cubical computational type theory, a new type theory for higher-dimensional constructions inspired by homotopy type theory.
Carlo Angiuli +4 more
doaj +1 more source
On Nested Sequents for Constructive Modal Logics [PDF]
Logical Methods in Computer Science, 2015 We present deductive systems for various modal logics that can be obtained from the constructive variant of the normal modal logic CK by adding combinations of the axioms d, t, b, 4, and 5.
Lutz Strassburger +2 more
doaj +1 more source