Sciweavers

884 search results - page 59 / 177
» A Proof Theory for DL-Lite
Sort
View
FOCM
2006
87views more  FOCM 2006»
14 years 12 months ago
Index Pairs Algorithms
We introduce some modifications and extensions of the concept od index pair in the Conley index theory. We then show how these concepts may be used to overcome some difficulties in...
Marian Mrozek
CORR
2011
Springer
156views Education» more  CORR 2011»
14 years 3 months ago
From joint convexity of quantum relative entropy to a concavity theorem of Lieb
This paper provides a succinct proof of a 1973 theorem of Lieb that establishes the concavity of a certain trace function. The development relies on a deep result from quantum info...
Joel A. Tropp
APAL
2010
123views more  APAL 2010»
14 years 9 months ago
Classical descriptive set theory as a refinement of effective descriptive set theory
The (effective) Suslin-Kleene Theorem is obtained as a corollary of a standard proof of the classical Suslin Theorem, by noticing that it is mostly constructive and applying to it...
Yiannis N. Moschovakis
CIE
2007
Springer
15 years 6 months ago
RZ: A Tool for Bringing Constructive and Computable Mathematics Closer to Programming Practice
Realizability theory is not just a fundamental tool in logic and computability. It also has direct application to the design and implementation of programs, since it can produce co...
Andrej Bauer, Christopher A. Stone
AISC
2010
Springer
15 years 3 months ago
A Formal Quantifier Elimination for Algebraically Closed Fields
We prove formally that the first order theory of algebraically closed fields enjoy quantifier elimination, and hence is decidable. This proof is organized in two modular parts. We ...
Cyril Cohen, Assia Mahboubi