Related papers: Closed-Constructible functions are Piece-Wise Clos…
A topological group $X$ is called connected if the only subsets which are both open and closed are the whole space $X$ and the null set $\emptyset$. A subset of a topological group is connected if the subspace is connected. We say that a…
Let $H$ be a group acting on a simply-connected diagrammatically reducible combinatorial 2-complex $X$ with fine 1-skeleton. If the fixed point set $X^ H$ is non-empty, then it is contractible. Having fine 1-skeleton is a weaker version of…
We prove that a function $f:X\to Y$ from a first-countable (more generally, Preiss-Simon) space $X$ to a regular space $Y$ is weakly discontinuous (which means that every subspace $A\subset X$ contains an open dense subset $U\subset A$ such…
In this paper we consider a fragment of the first-order theory of the real numbers that includes systems of equations of continuous functions in bounded domains, and for which all functions are computable in the sense that it is possible to…
We introduce the notion of a Bishop topological group i.e., a group X equipped with a Bishop topology of functions F such that the group operations of X are Bishop morphisms with respect to F. A closed subset in the neighborhood structure…
If an automorphism f of a structure M is such that fix(f^k) = fix(f) for all positive k, then M|fix(f) is a substructure of M. The possible isomorphism types of such M|fix(f) are characterized when M is countable and arithmetically…
We prove that if S is a set of functions from a set A to itself, S is closed under composition, and S contains all transpositions of A, then the action of S on Acan be recovered from the semigroup consisting of S together with its…
Let V, W be real algebraic varieties (that is, up to isomorphism, real algebraic sets), and let X be a subset of V. A map f from X into W is said to be regular if it can be extended to a regular map defined on some Zariski locally closed…
We give a full description of all sets of functions on the group $(\mathbb{ Z}_p, +)$ of prime order which are closed under the composition with the clone generated by $+$ from both sides. Thereby, we also get a description of all iterative…
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…
A set is introreducible if it can be computed by every infinite subset of itself. Such a set can be thought of as coding information very robustly. We investigate introreducible sets and related notions. Our two main results are that the…
We show that $C(X)$ admits an equivalent pointwise lower semicontinuous locally uniformly rotund norm provided $X$ is Fedorchuk compact of spectral height 3. In other words $X$ admits a fully closed map $f$ onto a metric compact $Y$ such…
In this paper, we show that a pointwise-symmetric isotonic closure function is uniquely determined by the pairs of sets it separates. We then show that when the closure function of the domain is isotonic and the closure function of the…
We study projective functions. We prove that projective functions generalise lower and upper-semianalytic ones while being stable by composition and difference. We show that the class of projective functions is closed under sums,…
Reversibility is a key issue in the interface between computation and physics, and of growing importance as miniaturization progresses towards its physical limits. Most foundational work on reversible computing to date has focussed on…
We determine all composition-closed equational classes of Boolean functions. These classes provide a natural generalization of clones and iterative algebras: they are closed under composition, permutation and identification…
A function $f:X\to Y$ between topological spaces is said to be a {\it weakly Gibson function} if $f(\overline{U})\subseteq \overline{f(U)}$ for any open connected set \mbox{$U\subseteq X$}. We prove that if $X$ is a locally connected…
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…
We call a function "constructible" if it has a globally subanalytic domain and can be expressed as a sum of products of globally subanalytic functions and logarithms of positively-valued globally subanalytic functions. Our main theorem…
Any function can be constructed using a hierarchy of simpler functions through compositions. Such a hierarchy can be characterized by a binary rooted tree. Each node of this tree is associated with a function which takes as inputs two…