Sciweavers

12774 search results - page 103 / 2555
» A Framework for Proof Systems
Sort
View
FUIN
2006
145views more  FUIN 2006»
15 years 3 months ago
Negative Ordered Hyper-Resolution as a Proof Procedure for Disjunctive Logic Programming
We prove that negative hyper-resolution using any liftable and well-founded ordering refinement is a sound and complete procedure for answering queries in disjunctive logic program...
Linh Anh Nguyen
MOC
1998
104views more  MOC 1998»
15 years 3 months ago
Chaos in the Lorenz equations: A computer assisted proof. Part II: Details
Abstract. Details of a new technique for obtaining rigorous results concerning the global dynamics of nonlinear systems is described. The technique abstract existence results based...
Konstantin Mischaikow, Marian Mrozek
104
Voted
ICFP
2008
ACM
16 years 3 months ago
A type-preserving compiler in Haskell
There has been a lot of interest of late for programming languages that incorporate features from dependent type systems and proof assistants in order to capture in the types impo...
Louis-Julien Guillemette, Stefan Monnier
COMBINATORICS
2006
153views more  COMBINATORICS 2006»
15 years 3 months ago
BG-Ranks and 2-Cores
We find the number of partitions of n whose BG-rank is j, in terms of pp(n), the number of pairs of partitions whose total number of cells is n, giving both bijective and generati...
William Y. C. Chen, Kathy Q. Ji, Herbert S. Wilf
119
Voted
JSYML
2010
65views more  JSYML 2010»
14 years 10 months ago
Formalizing non-standard arguments in second-order arithmetic
In this paper, we introduce the systems ns-ACA0 and ns-WKL0 of non-standard second-order arithmetic in which we can formalize non-standard arguments in ACA0 and WKL0, respectively...
Keita Yokoyama