Category-theoretic models of linear Abadi & Plotkin logic.
Cauchy nets and open colorings.
Cauchy-like functional equation based on a class of uninorms
Commuting is an important property in any two-step information merging procedure where the results should not depend on the order in which the single steps are performed. In the case of bisymmetric aggregation operators with the neutral elements, Saminger, Mesiar and Dubois, already reduced characterization of commuting -ary operators to resolving the unary distributive functional equations. And then the full characterizations of these equations are obtained under the assumption that the unary...
Cayley's Theorem
The article formalizes the Cayley's theorem saying that every group G is isomorphic to a subgroup of the symmetric group on G.
Cayley's theorem for ordered groups: -minimality.
CCC posets of perfect trees
Čech-Stone remainders of spaces that look like
Cellularity of free products of Boolean algebras (or topologies)
The aim this paper is to present an answer to Problem 1 of Monk [10], [11]. We do this by proving in particular that if μ is a strong limit singular cardinal, and then there are Boolean algebras such that . Further we improve this result, deal with the method and the necessity of the assumptions. In particular we prove that if is a ccc Boolean algebra and then satisfies the λ-Knaster condition (using the “revised GCH theorem”).
Centraliser dimension and universal classes of groups.
Certain partitions on a set and their applications to different classes of graded algebras
Let and be two pointed sets. Given a family of three maps , this family provides an adequate decomposition of as the orthogonal disjoint union of well-described -invariant subsets. This decomposition is applied to the structure theory of graded involutive algebras, graded quadratic algebras and graded weak -algebras.
Certaines Équations Fonctionnelles Pesudo-Booléennes Généralisées
Certaines équations fonctionnelles pseudo-booléennes généralisées.
C'est beau et chaud
CH and the Sacks property
We show the consistency of CH and the statement “no ccc forcing has the Sacks property” and derive some consequences for ccc -bounding forcing notions.
Chain conditions and products
Chain conditions in maximal models
We present two varations which create maximal models relative to certain counterexamples to Martin’s Axiom, in hope of separating certain classical statements which fall between MA and Suslin’s Hypothesis. One of these models is taken from [19], in which we maximize relative to the existence of a certain type of Suslin tree, and then force with that tree. In the resulting model, all Aronszajn trees are special and Knaster’s forcing axiom ₃ fails. Of particular interest is the still open question...
Chaînes de théories universelles
Chains and antichains in Boolean algebras
We give an affirmative answer to problem DJ from Fremlin’s list [8] which asks whether implies that every uncountable Boolean algebra has an uncountable set of pairwise incomparable elements.
Chains in Ehrenfeucht Mostowski models
Chains of Decompositions and -Ary Relations