Sciweavers

1322 search results - page 34 / 265
» Unsound Theorem Proving
Sort
View
JCT
2010
62views more  JCT 2010»
13 years 6 months ago
A Ramsey theorem for structures with both relations and functions
We prove a generalization of Pr¨omel’s theorem to finite structures with both relations and functions.
Slawomir Solecki
ECCC
2007
77views more  ECCC 2007»
13 years 7 months ago
Selected Results in Additive Combinatorics: An Exposition
We give a self-contained exposition of selected results in additive combinatorics over the group GF(2)n = {0, 1}n. In particular, we prove the celebrated theorems known as the Bal...
Emanuele Viola
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