Related papers: Strong computable type
A theorem of A.A. Brudno says that the Kolmogorov-Sinai entropy of a subshift X over $\mathbb{N}$ with respect to an ergodic measure $\mu$ equals the asymptotic Kolmogorov complexity of almost every word $\omega$ in X. The purpose of this…
The \emph{index set} of a computable structure $\mathcal{A}$ is the set of indices for computable copies of $\mathcal{A}$. We determine the complexity of the index sets of various mathematically interesting structures, including arbitrary…
We review results concerning homogeneous compacta and discuss some open questions. It is established that indecomposable continua are Alexandroff (resp., Mazurkiewicz, or strong Cantor) manifolds with respect to the class of all continua.…
Cyclic and non-wellfounded proofs are now increasingly employed to establish metalogical results in a variety of settings, in particular for type systems with forms of (co)induction. Under the Curry-Howard correspondence, a cyclic proof can…
In this paper, we introduce a foundation for computable model theory of rational Pavelka logic (an extension of {\L}ukasiewicz logic) and continuous logic, and prove effective versions of some theorems in model theory. We show how to reduce…
Lumsdaine (2010) and van den Berg-Garner (2011) proved that types in Martin-L\"of type theory carry the structure of weak {\omega}-groupoids. Their proofs, while foundational, rely on abstract properties of the identity type without…
This article introduces and studies the tight approximation property, a property of algebraic varieties defined over the function field of a complex or real curve that refines the weak approximation property (and the known cohomological…
We provide examples of nonseparable compact spaces with the property that any continuous image which is homeomorphic to a finite product of spaces has a maximal prescribed number of nonseparable factors.
The concept of well group in a special but important case captures homological properties of the zero set of a continuous map $f:K\to R^n$ on a compact space K that are invariant with respect to perturbations of f. The perturbations are…
Classical models of computation have been successful in capturing the very essence of individual computing devices. Although they are useful to understand computability power and limitations in the small, such models are not suitable to…
We investigate the effectivizations of several equivalent definitions of quasi-Polish spaces and study which characterizations hold effectively. Being a computable effectively open image of the Baire space is a robust notion that admits…
Cubic complexes appear in the theory of finite type invariants so often that one can ascribe them to basic notions of the theory. In this paper we begin the exposition of finite type invariants from the `cubic' point of view. Finite type…
The spaces ${\mathcal S}'/{\mathcal P}$ equipped with the quotient topology and ${\mathcal S}'_\infty$ equipped with the weak-* topology are known to be homeomorphic, where ${\mathcal P}$ denotes the set of all polynomials. The proof is a…
In this paper we obtain results indicating that fine shape is tractable and "not too strong" even in the non-locally compact case, and can be used to better understand infinite-dimensional metrizable spaces and their homology theories. We…
The purpose of this article is to extend the earliest results of A.A. Brudno, connecting topological entropy of a subshift X over $\mathbb{N}$ to the Kolmogorov complexity of words in X, to subshifts over computable groups that posses…
In this paper we study the shifts, which are the shift-invariant and topologically closed sets of configurations over a finite alphabet in $\mathbb{Z}^d$. The minimal shifts are those shifts in which all configurations contain exactly the…
Assuming the obvious definitions (see paper) we show the a decidable model that is effectively prime is also effectively atomic. This implies that two effectively prime (decidable) models are computably isomorphic. This is in contrast to…
The main objective of this work is to study mathematical properties of computational paths. Originally proposed by de Queiroz \& Gabbay (1994) as `sequences or rewrites', computational paths are taken to be terms of the identity type of…
This paper is devoted to the study of a newly introduced tool, projectional coderivatives and the corresponding calculus rules in finite dimensions. We show that when the restricted set has some nice properties, more specifically, is a…
In this paper we work in o-minimal structures with definable Skolem functions and show that a continuous definable map between Hausdorff locally definably compact definable spaces is definably proper if and only if it is proper morphism in…