Equivalence of differentiable mappings and analytic mappings

Complex Analytic Mappings

Analytic Mappings on Hyperfinite Sets

Let S and T be hyperfinite sets in an N]-saturated nonstandard universe. The following are equivalent: m 1*1 ~ l (l) rff ~ • • (ii) There is a bijection from 5 onto T whose graph is Borel (over the internal subsets of S x T). This follows from somewhat more general results about analytic partial functions on hyperfinite sets, the proofs of which use Choquet's theorem on the capacitibility of an...

On distribution functions of the derivatives of weakly differentiable mappings

Spider: Bringing Non-equivalence Mappings to OAEI

With the large majority of existing matching systems focusing on deriving equivalence mappings, OAEI has been primarily focused on assessing such kind of relations. As the field inevitably advances towards the discovery of more complex mappings, the contest will need to reflect such changes as well. In this paper we present Spider, a system that provides alignments containing not only equivalen...

Mappings On Decomposable Combinatorial Structures: Analytic Approach

Combinatorics, Probability & Computing / Volume 11 / Issue 01 / January 2002, pp 61 78 DOI: 10.1017/S0963548301005016, Published online: 14 February 2002 Link to this article: http://journals.cambridge.org/abstract_S0963548301005016 How to cite this article: E. MANSTAVICIUS (2002). Mappings on Decomposable Combinatorial Structures: Analytic Approach. Combinatorics, Probability & Computing, 11, ...