-Luzin sets, nonatomic -fields and -independent sets
-quasiminimal enumeration degrees.
Calcoli generali con «tipi» e Logiche generalizzate
In this paper we introduce a notion of "Generalized Logic" and we study some of its properties.
Calcolo dei predicati e concetti metateorici in una teoria base dei fondamenti della Matematica
I primi elementi della sintassi e della semantica del Calcolo dei Predicati del primo ordine (predicati, proposizioni, formule, interpretazioni, ecc.) sono introdotti nell'ambiente delle teorie base dei Fondamenti della Matematica di [11]. Il problema della verità e falsità delle proposizioni è affontato introducendo, a fianco delle ordinarie qualità , , che non possono valutare tutte le proposizioni (Teorema 1), nuovi «oggetti metateorici», le metaqualità , che, indipendenti dalle relazioni...
Calcul des relations inverses
Calcul des séquents et déduction naturelle pour la logique trivalente de Lukasiewicz
Calcul syntaxique des modèles et calcul des formules internes
Calculating self-referential statements
Calculations of graded ill-known sets
To represent a set whose members are known partially, the graded ill-known set is proposed. In this paper, we investigate calculations of function values of graded ill-known sets. Because a graded ill-known set is characterized by a possibility distribution in the power set, the calculations of function values of graded ill-known sets are based on the extension principle but generally complex. To reduce the complexity, lower and upper approximations of a given graded ill-known set are used at the...
Caliber (, ω) is not productive
Call-by-value solvability
Call-by-value Solvability
The notion of solvability in the call-by-value λ-calculus is defined and completely characterized, both from an operational and a logical point of view. The operational characterization is given through a reduction machine, performing the classical β-reduction, according to an innermost strategy. In fact, it turns out that the call-by-value reduction rule is too weak for capturing the solvability property of terms. The logical characterization is given through an intersection type assignment system,...
Can we assign the Borel hulls in a monotone way?
A hull of A ⊆ [0,1] is a set H containing A such that λ*(H) = λ*(A). We investigate all four versions of the following problem. Does there exist a monotone (with respect to inclusion) map that assigns a Borel/ hull to every negligible/measurable subset of [0,1]? Three versions turn out to be independent of ZFC, while in the fourth case we only prove that the nonexistence of a monotone hull operation for all measurable sets is consistent. It remains open whether existence here is also consistent....
Cancellation of Abelian groups of finite rank modulo elementary equivalence.
Canonical extensions of Stone and double Stone algebras: the natural way
Canonical Objects in Classes of (n, V)-Groupoids
AMS Subj. Classification: 03C05, 08B20Free algebras are very important in studying classes of algebras, especially varieties of algebras. Any algebra that belongs to a given variety of algebras can be characterized as a homomorphic image of a free algebra of that variety. Describing free algebras is an important task that can be quite complicated, since there is no general method to resolve this problem. The aim of this work is to investigate classes of groupoids, i.e. algebras with one binary operation,...
Cantor sets in Prohorov spaces
Cantor-Bernstein theorem for -algebras
Cantors Diagonalprinzip für Kategorien.
Capacitability and determinacy