Related papers: Effective bases and notions of effective second co…
Reverse mathematics studies which subsystems of second order arithmetic are equivalent to key theorems of ordinary, non-set-theoretic mathematics. The main philosophical application of reverse mathematics proposed thus far is foundational…
We give a number of formal proofs of theorems from the field of computable analysis. Many of our results specify executable algorithms that work on infinite inputs by means of operating on finite approximations and are proven correct in the…
We give a characterization of countable discrete subspace $A$ of a topological space $X$ such that there exists a (linear) continuous mapping $\varphi:C_p^*(A)\to C_p(X)$ with $\varphi(y)|_A=y$ for every $y\in C_p^*(A)$. Using this…
Solomonoff unified Occam's razor and Epicurus' principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field of algorithmic information theory. His central result is that the…
We define a class of computable functions over real numbers using functional schemes similar to the class of primitive and partial recursive functions defined by G\"odel and Kleene. We show that this class of functions can also be…
The aim of this paper is to present an elementary computable theory of random variables, based on the approach to probability via valuations. The theory is based on a type of lower-measurable sets, which are controlled limits of open sets,…
Consider a multi-class labelling problem, where the labels can take values in $[k]$, and a predictor predicts a distribution over the labels. In this work, we study the following foundational question: Are there notions of multi-class…
Computability theory is a discipline in the intersection of computer science and mathematical logic where the fundamental question is: given two mathematical objects X and Y, does X compute Y in principle? In case X and Y are real numbers,…
We prove various extensions of the Tennenbaum phenomenon to the case of computable quotient presentations of models of arithmetic and set theory. Specifically, no nonstandard model of arithmetic has a computable quotient presentation by a…
We investigate the computability (in the sense of computable analysis) of the topological pressure $P_{\rm top}(\phi)$ on compact shift spaces $X$ for continuous potentials $\phi:X\to {\mathbb R}$. This question has recently been studied…
We show that if a countably generated Lie algebra $H$ does not contain isomorphic copies of certain finite-dimensional nilpotent Lie algebras $A$ and $B$ (satisfying some mild conditions), then $H$ embeds into a quotient of $A \ast B$ that…
We briefly show how the use of topological spaces and $\sigma$-algebras in physics can be rederived and understood as the fundamental requirement of experimental verifiability. We will see that a set of experimentally distinguishable…
Louveau and Rosendal [5] have shown that the relation of bi-embeddability for countable graphs as well as for many other natural classes of countable structures is complete under Borel reducibility for analytic equivalence relations. This…
Building on our prior work on axiomatization of exact real computation by formalizing nondeterministic first-order partial computations over real and complex numbers in a constructive dependent type theory, we present a framework for…
In first order logic, it is known that you can define a topology so that the countable models of some theory $T$ form a Polish Space (i.e. completely metrizable second countable space). In this paper we use the Baldwin- Boney Relational…
We collect several foundational results regarding the interaction between locally compact spaces, probability spaces and probability algebras, and commutative $C^*$-algebras and von Neumann algebras equipped with traces, in the…
We continue work of our earlier paper (Lewitzka and Brunner: Minimally generated abstract logics, Logica Universalis 3(2), 2009), where abstract logics and particularly intuitionistic abstract logics are studied. Abstract logics can be…
Many forms of programmable matter have been proposed for various tasks. We use an abstract model of self-organizing particle systems for programmable matter which could be used for a variety of applications, including smart paint and…
A Cech closure space $(X,u)$ is a set $X$ with a (Cech) closure operator $u$ which need not be idempotent. Many properties which hold in topological spaces hold in Cech closure spaces as well. The notions of proper (splitting) and…
The empty set of course contains no computable point. On the other hand, surprising results due to Zaslavskii, Tseitin, Kreisel, and Lacombe assert the existence of NON-empty co-r.e. closed sets devoid of computable points: sets which are…