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...
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...
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...
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...
Abstract. Westudy cut-elimination in first-orderclassical logic. Weconstructa sequenceofpolynomiallength proofs having a non-elementary number of different cut-free normal forms....