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
Champs de Markov cachés flous et segmentation d'images
Changing cofinality of a measurable cardinal (An alternative proof)
Changing cofinality of cardinals
Changing measurable into accessible cardinals [Book]
Characteristic of Rings. Prime Fields
The notion of the characteristic of rings and its basic properties are formalized [14], [39], [20]. Classification of prime fields in terms of isomorphisms with appropriate fields (ℚ or ℤ/p) are presented. To facilitate reasonings within the field of rational numbers, values of numerators and denominators of basic operations over rationals are computed.
Characteristic sets of a system of equivalence relations
Characterization of a full set of probabilities on some posets.
Characterization of binary operations on the unit interval satisfying the generalized modus ponens inference rule.
Characterization of generic extensions of models of set theory
Characterizations of certain classes of posets having Gs-lattices of a relatively small size
Characterizations of certain general and reproductive solutions of arbitrary equations
Characterizations of commuting relations
Characterizing the polynomial hierarchy by alternating auxiliary pushdown automata