Related papers: On construction schemes: building the uncountable …

Many random combinatorial objects have a component structure whose joint distribution is equal to that of a process of mutually independent random variables, conditioned on the value of a weighted sum of the variables. It is interesting to…

We examine various categorical structures that can and cannot be constructed. We show that total computable functions can be mimicked by constructible functors. More generally, whatever can be done by a Turing machine can be constructed by…

With this work we aim to show how Mathematica can be a useful tool to investigate properties of combinatorial structures. Specifically, we will face enumeration problems on independent subsets of powers of paths and cycles, trying to…

The present note sketches a theory of constructs.

We study the properties of the constructible universe, L, over intuitionistic theories. We give an extended set of fundamental operations which is sufficient to generate the universe over Intuitionistic Kripke-Platek set theory without…

In this thesis we explore natural procedures through which topological structure can be constructed from specific semigroups. We will do this in two ways: 1) we equip the semigroup object itself with a topological structure, and 2) we find…

Using the notion of existentially closed structures, we obtain embedding theorems for groups and Lie algebras. We also prove the existence of some groups and Lie algebras with prescribed properties.

We study the model theory of countable right-angled buildings with infinite residues. For every Coxeter graph we obtain a complete theory with a natural axiomatisation, which is $\omega$-stable and equational. Furthermore, we provide sharp…

We discuss a structural approach to subset-sum problems in additive combinatorics. The core of this approach are Freiman-type structural theorems, many of which will be presented through the paper. These results have applications in various…

Bishop's constructive mathematics school rejects the Law of Excluded Middle, but instead vastly makes use of weaker versions of the Choice. In this paper we pioneer an example, which shows that this road is not consistent, as our example…

This is a largely expository paper in which we discuss various sets having a Catalan number of objects and some well-known bijections between these sets presented in a new and hopefully interesting way. We call these concepts "bookshelf"…

This work is meant to be a step towards the formal definition of the notion of algorithm, in the sense of an equivalence class of programs working "in a similar way". But instead of defining equivalence transformations directly on programs,…

We show that constructible models of arbitrary complete continuous first-order theories are unique up to isomorphism.

We extend the usual internal logic of a (pre)topos to a more general interpretation, called the stack semantics, which allows for "unbounded" quantifiers ranging over the class of objects of the topos. Using well-founded relations inside…

We develop an axiomatic framework for fractal analysis and fractal number theory grounded in hierarchies of definability. Central to this approach is a sequence of formal systems F_n, each corresponding to a definability level S_n contained…

The apparent impossibility of extending non-relativistic quantum mechanics to a relativistic quantum theory is shown to be due to the insufficient structural richness of the field of complex numbers over which quantum mechanics is built. A…

Exponential-constructible functions are an extension of the class of constructible functions. This extension was formulated by Cluckers-Loeser in the context of semi-algebraic and sub-analytic structures, when they studied stability under…

A progress report on two recent theoretical approaches proposed to understand the physics of irreversible fractal aggregates showing up a structural transition from a rather dense to a more multibranched growth is presented. In the first…

This essay aims to propose construction theory, a new domain of theoretical research on machine construction, and use it to shed light on a fundamental relationship between living and computational systems. Specifically, we argue that…

We reprove the countable splitting lemma by adapting Nawrotzki's algorithm which produces a sequence that converges to a solution. Our algorithm combines Nawrotzki's approach with taking finite cuts. It is constructive in the sense that…