Sciweavers

1302 search results - page 43 / 261
» Free-Style Theorem Proving
Sort
View
STACS
2012
Springer
12 years 3 months ago
The Denjoy alternative for computable functions
The Denjoy-Young-Saks Theorem from classical analysis states that for an arbitrary function f : R → R, the Denjoy alternative holds outside a null set, i.e., for almost every re...
Laurent Bienvenu, Rupert Hölzl, Joseph S. Mil...
JSYML
2006
88views more  JSYML 2006»
13 years 7 months ago
A constructive view on ergodic theorems
Abstract. Let T be a positive L1-L contraction. We prove that the following statements are equivalent in constructive mathematics.
Bas Spitters
SODA
2010
ACM
151views Algorithms» more  SODA 2010»
14 years 5 months ago
A Max-Flow/Min-Cut Algorithm for a Class of Wireless Networks
The linear deterministic model of relay channels is a generalization of the traditional directed network model which has become popular in the study of the flow of information ove...
S. M. Sadegh Tabatabaei Yazdi, Serap A. Savari
IJCAI
2003
13 years 9 months ago
Automated Reasoning: Past Story and New Trends
We overview the development of first-order automated reasoning systems starting from their early years. Based on the analysis of current and potential applications of such systems...
Andrei Voronkov
CJ
2006
78views more  CJ 2006»
13 years 7 months ago
A Very Mathematical Dilemma
Mathematics is facing a dilemma at its heart: the nature of mathematical proof. We have known since Church and Turing independently showed that mathematical provability was undeci...
Alan Bundy