Sciweavers

1322 search results - page 72 / 265
» Unsound Theorem Proving
Sort
View
APAL
2000
84views more  APAL 2000»
13 years 7 months ago
Strong Splitting in Stable Homogeneous Models
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...
Tapani Hyttinen, Saharon Shelah
JGAA
2002
74views more  JGAA 2002»
13 years 7 months ago
Realization of Posets
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...
Patrice Ossona de Mendez
JSYML
2002
114views more  JSYML 2002»
13 years 7 months ago
Interpolation for First Order S5
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...
Melvin Fitting
ECCC
2010
72views more  ECCC 2010»
13 years 6 months ago
Paris-Harrington tautologies
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...
Lorenzo Carlucci, Nicola Galesi, Massimo Lauria
STOC
1994
ACM
134views Algorithms» more  STOC 1994»
13 years 11 months ago
A coding theorem for distributed computation
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 ...
Sridhar Rajagopalan, Leonard J. Schulman