Covering by special Cantor sets.
Covering by special Cantor sets
This paper deals with questions of how many compact subsets of certain kinds it takes to cover the space of irrationals, or certain of its subspaces. In particular, given , we consider compact sets of the form , where for all, or for infinitely many, . We also consider “-splitting” compact sets, i.e., compact sets such that for any and , .
Coverings and dimensions in infinite profinite groups
Answering a question of Miklós Abért, we prove that an infinite profinite group cannot be the union of less than continuum many translates of a compact subset of box dimension less than 1. Furthermore, we show that it is consistent with the axioms of set theory that in any infinite profinite group there exists a compact subset of Hausdorff dimension 0 such that one can cover the group by less than continuum many translates of it.
CPO-models for second order lambda calculus with recursive types and subtyping
Craig Interpolation Theorem for Classical Propositional Logic with some Probability Operators
Craig's interpolation theorem, in computation theory
Si espongono alcuni risultati, provati dall’Autore negli articoli citati nella bibliografia, a proposito della complessità del teorema d’interpolazione di Craig: con ciò si intende la relazione tra la lunghezza (cioè il numero di simboli) della formula e la lunghezza di e , ove è un’implicazione valida, e è un interpolante, come esibito dal teorema di interpolazione stesso. Si intende altresì sottolineare la rilevanza dello studio della complessità dell’interpolazione per far luce su alcuni...
Critical theories of varieties of semigroups satisfying a permutation identity.
Crossing-bounded computations and their relation to the LBA-problem
Cupping and noncapping in the R.E. weak truth table and turing degrees.
Curry algebras
In [6] da Costa has introduced a new hierarchy , of logics that are both paraconsistent and paracomplete. Such logics are now known as non-alethic logics. In this article we present an algebraic version of the logics and study some of their properties.
Cut elimination for impredicative infinitary systems. Part II Ordinal analysis for iterated inductive definitions.
Cut properties of resemblance
The resemblance relation is used to reflect some real life situations for which a fuzzy equivalence is not suitable. We study the properties of cuts for such relations. In the case of a resemblance on a real line we show that it determines a special family of crisp functions closely connected to its cut relations. Conversely, we present conditions which should be satisfied by a collection of real functions in in order that this collection determines a resemblance relation.
Cut-elimination for impredicative infinitary systems. Part I. Ordinal-analysis for ID1.
Cuts of real classes
Cyclic congruences of slim semimodular lattices and non-finite axiomatizability of some finite structures
We give a new proof of the fact that finite bipartite graphs cannot be axiomatized by finitely many first-order sentences among finite graphs. (This fact is a consequence of a general theorem proved by L. Ham and M. Jackson, and the counterpart of this fact for all bipartite graphs in the class of all graphs is a well-known consequence of the compactness theorem.) Also, to exemplify that our method is applicable in various fields of mathematics, we prove that neither finite simple groups, nor the...
Cyclic monads and their applications.
Cyclic ordered groups and MV-algebras
Cyclically compact operators in Banach spaces.
Cyclically ordered sets
Cylinder problem