10 search results - page 1 / 2 » The Strongest Nonsplitting Theorem |
TAMC
2007
Springer
14 years 1 months ago
2007
Springer
SLOGICA
2008
13 years 7 months ago
2008
We give a brief account of some de Finetti style representation theorems for probability functions satisfying Spectrum Exchangeability in Polyadic Inductive Logic, together with ap...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
A strong direct product theorem (SDPT) states that solving n instances of a problem requires ˝.n/ times the resources for a single instance, even to achieve success probability 2 ...
Book
"The aim of this book is to present the strongest possible version of
G¨odel's incompleteness theorem, using an information-theoretic approach
based on the size of com...
APAL
2006
13 years 7 months ago
2006
I present a new syntactical method for proving the Interpolation Theorem for the implicational fragment of intuitionistic logic and its substructural subsystems. This method, like...