Related papers: Countable Random Sets: Uniqueness in Law and Const…
We study randomness beyond $\Pi^1_1$-randomness and its Martin-L\"of type variant, introduced in \cite{MR2340241} and further studied in \cite{Continuous-higher-randomness}. The class given by the infinite time Turing machines (\ITTM s),…
Combinatorics, like computer science, often has to deal with large objects of unspecified (or unusable) structure. One powerful way to deal with such an arbitrary object is to decompose it into more usable components. In particular, it has…
Given a multiplicatively closed subset $S$ of the integers, there exist Structure Theorems for $LC$ modules over the localization $\mathbb{Z}S^{-1}$ that are "similar" to those of $LCA$ groups. The most notable one is the 1st Theorem: Given…
In this paper, we discuss a potential agenda for future work in the theory of random sets and belief functions, touching upon a number of focal issues: the development of a fully-fledged theory of statistical reasoning with random sets,…
We show that separability and second-countability are first-order properties among topological spaces definable in o-minimal expansions of $(\mathbb{R},<)$. We do so by introducing first-order characterizations -- definable separability and…
We consider a finite sequence of random points in a finite domain of a finite-dimensional Euclidean space. The points are sequentially allocated in the domain according to a model of cooperative sequential adsorption. The main peculiarity…
We study countable graphs that -- up to isomorphism and with probability one -- arise from a random process, in a similar fashion as the Rado graph. Unlike in the classical case, we do not require that probabilities assigned to pairs of…
The usual definition of the set of constructible reals is $\Sigma ^1_2$. This set can have a simpler definition if, for example, it is countable or if every real is constructible. H. Friedman asked if the set of constructible reals can be…
We investigate the enumerative geometry of point configurations in projective space. We define "projective configuration counts": these enumerate configurations of points in projective space such that certain specified subsets are in fixed…
Answering a question raised by V. V. Tkachuk, we present several examples of $\sigma$-compact spaces, some only consistent and some in ZFC, that are not countably tight but in which the closure of any discrete subset is countably tight. In…
We establish a near dichotomy between randomness and structure for the point counts of arbitrary projective cubic threefolds over finite fields. Certain "special" subvarieties, not unlike those in the Manin conjectures, dominate. We also…
We investigate the occurrence of additive and multiplicative structures in random subsets of the natural numbers. Specifically, for a Bernoulli random subset of $\mathbb{N}$ where each integer is included independently with probability…
We provide a systematic, thorough treatment of the foundations of probability theory and stochastic processes along the lines of E. Bishop's constructive analysis. Every existence result presented shall be a construction; and the input…
We consider the problem of characterizing isomorphisms of types, or, equivalently, constructive cardinality of sets, in the simultaneous presence of disjoint unions, Cartesian products, and exponentials. Mostly relying on results about…
The structures $\langle M,\subseteq^M\rangle$ arising as the inclusion relation of a countable model of sufficient set theory $\langle M,\in^M\rangle$, whether well-founded or not, are all isomorphic. These structures $\langle…
In the first part we construct some Buck measurable sets. In the second part we apply the Niven theorem for Buck's measure density to certain sets.
According to mathematical constructivism, a mathematical object can exist only if there is a way to compute (or "construct") it; so, what is non-computable is non-constructive. In the example of the quantum model, whose Fock states are…
The aim of this thesis is to determine classes of NP relations for which random generation and approximate counting problems admit an efficient solution. Since efficient rank implies efficient random generation, we first investigate some…
The notion of a k-automatic set of integers is well-studied. We develop a new notion - the k-automatic set of rational numbers - and prove basic properties of these sets, including closure properties and decidability.
The topic of this paper is the Finiteness Conjecture for minimally unsatisfiable clause-sets (MUs), stating that for each fixed deficiency (number of clauses minus number of variables) there are only finitely many patterns, given a certain…