Related papers: Domain Representable Spaces Defined by Strictly Po…

In this paper, we investigate the problem of synthesizing computable functions of infinite words over an infinite alphabet (data $\omega$-words). The notion of computability is defined through Turing machines with infinite inputs which can…

We provide a direct and elementary proof for the fact that every four point metric space is positive definite, which was first proved by Meckes based on some embedding theorems of metric spaces. As an outcome of the direct proof, we also…

We introduce the concept of completely positive roots of completely positive maps on operator algebras. We do this in different forms: as asymptotic roots, proper discrete roots and as continuous one-parameter semigroups of roots. We…

A compact set has computable type if any homeomorphic copy of the set which is semicomputable is actually computable. Miller proved that finite-dimensional spheres have computable type, Iljazovi\'c and other authors established the property…

Root systems are sets with remarkable symmetries and therefore they appear in many situations in mathematics. Among others, denominator formulae of root systems are very beautiful and mysterious equations which have several meanings from a…

In his unpublished preprint "Definable Valuations" Koenigsmann shows that every field that admits a t-henselian topology is either real closed or separably closed or admits a definable valuation inducing the t-henselian topology. To show…

Although there is a somewhat standard formalization of computability on countable sets given by Turing machines, the same cannot be said about uncountable sets. Among the approaches to define computability in these sets, order-theoretic…

A causal input-output system may be described by a function space for inputs, a function space for outputs, and a causal operator mapping the input space into the output space. A particular representation of the state of such a system at…

We introduce a topology on the space of all isomorphism types represented in a given class of countable models, and use this topology as an aid in classifying the isomorphism types. This mixes ideas from effective descriptive set theory and…

The aim of this paper is to establish a theory of random variables on domains. Domain theory is a fundamental component of theoretical computer science, providing mathematical models of computational processes. Random variables are the…

''Positive geometries'' are a class of semi-algebraic domains which admit a unique ''canonical form'': a logarithmic form whose residues match the boundary structure of the domain. The study of such geometries is motivated by recent…

This paper is motivated by the theory of sequential dynamical systems, developed as a basis for a mathematical theory of computer simulation. It contains a classification of finite dynamical systems on binary strings, which are obtained by…

One of the fundamental results in computability is the existence of well-defined functions that cannot be computed. In this paper we study the effects of data representation on computability; we show that, while for each possible way of…

Using standard domain-theoretic fixed-points, we present an approach for defining recursive functions that are formulated in monadic style. The method works both in the simple option monad and the state-exception monad of Isabelle/HOL's…

This paper presents a type theory in which it is possible to directly manipulate $n$-dimensional cubes (points, lines, squares, cubes, etc.) based on an interpretation of dependent type theory in a cubical set model. This enables new ways…

We provide a complete characterization of closed sets with empty interior and positive reach in $\mathbb{R}^2$. As a consequence, we characterize open bounded domains in $\mathbb{R}^2$ whose high ridge and cut locus agree, and hence $C^1$…

We consider complete positivity of dynamics regarding subsystems of an open composite quantum system, which is subject of a completely positive dynamics. By "completely positive dynamics", we assume the dynamical maps called the completely…

We consider the question as to whether the exponent of a computably presentable Lebesgue space whose dimension is at least 2 must be computable. We show this very natural conjecture is true when the exponent is at least 2 or when the space…

Sofic shifts are symbolic dynamical systems defined by the set of bi-infinite sequences on an edge-labeled directed graph, called a presentation. We study the computational complexity of an array of natural decision problems about…

We introduce a generalized notion of inference system to support more flexible interpretations of recursive definitions. Besides axioms and inference rules with the usual meaning, we allow also coaxioms, which are, intuitively, axioms which…