English
Related papers

Related papers: Tietze extension does not always work in construct…

200 papers

A subset $B \subset Y$ is constructible if it is an element of the smallest family that contains all open sets and is stable under finite intersections and complements. A function $f : X \to Y$ is said to be piece-wise closed if $X$ can be…

General Topology · Mathematics 2012-05-29 Alexey Ostrovsky

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…

Logic in Computer Science · Computer Science 2021-06-15 Ana Sokolova , Harald Woracek

We study the values taken by the Riemann zeta-function $\zeta$ on discrete sets. We show that infinite vertical arithmetic progressions are uniquely determined by the values of $\zeta$ taken on this set. Moreover, we prove a joint discrete…

Number Theory · Mathematics 2021-09-21 Junghun Lee , Athanasios Sourmelidis , Jörn Steuding , Ade Irma Suriajaya

Mathematicians like Markov and Bishop made an effort to develop constructive mathematics and extended many theorems in classical mathematical analysis. Heine Borel theorem tells us that a closed bounded subset of Euclidean space R is…

Logic · Mathematics 2020-10-01 Tong Cheng , Zhihan Gao , Yuxin Ma , Yuhan Ning , Jianghao Xu

We say that a set is exhaustible if it admits algorithmic universal quantification for continuous predicates in finite time, and searchable if there is an algorithm that, given any continuous predicate, either selects an element for which…

Logic in Computer Science · Computer Science 2015-07-01 Martin Escardo

We give a~detailed construction of the complete ordered field of real numbers by means of infinite decimal expansions. We prove that in the canonical encoding of decimals neither addition nor multiplication is {\em computable}, but that…

Logic · Mathematics 2021-08-05 Martin Klazar

The celebrated Trakhtenbrot's theorem states that the set of finitely valid sentences of first-order logic is not computably enumerable. In this note we will extend this theorem by proving that the finite satisfiability problem of any…

Logic in Computer Science · Computer Science 2022-04-12 Reijo Jaakkola

A subset of a topological space is constructible if it is a finite Boolean combination of closed sets. We prove that every NTP$_2$ expansion of $(\mathbb{R},<,+)$ by constructible sets defines only constructible sets, and that definable…

Logic · Mathematics 2026-05-20 Pablo Andújar Guerrero

It is well known that the classic {\L}o\'s-Tarski preservation theorem fails in the finite: there are first-order definable classes of finite structures closed under extensions which are not definable (in the finite) in the existential…

Logic in Computer Science · Computer Science 2020-10-27 Anuj Dawar , Abhisekh Sankaran

Extension conjecture states that if a simple module over an artin algebra has nonzero first self-extension group then it has nonzero i-th self-extension group for infinitely many positive integers i. It is shown by recollement of…

Representation Theory · Mathematics 2014-07-08 Yang Han

Cantor's diagonal method is traditionally used to prove the uncountability of the set of all infinite binary sequences. This paper analyzes the expressive limits of this method. It is shown that under any constructive application --…

General Mathematics · Mathematics 2025-05-28 Stanislav Semenov

Let $X$ be a normed space of a finite dimension at least two, and $C\subsetneq X$ a closed convex set with nonempty interior. We are interested in extending Lipschitz quasiconvex functions on $C$ to quasiconvex functions on $X$. We show…

Functional Analysis · Mathematics 2026-03-06 Carlo Alberto De Bernardi , Libor Veselý

In this paper, through the combination of Tietze extension theorem and Baer criteria, we build a new mathematical structure which is similar to a triangular pyramid, and then we prove that the topological space which we call it Tb appeared…

General Topology · Mathematics 2019-06-10 Assad Rashidi , Kaveh Mohammadi

Subshifts are sets of colorings of $\mathbb{Z}^d$ defined by families of forbidden patterns. In a given subshift, the extender set of a finite pattern is the set of all its admissible completions. Since soficity of $\mathbb{Z}$ subshifts is…

Discrete Mathematics · Computer Science 2025-10-03 Antonin Callard , Léo Paviet Salomon , Pascal Vanier

This paper is a contribution to the study of extensions of arbitrary models of ZF (Zermelo-Fraenkel set theory), with no regard to countability or well-foundedness of the models involved. We present some new constructions of certain types…

Logic · Mathematics 2026-04-07 Ali Enayat

We present an unconditional proof that non-trivial zeros of the Riemann Zeta function must lie strictly on the critical line $\text{Re}(s) = 0.5$. By defining a recursive path of Taylor expansions originating from the domain of absolute…

General Mathematics · Mathematics 2026-03-11 Yunwei Bai

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…

Computational Complexity · Computer Science 2016-08-15 Peter Franek , Stefan Ratschan , Piotr Zgliczynski

The extended Schur functions form a basis of quasisymmetric functions that contains the Schur functions. We provide a representation-theoretic interpretation of this basis by constructing $0$-Hecke modules whose quasisymmetric…

Representation Theory · Mathematics 2019-06-12 Dominic Searles

This paper presents a constructive proof of the existence of a regular non-atomic strictly-positive measure on any second-countable non-atomic locally compact Hausdorff space. This construction involves a sequence of finitely-additive set…

Functional Analysis · Mathematics 2020-02-21 Jason Bentley

The problem is considered as to whether a monotone function defined on a subset P of a Euclidean space can be strictly monotonically extended to the whole space. It is proved that this is the case if and only if the function is {\em…

Optimization and Control · Mathematics 2022-10-21 Pavel Chebotarev