Conjugacy in monoids.
Connectedness of the theory of non-surjective injections
Connections between cuts and maximum segments
Connections between different amoeba algebras
Connections between ideals of non-commutative generalizations of -algebras and ideals of their underlying lattices
Connectivity properties of sequential Boolean algebras
Consequences of compactness properties for abstract logics
Si determinano alcune restrizioni sulle possibili cardinalità dei modelli di teorie in logiche soddisfacenti alcune proprietà di compattezza. Si dà una caratterizzazione delle logiche -compatte generate da quantificatori di cardinalità. Si stabilisce che il primo cardinale tale che una logica è -compatta è debolmente inaccessibile e soddisfa la proprietà dell'albero. Dai risultati enunciati appare un raffronto assai particolareggiato fra i due concetti di -compattezza e -compattezza.
Conservación de convergencias en G(H) por un operador lineal.
Given a real separable Hilbert space H, we denote with S = {E(n) | n belongs to N} a sequence of closed linear subspaces of H.In previous papers, the strong, weak, a--> and b--> convergences are defined and characterized. Now, given a sequence S with strong, weak, a--> or b--> limit, and a linear operator of H, A, the sequence AS is studied.
Conservation Rules of Direct Sum Decomposition of Groups
In this article, conservation rules of the direct sum decomposition of groups are mainly discussed. In the first section, we prepare miscellaneous definitions and theorems for further formalization in Mizar [5]. In the next three sections, we formalized the fact that the property of direct sum decomposition is preserved against the substitutions of the subscript set, flattening of direct sum, and layering of direct sum, respectively. We referred to [14], [13] [6] and [11] in the formalization.
Conservative extensions and the two cardinal theorem for stable theories
Conservative extensions of models of arithmetic.
Considering uncertainty and dependence in Boolean, quantum and fuzzy logics
A degree of probabilistic dependence is introduced in the classical logic using the Frank family of -norms known from fuzzy logics. In the quantum logic a degree of quantum dependence is added corresponding to the level of noncompatibility. Further, in the case of the fuzzy logic with -states, (resp. -states) the consideration turned out to be fully analogous to (resp. considerably different from) the classical situation.
Consistency of the Silver dichotomy in generalised Baire space
Silver’s fundamental dichotomy in the classical theory of Borel reducibility states that any Borel (or even co-analytic) equivalence relation with uncountably many classes has a perfect set of classes. The natural generalisation of this to the generalised Baire space for a regular uncountable κ fails in Gödel’s L, even for κ-Borel equivalence relations. We show here that Silver’s dichotomy for κ-Borel equivalence relations in for uncountable regular κ is however consistent (with GCH), assuming...
Consistency proof without transfinite induction for a formal system for turing machines.
Consistency property and model existence theorem for second order negative languages with conjunctions and quantifications over sets of cardinality smaller than a strong limit cardinal of denumerable cofinality
Consistency statements in formal theories
Constructibility and shiftings of view
Constructibility in Ackermann's set theory [Book]
Constructing a maximal cofinitary group.
Constructing Binary Huffman Tree
Huffman coding is one of a most famous entropy encoding methods for lossless data compression [16]. JPEG and ZIP formats employ variants of Huffman encoding as lossless compression algorithms. Huffman coding is a bijective map from source letters into leaves of the Huffman tree constructed by the algorithm. In this article we formalize an algorithm constructing a binary code tree, Huffman tree.