The following notion of forcing was introduced by Grigorieff [2]: Let I ⊂ ω be an ideal, then P is the set of all functions p : ω → 2 such that dom(p) ∈ I. The usual Cohen forcing corresponds to the case when I is the ideal of finite subsets of ω. In [2] Grigorieff proves that if I is the dual of a p-point ultrafilter, then ω1 is preserved in the generic extension. Later, when Shelah introduced...

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

Absorptions are generally employed in Description Logics (DL) reasoners in a uniform way regardless of the structure of an input knowledge base. In this paper we present an approach to encode some state-of-the-art absorption techniques into a state space planner, aiming to achieve a better solution. The planner applies appropriate operators to general axioms and produces a solution with a minim...

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...

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 ...

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.

Veblen has given a set of axioms for geometry.!. The first eight of these are as follows : % Axiom I. There exist at least two distinct points. Axiom II. If points A, B, C are in the order ABC, they are in the order CBA. Axiom III. If points A, B, C are in the order ABC, they are not in the order BCA. Axiom IV. If points A, B, C are in the order ABC, then A is distinct from C. Axiom V. If A and...