Results 1  10
of
2,012
A simplified proof desingularization and applications
, 2003
"... This paper contains a short and simplified proof of desingularization over fields of characteristic zero, together with various applications to other problems in algebraic geometry (among others, the study of the behavior of desingularization of families of embedded schemes, and a formulation of d ..."
Abstract

Cited by 43 (6 self)
 Add to MetaCart
This paper contains a short and simplified proof of desingularization over fields of characteristic zero, together with various applications to other problems in algebraic geometry (among others, the study of the behavior of desingularization of families of embedded schemes, and a formulation
Two Simplified Proofs for Roberts ’ Theorem
"... Roberts (1979) showed that every social choice function that is expost implementable in private value settings must be weighted VCG, i.e. it maximizes the weighted social welfare. This paper provides two simplified proofs for this. The first proof uses the same underlying keypoint, but significant ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Roberts (1979) showed that every social choice function that is expost implementable in private value settings must be weighted VCG, i.e. it maximizes the weighted social welfare. This paper provides two simplified proofs for this. The first proof uses the same underlying key
Modularity of Confluence: A Simplified Proof
, 1994
"... In this note we present a simple proof of a result of Toyama which states that the disjoint union of confluent term rewriting systems is confluent. 1985 Mathematics Subject Classification: 68Q50 1987 CR Categories: F.4.2 Key Words and Phrases: theory of computation, term rewriting systems, modular ..."
Abstract

Cited by 12 (5 self)
 Add to MetaCart
In this note we present a simple proof of a result of Toyama which states that the disjoint union of confluent term rewriting systems is confluent. 1985 Mathematics Subject Classification: 68Q50 1987 CR Categories: F.4.2 Key Words and Phrases: theory of computation, term rewriting systems
Simplified Proof of the Fourier Sampling Theorem
 Information Processing Letters 75 (2000
, 2000
"... We give a short and simple proof of Hales and Hallgren's Fourier Sampling Theorem ["Quantum Fourier Sampling Simplified", Proceedings of the ThirtyFirst Annual ACM Symposium on Theory of Computing, ACM Press, May 1999]. The transparency of our prooftechnique allows us to generalize a ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We give a short and simple proof of Hales and Hallgren's Fourier Sampling Theorem ["Quantum Fourier Sampling Simplified", Proceedings of the ThirtyFirst Annual ACM Symposium on Theory of Computing, ACM Press, May 1999]. The transparency of our prooftechnique allows us to generalize
Simplified proofs of the Cartan structure equations
"... The two Cartan structure equations are proven straightforwardly through use of a simplified format for the tetrad postulate. In so doing a new general condition on Cartan’s differential geometry is discovered and illustrated with respect to the tetrads of a propagating, circularly polarized, wave. ..."
Abstract
 Add to MetaCart
The two Cartan structure equations are proven straightforwardly through use of a simplified format for the tetrad postulate. In so doing a new general condition on Cartan’s differential geometry is discovered and illustrated with respect to the tetrads of a propagating, circularly polarized, wave.
SIMPLIFIED PROOF OF THE THEOREM OF VAROPOULOS IN THE COMMUTATIVE CASE
, 802
"... Abstract. We give continuity properties of bitraces on (possibly noncommutative) Banach ∗algebras based on the Closed Graph Theorem, leading to a simplified proof of the Theorem of Varopoulos in the commutative case. 1. ..."
Abstract
 Add to MetaCart
Abstract. We give continuity properties of bitraces on (possibly noncommutative) Banach ∗algebras based on the Closed Graph Theorem, leading to a simplified proof of the Theorem of Varopoulos in the commutative case. 1.
Program Extraction, Simplified ProofTerms and Realizability
, 1996
"... This paper forms part of a programme for extracting programs from proofs. Many people have done such work. What distinguishes our work is that our aim is to start with "real proofs", that is to say, proofs in a mathematics book  as opposed to (e.g. computer generated) proofs in formal log ..."
Abstract

Cited by 5 (5 self)
 Add to MetaCart
This paper forms part of a programme for extracting programs from proofs. Many people have done such work. What distinguishes our work is that our aim is to start with "real proofs", that is to say, proofs in a mathematics book  as opposed to (e.g. computer generated) proofs in formal
Simplifying proofs in Fitchstyle natural deduction systems
, 2004
"... We present an algorithm for simplifying Fitchstyle natural deduction proofs in classical firstorder logic. We formalize Fitchstyle natural deduction as a denotational proof language, N DL, with a rigorous syntax and semantics. Based on that formalization, we define an array of simplifying transfo ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
We present an algorithm for simplifying Fitchstyle natural deduction proofs in classical firstorder logic. We formalize Fitchstyle natural deduction as a denotational proof language, N DL, with a rigorous syntax and semantics. Based on that formalization, we define an array of simplifying
Characterization Of Polynomial Prime Bidecompositions  A Simplified Proof
, 1995
"... Bidecompositions, i.e., solutions to r p = s q, play a central role in the study of uniqueness properties of complete decompositions with respect to functional composition. In [Rit22] all bidecompositions using polynomials over the complex number field have been characterized. Later the result was g ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
was generalized to more general fields. All proofs tend to be rather long and involved. The object of this paper is to develop a version that is simpler than the existing ones, while keeping completely elementary, thus making it accessible to a wider community.
Simplifying proofs of linearisability using layers of abstraction
"... Abstract: Linearisability has become the standard correctness criterion for concurrent data structures, ensuring that every history of invocations and responses of concurrent operations has a matching sequential history. Existing proofs of linearisability require one to identify socalled linearis ..."
Abstract
 Add to MetaCart
Abstract: Linearisability has become the standard correctness criterion for concurrent data structures, ensuring that every history of invocations and responses of concurrent operations has a matching sequential history. Existing proofs of linearisability require one to identify so
Results 1  10
of
2,012