Development of new algorithms in the area machine learning, especially clustering, comparative studies such as well testing according to software engineering principles requires availability labeled data sets. While standard benchmarks are made available, a broader range sets is necessary order avoid problem overfitting. In this context, theoretical works on axiomatization clustering algorithms...

In this paper, the Urysohn and completely Hausdorff axioms in general topology are generalized to L-topological spaces so as to be compatible with pointwise metrics. Some properties and characterizations are also derived

We prove the topological (or combinatorial) rigidity property for real polynomials with all critical points real and nondegenerate, which completes the last step in solving the density of Axiom A conjecture in real one-dimensional dynamics.

The purpose of this note is introduce a new axiom (called the Descent Axiom) in the theory of r-spin cohomological field theories. This axiom explains the origin of gravitational descendants in this theory. Furthermore, the Descent Axiom immediately implies the Vanishing Axiom, explicating the latter (which has no a priori analog in the theory of Gromov-Witten invariants), in terms of the multi...

we study different completeness definitions for two categories of lattice-valued cauchy spaces and the relations between these definitions. we also show the equivalence of a so-called completion axiom and the existence of a completion.

Nominalistic Logic (NL) is a new presentation of Paul Gilmore’s Intensional Type Theory (ITT) as a sequent calculus together with a succinct nominalization axiom (N) that permits names of predicates as individuals in certain cases. The logic has a flexible comprehension axiom, but no extensionality axiom and no infinity axiom, although axiom N is the key to the derivation of Peano’s postulates ...