Related papers: Domain Representable Spaces Defined by Strictly Po…
Here we present an overview of countably-normed spaces. We discuss the main topologies--weak, strong, and inductive--placed on the dual of a countably-normed space and discuss the sigma-fields generated by these topologies. In particular,…
We define an extension of operator-valued positive definite functions from the real or complex setting to topological algebras, and describe their associated reproducing kernel spaces. The case of entire functions is of special interest,…
We propose the extension of the complex numbers to be the new domain where new concepts, like negative and imaginary probabilities, can be defined. The unit of the new space is defined as the solution of the unsolvable equation in the…
We develop the theory of continuous and algebraic domains in constructive and predicative univalent foundations, building upon our earlier work on basic domain theory in this setting. That we work predicatively means that we do not assume…
We develop domain theory in constructive and predicative univalent foundations (also known as homotopy type theory). That we work predicatively means that we do not assume Voevodsky's propositional resizing axioms. Our work is constructive…
The highly influential framework of conceptual spaces provides a geometric way of representing knowledge. Instances are represented by points and concepts are represented by regions in a (potentially) high-dimensional space. Based on our…
In computable topology, a represented space is called computably discrete if its equality predicate is semidecidable. While any such space is classically isomorphic to an initial segment of the natural numbers, the computable-isomorphism…
In this paper, we first discussed multiplicative metric mapping by giving some topological properties of the relevant multiplicative metric space. As an interesting result of our discussions, we observed that the set of positive real…
We show pro-definability of spaces of definable types in various classical complete first order theories, including complete o-minimal theories, Presburger arithmetic, $p$-adically closed fields, real closed and algebraically closed valued…
In computable analysis typically topological spaces with countable bases are considered. The Theorem of Kreitz-Weihrauch implies that the subbase representation of a second-countable $T_0$ space is admissible with respect to the topology…
It is proved that any countable topological vector space over a finite field $\mathbb F_p$ or, equivalently, any countable Abelian topological group of prime exponent has a closed discrete basis.
All most all the function spaces over real or complex domains and spaces of sequences, that arise in practice as examples of normed complete linear spaces (Banach spaces), are reflexive. These Banach spaces are dual to their respective…
Theory revision integrates inductive learning and background knowledge by combining training examples with a coarse domain theory to produce a more accurate theory. There are two challenges that theory revision and other theory-guided…
Powerspaces of directed spaces play an important role in modeling the semantics of nondeterministic functional programming languages. The notions of upper,lower and convex powerspace of a directed space are defined by the way of free…
We study two classes of spaces whose points are filters on partially ordered sets. Points in MF spaces are maximal filters, while points in UF spaces are unbounded filters. We give a thorough account of the topological properties of these…
A fertile field of research in theoretical computer science investigates the representation of general recursive functions in intensional type theories. Among the most successful approaches are: the use of wellfounded relations,…
In domain theory every finite computable object can be represented by a single mathematical object instead of a set of objects, using the notion of finitary-basis. In this article we report on our effort to formalize domain theory in Coq in…
We introduce a new setting, the category of $\omega$PAP spaces, for reasoning denotationally about expressive differentiable and probabilistic programming languages. Our semantics is general enough to assign meanings to most practical…
Domain theory has been developed as a mathematical theory of computation and to give a denotational semantics to programming languages. It helps us to fix the meaning of language concepts, to understand how programs behave and to reason…
Superposition is an established decision procedure for a variety of first-order logic theories represented by sets of clauses. A satisfiable theory, saturated by superposition, implicitly defines a minimal term-generated model for the…