We consider the class I_o of elements without indecomposable factor in fdifferent abstract structures and prove in these cases that Io is strictly included in the class of infinitely divisible elements. The structures investigated are convex cones, q-probability, and statistical experiments
In this paper some of the basics of classification theory for abstract elementary classes are discus...
We provide universal algebraic characterizations (in the sense of not involving any "logical notion"...
AbstractWe study a class C of ℵ0-categorical simple structures such that every M in C has uncomplica...
We consider the class I_o of elements without indecomposable factor in fdifferent abstract structure...
AbstractLet f be an infinitely divisible characteristic function without normal factor. We establish...
Let C be the convex cone USC*([0, 1], R+) of increasing upper semicontinuous functions g : [0, 1] --...
In this very short paper, we bring together some very basic definitions and facts regarding the indu...
Bondesson (1992) said “Since a lot of the standard distributions now as known to be infinitely divis...
In this paper we study a specific subclass of abstract elementary classes. We construct a notion of ...
A useful method of proving the finite decidability of an equationally definable class V of algebras...
We provide universal algebraic characterizations (in the sense of not involving any “logical notion”...
We combine computable structure theory and algorithmic learning theory to study learning of families...
We combine computable structure theory and algorithmic learning theory to study learning of families...
We combine computable structure theory and algorithmic learning theory to study learning of families...
We combine computable structure theory and algorithmic learning theory to study learning of families...
In this paper some of the basics of classification theory for abstract elementary classes are discus...
We provide universal algebraic characterizations (in the sense of not involving any "logical notion"...
AbstractWe study a class C of ℵ0-categorical simple structures such that every M in C has uncomplica...
We consider the class I_o of elements without indecomposable factor in fdifferent abstract structure...
AbstractLet f be an infinitely divisible characteristic function without normal factor. We establish...
Let C be the convex cone USC*([0, 1], R+) of increasing upper semicontinuous functions g : [0, 1] --...
In this very short paper, we bring together some very basic definitions and facts regarding the indu...
Bondesson (1992) said “Since a lot of the standard distributions now as known to be infinitely divis...
In this paper we study a specific subclass of abstract elementary classes. We construct a notion of ...
A useful method of proving the finite decidability of an equationally definable class V of algebras...
We provide universal algebraic characterizations (in the sense of not involving any “logical notion”...
We combine computable structure theory and algorithmic learning theory to study learning of families...
We combine computable structure theory and algorithmic learning theory to study learning of families...
We combine computable structure theory and algorithmic learning theory to study learning of families...
We combine computable structure theory and algorithmic learning theory to study learning of families...
In this paper some of the basics of classification theory for abstract elementary classes are discus...
We provide universal algebraic characterizations (in the sense of not involving any "logical notion"...
AbstractWe study a class C of ℵ0-categorical simple structures such that every M in C has uncomplica...
DOI
Add to ORKG