Sciweavers

199 search results - page 9 / 40
» Denotations for Classical Proofs - Preliminary Results
Sort
View
JSYML
2010
107views more  JSYML 2010»
13 years 6 months ago
A proof of completeness for continuous first-order logic
Continuous first-order logic has found interest among model theorists who wish to extend the classical analysis of “algebraic” structures (such as fields, group, and graphs) ...
Arthur Paul Pedersen, Itay Ben-Yaacov
APAL
2005
154views more  APAL 2005»
13 years 7 months ago
A Sahlqvist theorem for distributive modal logic
In this paper we consider distributive modal logic, a setting in which we may add modalities, such as classical types of modalities as well as weak forms of negation, to the fragm...
Mai Gehrke, Hideo Nagahashi, Yde Venema
ICQNM
2007
IEEE
131views Chemistry» more  ICQNM 2007»
14 years 1 months ago
Comparison of two bounds of the quantum correlation set
— From a geometric viewpoint, quantum nonlocality between two parties is represented as the difference of two convex bodies, namely the sets of possible results of classical and ...
David Avis, Tsuyoshi Ito
PODC
2011
ACM
12 years 10 months ago
Locally checkable proofs
This work studies decision problems from the perspective of nondeterministic distributed algorithms. For a yes-instance there must exist a proof that can be verified with a distri...
Mika Göös, Jukka Suomela
SIGACT
2008
116views more  SIGACT 2008»
13 years 7 months ago
On-line bipartite matching made simple
We examine the classic on-line bipartite matching problem studied by Karp, Vazirani, and Vazirani [8] and provide a simple proof of their result that the Ranking algorithm for thi...
Benjamin E. Birnbaum, Claire Mathieu