1322 search results - page 72 / 265 » Unsound Theorem Proving |
APAL
2000
14 years 11 months ago
2000
In this paper we study elementary submodels of a stable homogeneous structure. We improve the independence relation defined in [Hy]. We apply this to prove a structure theorem. We...
JGAA
2002
14 years 11 months ago
2002
We prove a very general representation theorem for posets and, as a corollary, deduce that any abstract simplicial complex has a geometric realization in the Euclidean space of di...
JSYML
2002
14 years 11 months ago
2002
An interpolation theorem holds for many standard modal logics, but first order S5 is a prominent example of a logic for which it fails. In this paper it is shown that a first orde...
ECCC
2010
14 years 10 months ago
2010
We initiate the study of the proof complexity of propositional encoding of (weak cases of) concrete independence results. In particular we study the proof complexity of Paris-Harr...
102
click to vote
STOC
1994
ACM
15 years 4 months ago
1994
ACM
Shannon's Coding Theorem shows that in order to reliably transmit a message of T bits over a noisy communication channel, only a constant slowdown factor is necessary in the ...