371 search results - page 33 / 75 » Partition Theorems and Computability Theory |
80
Voted
TCS
2010
14 years 4 months ago
2010
The theorem of factorization forests of Imre Simon shows the existence of nested factorizations -- `a la Ramsey -- for finite words. This theorem has important applications in sem...
SIGECOM
2005
ACM
15 years 3 months ago
2005
ACM
This paper initiates research on the foundations of ranking systems, a fundamental ingredient of basic e-commerce and Internet Technologies. In order to understand the essence and...
LICS
2007
IEEE
15 years 4 months ago
2007
IEEE
In predicate logic, the proof that a theorem P holds in a theory Th is typically conducted in natural deduction or in the sequent calculus using all the information contained in t...
123
click to vote
FOCS
2000
IEEE
15 years 2 months ago
2000
IEEE
In this article, we show several results obtained by combining the use of stable distributions with pseudorandom generators for bounded space. In particular: —We show that, for a...
BIRTHDAY
2010
Springer
14 years 10 months ago
2010
Springer
Prominent logics, including quantified multimodal logics, can be elegantly embedded in simple type theory (classical higher-order logic). Furthermore, off-the-shelf reasoning syste...