Related papers: Continuous and algebraic domains in univalent foun…

We develop a denotational semantics for general reference types in an impredicative version of guarded homotopy type theory, an adaptation of synthetic guarded domain theory to Voevodsky's univalent foundations. We observe for the first…

We give a simple order-theoretic construction of a Cartesian closed category of sequential functions. It is based on bistable biorders, which are sets with a partial order -- the extensional order -- and a bistable coherence, which captures…

This article explores the model-dependent nature of set cardinality, emphasizing that cardinality is not absolute but varies across different axiomatic frameworks. Although Cantor's diagonal argument shows the real numbers are…

In this paper we consider propositional calculi, which are finitely axiomatizable extensions of intuitionistic implicational propositional calculus together with the rules of modus ponens and substitution. We give a proof of undecidability…

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…

This paper presents a theory of systemic undecidability, reframing incomputability as a structural property of systems rather than a localized feature of specific functions or problems. We define a notion of causal embedding and prove a…

In this paper we establish a general framework in which the verification of support theorems for generalized convex functions acting between an algebraic structure and an ordered algebraic structure is still possible. As for the domain…

We consider continuous structures which are obtained from finite dimensional Hilbert spaces over $\mathbb{C}$ by adding some unitary operators. Quantum automata and circuits are naturally interpretable in such structures. We consider…

We first show that the projection image of a discrete definable set is again discrete for an arbitrary definably complete locally o-minimal structure. This fact together with the results in a previous paper implies tame dimension theory and…

This paper enriches preexisting satisfiability tests for unquantified languages, which in turn augment a fragment of Tarski's elementary algebra with unary real functions possessing a continuous first derivative. Two sorts of individual…

We extend the definition of the Costas property to functions in the continuum, namely on intervals of the reals or the rationals, and argue that such functions can be used in the same applications as discrete Costas arrays. We construct…

We introduce notions of vector field and its (discrete time) flow on a chain complex. The resulting dynamical systems theory provides a set of tools with a broad range of applicability that allow, among others, to replace in a canonical way…

In this paper, we prove a new continuous embedding theorem for fractional Sobolev spaces with variable exponents into variable exponent Lebesgue spaces on unbounded domains. As an application, we study a class of nonlocal elliptic problems…

We exhibit an adjunction between a category of abstract algebras of partial functions and a category of set quotients. The algebras are those atomic algebras representable as a collection of partial functions closed under relative…

We define a model of predicate logic in which every term and predicate, open or closed, has an absolute denotation independently of a valuation of the variables. For each variable a, the domain of the model contains an element [[a]] which…

We present a novel, yet rather simple construction within the traditional framework of Scott domains to provide semantics to probabilistic programming, thus obtaining a solution to a long-standing open problem in this area. Unlike current…

We generalize type $A$ quivers to continuous type $A$ quivers and prove initial results about pointwise finite-dimensional (pwf) representations. We classify the indecomosable pwf representations and provide a decomposition theorem,…

ASD (Abstract Stone Duality) is a re-axiomatisation of general topology in which the topology on a space is treated, not as an infinitary lattice, but as an exponential object of the same category as the original space, with an associated…

The first part of the present article consists in a survey about the dynamical constructive method designed using dynamical theories and dynamical algebraic structures. Dynamical methods uncovers a hidden computational content for numerous…

Constraint-based causal discovery is widely used for learning causal structures, but heavy reliance on conditional independence (CI) testing makes it computationally expensive in high-dimensional settings. To mitigate this limitation, many…