Sciweavers

4767 search results - page 320 / 954
» Structures for Abstract Rewriting
Sort
View
AML
2008
84views more  AML 2008»
15 years 5 months ago
Model theory of the regularity and reflection schemes
Abstract. This paper develops the model theory of ordered structures that satisfy Keisler's regularity scheme, and its strengthening REF(L) (the reflection scheme) which is an...
Ali Enayat, Shahram Mohsenipour
JAR
2010
160views more  JAR 2010»
15 years 5 months ago
Declarative Representation of Proof Terms
Abstract. We present a declarative language inspired by the pseudonatural language used in Matita for the explanation of proof terms. We show how to compile the language to proof t...
Claudio Sacerdoti Coen
SAT
2010
Springer
152views Hardware» more  SAT 2010»
15 years 5 months ago
Simple but Hard Mixed Horn Formulas
Abstract. We study simple classes of mixed Horn formulas, in which the structure of the Horn part is drastically constrained. We show that the SAT problem for formulas in these cla...
Gayathri Namasivayam, Miroslaw Truszczynski
CORR
2010
Springer
115views Education» more  CORR 2010»
15 years 4 months ago
Approximately achieving Gaussian relay network capacity with lattice codes
Abstract--Recently, it has been shown that a quantize-mapand-forward scheme approximately achieves (within a constant number of bits) the Gaussian relay network capacity for arbitr...
Ayfer Özgür, Suhas N. Diggavi
JSYML
2011
84views more  JSYML 2011»
15 years 1 months ago
On the non-confluence of cut-elimination
Abstract. Westudy cut-elimination in first-orderclassical logic. Weconstructa sequenceofpolynomiallength proofs having a non-elementary number of different cut-free normal forms....
Matthias Baaz, Stefan Hetzl