Related papers: Countable Random Sets: Uniqueness in Law and Const…
In this Phd. thesis, a structural analysis of construction schemes is developed. The importance of this study will be justified by constructing several distinct combinatorial objects which have been of great interest in mathematics. We then…
All constructive methods employed in modern mathematics produce only countable sets, even when designed to transcend countability. We show that any constructive argument for uncountability -- excluding diagonalization techniques --…
A structural analysis of construction schemes is developed. That analysis is used to give simple and new constructions of combinatorial objects which have been of interest to set theorists and topologists. We then continue the study of…
We introduce a topology on the space of all isomorphism types represented in a given class of countable models, and use this topology as an aid in classifying the isomorphism types. This mixes ideas from effective descriptive set theory and…
This paper investigates the possibility of constructive extraction of measurable selector from set-valued maps which may commonly arise in viability theory, optimal control, discontinuous systems etc. For instance, existence of solutions to…
We formalize an existing computability-theoretic method of presenting first-order structures whose domains have the cardinality of the continuum. Work using these methods until now has emphasized their topological properties. We shift the…
In which a review of the concept of countability is done in mathematics, subjecting review some of the theorems so far accepted, showing their inconsistency and also taking concrete elements on the countability of all the powers of the set…
We study (strong) first countability of locally solid convergence structures on Archimedean vector lattices. Among other results, we characterise those vector lattices for which relatively unform-, order-, and $\sigma$-order convergence,…
In this paper, we study the structure of the set of tilings produced by any given tile-set. For better understanding this structure, we address the set of finite patterns that each tiling contains. This set of patterns can be analyzed in…
In this note, we first discuss some properties of generated $\sigma$-fields and a simple approach to the construction of finite $\sigma$-fields. It is shown that the $\sigma$-field generated by a finite class of $\sigma$-distinct sets which…
We study from a statistical mechanics viewpoint some of the simplest mathematical objects, finite pure sets. Starting from the empty set, new generations are produced step by step, sets of the next generation being those whose elements are…
We survey the logical structure of constructive set theories and point towards directions for future research. Moreover, we analyse the consequences of being extensible for the logical structure of a given constructive set theory. We…
The paper introduces the notion of the size of countable sets that preserves the Part-Whole Principle and generalizes the notion of the cardinality of finite sets. The sizes of natural numbers, integers, rational numbers, and all their…
Combinatorial enumeration leads to counting generating functions presenting a wide variety of analytic types. Properties of generating functions at singularities encode valuable information regarding asymptotic counting and limit…
In the paper we study properties of the set of critical points for self-similar sets. We introduce simple condition that implies at most countably many critical values and we construct a self-similar set with uncountable set of critical…
Given positive integers $n,k$ with $k\leq n$, we consider the number of ways of choosing $k$ subsets of $\{1,\ldots,n\}$ in such a way that the union of these subsets gives $\{1,\ldots,n\}$ and they are not subsets of each other. We refer…
We examine the selective screenability property in topological groups. In the metrizable case we also give characterizations in terms of the Haver property and finitary Haver property respectively relative to left-invariant metrics. We…
We study constructively the relations between the finite cases of Dickson's lemma. Although there are many constructive proofs of them, the novel aspect of our proofs is the extraction of a corresponding bound. We provide some new one-step…
A rank is a notion in descriptive set theory that describes ranks such as the Cantor-Bendixson rank on the set of closed subsets of a Polish space, differentiability ranks on the set of differentiable functions in $C[0,1]$ such as the…
Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical computable model theory is used to examine the algorithmic structure of…