Modeling of Extreme Values via Exponential Normalization Compared with Linear and Power Normalization

cDNA Microarray Data Normalization

Linear Logic and Strong Normalization

Strong normalization for linear logic requires elaborated rewriting techniques. In this paper we give a new presentation of MELL proof nets, without any commutative cut-elimination rule. We show how this feature induces a compact and simple proof of strong normalization, via reducibility candidates. It is the first proof of strong normalization for MELL which does not rely on any form of conflu...

Normalization via Rewrite Closures

Truth Values Algebras and Proof Normalization

We extend the notion of Heyting algebra to a notion of truth values algebra and prove that a theory is consistent if and only if it has a B-valued model for some non trivial truth values algebra B. A theory that has a B-valued model for all truth values algebras B is said to be super-consistent. We prove that super-consistency is a model-theoretic sufficient condition for strong normalization.

SMALL VALUES OF POLYNOMIALS AND POTENTIALS WITH Lp NORMALIZATION

For a polynomial P of degree ≤ n, normalized by the condition 1 2π ∫ 2π 0 | P (re) |p dθ = 1, we show that E(P ; r; ε) := {z :| z |≤ r, | P (z) |≤ εn} has cap at most rεκnp, where κnp ≤ 2 is explicitly given and sharp for each n, r. Similar estimates are given for other normalizations, such as p = 0, and for planar measure, and for generalized polynomials and potentials, thereby extending work ...