Sciweavers

344 search results - page 9 / 69
» Some Theorems We Should Prove
Sort
View
CSL
2007
Springer
14 years 1 months ago
Incorporating Tables into Proofs
We consider the problem of automating and checking the use of previously proved lemmas in the proof of some main theorem. In particular, we call the collection of such previously p...
Dale Miller, Vivek Nigam
CORR
2007
Springer
133views Education» more  CORR 2007»
13 years 7 months ago
On Decidability Properties of Local Sentences
Local (first order) sentences, introduced by Ressayre, enjoy very nice decidability properties, following from some stretching theorems stating some remarkable links between the ...
Olivier Finkel
NDJFL
1998
105views more  NDJFL 1998»
13 years 7 months ago
Idempotent Full Paraconsistent Negations are not Algebraizable
Using methods of abstract logic and the theory of valuation, we prove that there is no paraconsistent negation obeying the law of double negation and such that ¬(a ∧ ¬a) is a t...
Jean-Yves Béziau
AMC
2006
104views more  AMC 2006»
13 years 7 months ago
Three counterexamples refuting Kieu's plan for "quantum adiabatic hypercomputation"; and some uncomputable quantum mechanical ta
-- Tien D. Kieu, in 10 papers posted to the quant-ph section of the xxx.lanl.gov preprint archive [some of which were also published in printed journals such as Proc. Royal Soc. A ...
Warren D. Smith
ENTCS
2008
87views more  ENTCS 2008»
13 years 7 months ago
Integral of Fine Computable functions and Walsh Fourier series
We de ne the e ective integrability of Fine-computable functions and e ectivize some fundamental limit theorems in the theory of Lebesgue integral such as Bounded Convergence Theo...
Takakazu Mori, Mariko Yasugi, Yoshiki Tsujii