Results 1  10
of
319,484
Duality Principles And Reduction Theorems
, 2000
"... . We introduce a fairly general class of Banach function spaces X given by kfk X := kf k X , where f is defined on a totally oefinite nonatomic measure space (R; ), f is the nonincreasing rearrangement of f with respect to and X is certain rearrangementinvariant space over the inter ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
to certain more manageable weighted inequalities. Reduction theorems are then applied to obtain a characterization of embeddings between X spaces. 1. Introduction Let (R; ) be a totally oefinite nonatomic measure space. Let M(R;) be the set of all measurable a.e. finite real functions on R. By M
Another proof of the Semistable Reduction Theorem
"... We give a new proof of the Semistable Reduction Theorem for curves. The main idea is to present a curve Y over a local field K as a finite cover of the projective line X = P1K. By successive blowups (and after replacing K by a suitable finite extension) we construct a semistable model of X whose nor ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We give a new proof of the Semistable Reduction Theorem for curves. The main idea is to present a curve Y over a local field K as a finite cover of the projective line X = P1K. By successive blowups (and after replacing K by a suitable finite extension) we construct a semistable model of X whose
A STACKY SEMI–STABLE REDUCTION THEOREM
"... Abstract. We prove a stack–theoretic version of the semi–stable reduction theorem of ..."
Abstract
 Add to MetaCart
Abstract. We prove a stack–theoretic version of the semi–stable reduction theorem of
A Syntactic Approach to Type Soundness
 INFORMATION AND COMPUTATION
, 1992
"... We present a new approach to proving type soundness for Hindley/Milnerstyle polymorphic type systems. The keys to our approach are (1) an adaptation of subject reduction theorems from combinatory logic to programming languages, and (2) the use of rewriting techniques for the specification of the la ..."
Abstract

Cited by 634 (25 self)
 Add to MetaCart
We present a new approach to proving type soundness for Hindley/Milnerstyle polymorphic type systems. The keys to our approach are (1) an adaptation of subject reduction theorems from combinatory logic to programming languages, and (2) the use of rewriting techniques for the specification
The Foundation of a Generic Theorem Prover
 Journal of Automated Reasoning
, 1989
"... Isabelle [28, 30] is an interactive theorem prover that supports a variety of logics. It represents rules as propositions (not as functions) and builds proofs by combining rules. These operations constitute a metalogic (or `logical framework') in which the objectlogics are formalized. Isabell ..."
Abstract

Cited by 471 (49 self)
 Add to MetaCart
Isabelle [28, 30] is an interactive theorem prover that supports a variety of logics. It represents rules as propositions (not as functions) and builds proofs by combining rules. These operations constitute a metalogic (or `logical framework') in which the objectlogics are formalized
A reduction theorem for capacity of positive maps
, 2005
"... We prove a reduction theorem for capacity of positive maps of finite dimensional C ∗ −algebras, thus reducing the computation of capacity to the case when the image of a nonscalar projection is never a projection. ..."
Abstract
 Add to MetaCart
We prove a reduction theorem for capacity of positive maps of finite dimensional C ∗ −algebras, thus reducing the computation of capacity to the case when the image of a nonscalar projection is never a projection.
The irreducibility of the space of curves of given genus
 Publ. Math. IHES
, 1969
"... Fix an algebraically closed field k. Let Mg be the moduli space of curves of genus g over k. The main result of this note is that Mg is irreducible for every k. Of course, whether or not M s is irreducible depends only on the characteristic of k. When the characteristic s o, we can assume that k ~ ..."
Abstract

Cited by 512 (2 self)
 Add to MetaCart
is to construct families of curves X, some singular, with pa(X)=g, over nonsingular parameter spaces, which in some sense contain enough singular curves to link together any two components that Mg might have. The essential thing that makes this method work now is a recent " stable reduction theorem "
reduction theorem for circulant weighing matrices
"... Circulant weighing matrices of order n with weight k, denoted by WC(n, k), are investigated. Under some conditions, we show that the existence of WC(n, k) implies that of WCG, ~). Our results establish the nonexistence of WC(n,k) for the pairs (n,k) = (125,25), (44,36), ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Circulant weighing matrices of order n with weight k, denoted by WC(n, k), are investigated. Under some conditions, we show that the existence of WC(n, k) implies that of WCG, ~). Our results establish the nonexistence of WC(n,k) for the pairs (n,k) = (125,25), (44,36),
Results 1  10
of
319,484