Skew -sets coincide with -posets
Slender modules, endo-slender abelian groups and large cardinals
Small almost free modules with prescribed topological endomorphism rings
Small profinite m-stable groups
A small profinite m-stable group has an open abelian subgroup of finite ℳ-rank and finite exponent.
Small sets in convex geometry and formal independence over ZFC.
Smooth and sharp thresholds for random -XOR-CNF satisfiability
The aim of this paper is to study the threshold behavior for the satisfiability property of a random -XOR-CNF formula or equivalently for the consistency of a random Boolean linear system with variables per equation. For we show the existence of a sharp threshold for the satisfiability of a random -XOR-CNF formula, whereas there are smooth thresholds for and .
Smooth graphs
A graph on is called -smooth if for each uncountable , is isomorphic to for some finite . We show that in various models of ZFC if a graph is -smooth, then is necessarily trivial, i.eėither complete or empty. On the other hand, we prove that the existence of a non-trivial, -smooth graph is also consistent with ZFC.
Smooth implications on a finite chain
Mas et al. adapted the notion of smoothness, introduced by Godo and Sierra, and discussed two kinds of smooth implications (a discrete counterpart of continuous fuzzy implications) on a finite chain. This work is devoted to exploring the formal relations between smoothness and other six properties of implications on a finite chain. As a byproduct, several classes of smooth implications on a finite chain are characterized.
Sober spaces and continuations.
Sobre funciones de negación en [0,1].
In [12] Trillas proved that (P(X),∩,U,-n) is a quasi-Boolean algebra if and only if its negation has an additive generator. In this paper such result is generalized to PJ(X) and the symmetry of J is analized.From the results of Esteva ([11]) weak negations on [0,1] are studied; it is proved that such functions are monotonic, non-increasing, left-continuous and symmetrical with respect to y=x. Their classification relative to C([0,1]) is also given and a canonical element of each class is found....
Sobre funciones de negación en la teoría de conjuntos difusos.
En su trabajo de 1973, ya clásico, Bellman y Giertz probaron que P(X) es un retículo distributivo con máximo y mínimo sólo (con hipótesis muy razonables) bajo las usuales definiciones (A U B)(x) = máx {A(x),B(x)}, (A ∩ B)(x) = mín {A(x),B(x)}, tratando escasamente el formalismo analítico relativo a la negación. En el presente trabajo se prueba que tal P(X) es un álgebra de DeMorgan si y sólo si la función de negación posee generador aditivo y que tales negaciones constituyen, en un cierto grupo...
Sobre Una Definicion De Cardinales Finitos En Un Topos Arbitrario.
Software cost estimation with fuzzy inputs: Fuzzy modelling and aggregation of cost drivers
Parametric software cost estimation models are well-known and widely used estimation tools, and several fuzzy extensions have been proposed to introduce a explicit handling of imprecision and uncertainty as part of them. Nonetheless, such extensions do not consider two basic facts that affect the inputs of software cost parametric models: cost drivers are often expressed through vague linguistic categories, and in many cases cost drivers are better expressed in terms of aggregations of second-level...
Solution d'un problème de la théorie des relations
Solution of a problem of Ulam on countable sequences of sets
Solution to a problem of Gandy's
Solving algebraic problems in propositional logic by tableau.
Solving word equations
Some 2-point sets
Chad, Knight & Suabedissen [Fund. Math. 203 (2009)] recently proved, assuming CH, that there is a 2-point set included in the union of countably many concentric circles. This result is obtained here without any additional set-theoretic hypotheses.
Some additive properties of sets of real numbers