In the classical theory of regular languages, the concept of recognition by profinite monoids is an important tool. Beyond regularity, Boolean spaces with internal monoids (BiMs) were recently proposed as a generalization. On the other hand, fragments of logic defining regular languages can be studied inductively via the so-called “Substitution Principle.” In this paper, we make the logical underpinnings of this principle explicit and extend it to arbitrary languages using Stone duality. Subsequently, we show how it can be used to obtain topo-algebraic recognizers for classes of languages defined by a wide class of first-order logic fragments. This naturally leads to a notion of semidirect product of BiMs extending the classical such construction for profinite monoids. Our main result is a generalization of Almeida and Weil’s Decomposition Theorem for semidirect products from the profinite setting to that of BiMs. This is a crucial step in a program to extend the profinite methods of regular language theory to the setting of complexity theory.

We propose an abstract notion of a type theory to unify the semantics of various type theories including Martin–Löf type theory, two-level type theory, and cubical type theory. We establish basic results in the semantics of type theory: every type theory has a bi-initial model; every model of a type theory has its internal language; the category of theories over a type theory is bi-equivalent to a full sub-2-category of the 2-category of models of the type theory.

Werner’s set-theoretical model is one of the simplest models of CIC. It combines a functional view of predicative universes with a collapsed view of the impredicative sort “ ${\tt Prop}$ ”. However, this model of ${\tt Prop}$ is so coarse that the principle of excluded middle $P \lor \neg P$ holds. Following our previous work, we interpret ${\tt Prop}$ into a topological space (a special case of Heyting algebra) to make the model more intuitionistic without sacrificing simplicity. We improve on that work by providing a full interpretation of dependent product types, using Alexandroff spaces. We also extend our approach to inductive types by adding support for ${\mathsf{list}}$ s.

Soft sets were introduced as a means to study objects that are not defined in an absolute way and have found applications in numerous areas of mathematics, decision theory, and in statistical applications. Soft topological spaces were first considered in Shabir and Naz ((2011). Computers & Mathematics with Applications 61 (7) 1786–1799) and soft separation axioms for soft topological spaces were studied in El-Shafei et al. ((2018). Filomat 32 (13) 4755–4771), El-Shafei and Al-Shami ((2020). Computational and Applied Mathematics 39 (3) 1–17), Al-shami ((2021). Mathematical Problems in Engineering 2021). In this paper, we introduce the effective versions of soft separation axioms. Specifically, we focus our attention on computable u-soft and computable p-soft separation axioms and investigate various relations between them. We also compare the effective and classical versions of these soft separation axioms.

Working constructively, we study continuous directed complete posets (dcpos) and the Scott topology. Our two primary novelties are a notion of intrinsic apartness and a notion of sharp elements. Being apart is a positive formulation of being unequal, similar to how inhabitedness is a positive formulation of nonemptiness. To exemplify sharpness, we note that a lower real is sharp if and only if it is located. Our first main result is that for a large class of continuous dcpos, the Bridges–Vîţǎ apartness topology and the Scott topology coincide. Although we cannot expect a tight or cotransitive apartness on nontrivial dcpos, we prove that the intrinsic apartness is both tight and cotransitive when restricted to the sharp elements of a continuous dcpo. These include the strongly maximal elements, as studied by Smyth and Heckmann. We develop the theory of strongly maximal elements highlighting its connection to sharpness and the Lawson topology. Finally, we illustrate the intrinsic apartness, sharpness, and strong maximality by considering several natural examples of continuous dcpos: the Cantor and Baire domains, the partial Dedekind reals, the lower reals and, finally, an embedding of Cantor space into an exponential of lifted sets.

We develop semantics and syntax for bicategorical type theory. Bicategorical type theory features contexts, types, terms, and directed reductions between terms. This type theory is naturally interpreted in a class of structured bicategories. We start by developing the semantics, in the form of comprehension bicategories. Examples of comprehension bicategories are plentiful; we study both specific examples as well as classes of examples constructed from other data. From the notion of comprehension bicategory, we extract the syntax of bicategorical type theory, that is, judgment forms and structural inference rules. We prove soundness of the rules by giving an interpretation in any comprehension bicategory. The semantic aspects of our work are fully checked in the Coq proof assistant, based on the UniMath library.

A domain-theoretic framework is presented for validated robustness analysis of neural networks. First, global robustness of a general class of networks is analyzed. Then, using the fact that Edalat’s domain-theoretic L-derivative coincides with Clarke’s generalized gradient, the framework is extended for attack-agnostic local robustness analysis. The proposed framework is ideal for designing algorithms which are correct by construction. This claim is exemplified by developing a validated algorithm for estimation of Lipschitz constant of feedforward regressors. The completeness of the algorithm is proved over differentiable networks and also over general position ${\mathrm{ReLU}}$ networks. Computability results are obtained within the framework of effectively given domains. Using the proposed domain model, differentiable and non-differentiable networks can be analyzed uniformly. The validated algorithm is implemented using arbitrary-precision interval arithmetic, and the results of some experiments are presented. The software implementation is truly validated, as it handles floating-point errors as well.

In this paper, we study quasi-metric spaces using domain theory. Given a quasi-metric space (X,d), we use $({\bf B}(X,d),\leq^{d^{+}}\!)$ to denote the poset of formal balls of the associated quasi-metric space (X,d). We introduce the notion of local Yoneda-complete quasi-metric spaces in terms of domain-theoretic properties of $({\bf B}(X,d),\leq^{d^{+}}\!)$ . The manner in which this definition is obtained is inspired by Romaguera–Valero theorem and Kostanek–Waszkiewicz theorem. Furthermore, we obtain characterizations of local Yoneda-complete quasi-metric spaces via local nets in quasi-metric spaces. More precisely, we prove that a quasi-metric space is local Yoneda-complete if and only if every local net has a d-limit. Finally, we prove that every quasi-metric space has a local Yoneda completion.

We show that categories of modules over a ring in homotopy type theory (HoTT) satisfy the internal versions of the AB axioms from homological algebra. The main subtlety lies in proving AB4, which is that coproducts indexed by arbitrary sets are left-exact. To prove this, we replace a set X with the strict category of lists of elements in X. From showing that the latter is filtered, we deduce left-exactness of the coproduct. More generally, we show that exactness of filtered colimits (AB5) implies AB4 for any abelian category in HoTT. Our approach is heavily inspired by Roswitha Harting’s construction of the internal coproduct of abelian groups in an elementary topos with a natural numbers object. To state the AB axioms, we define and study filtered (and sifted) precategories in HoTT. A key result needed is that filtered colimits commute with finite limits of sets. This is a familiar classical result but has not previously been checked in our setting. Finally, we interpret our most central results into an $\infty$ -topos $ {\mathscr{X}} $ . Given a ring R in $ {\tau_{\leq 0}({{\mathscr{X}}})} $ – for example, an ordinary sheaf of rings – we show that the internal category of R-modules in $ {\mathscr{X}} $ represents the presheaf which sends an object $ X \in {\mathscr{X}} $ to the category of $ (X{\times}R) $ -modules in ${\mathscr{X}} / X$ . In general, our results yield a product-preserving left adjoint to base change of modules over X. When X is 0-truncated, this left adjoint is the internal coproduct. By an internalisation procedure, we deduce left-exactness of the internal coproduct as an ordinary functor from its internal left-exactness coming from HoTT.

Robustness is a property of system analyses, namely monotonic maps from the complete lattice of subsets of a (system’s state) space to the two-point lattice. The definition of robustness requires the space to be a metric space. Robust analyses cannot discriminate between a subset of the metric space and its closure; therefore, one can restrict to the complete lattice of closed subsets. When the metric space is compact, the complete lattice of closed subsets ordered by reverse inclusion is $\omega$-continuous, and robust analyses are exactly the Scott-continuous maps. Thus, one can also ask whether a robust analysis is computable (with respect to a countable base). The main result of this paper establishes a relation between robustness and Scott continuity when the metric space is not compact. The key idea is to replace the metric space with a compact Hausdorff space, and relate robustness and Scott continuity by an adjunction between the complete lattice of closed subsets of the metric space and the $\omega$-continuous lattice of closed subsets of the compact Hausdorff space. We demonstrate the applicability of this result with several examples involving Banach spaces.

This work presents game semantics of Martin-Löf type theory (MLTT) equipped with the One, the Zero, the N, Pi, Sigma and Id types. Game semantics interprets a wide range of logic and computation, even the polymorphic $\lambda$-calculus; however, it has remained a well-known challenge in the past 25 years to achieve game semantics of dependent type theories such as MLTT, and past attempts lack directness or generality. For instance, the approach taken by Abramsky et al. interprets Sigma types indirectly by formal lists, not by games, making an interpretation of universes hopeless, and it is limited to a very specific class of dependent types. The difficulty of this challenge comes from a conflict between the extensionality of dependent types and the intensionality of game semantics. We overcome the challenge by inventing a novel variant of games, while we keep strategies unchanged, in such a way that this variant inherits the strong points of conventional game semantics. Also, our method enables an interpretation of subtyping on dependent types for the first time as game semantics. We finally give a new, game-semantic proof of the independence of Markov’s principle from MLTT. This proof illustrates an advantage of our intensional model over extensional ones such as Hyland’s effective topos.

Up-to techniques are a well-known method for enhancing coinductive proofs of behavioural equivalences. We introduce up-to techniques for behavioural metrics between systems modelled as coalgebras, and we provide abstract results to prove their soundness in a compositional way.

In order to obtain a general framework, we need a systematic way to lift functors: we show that the Wasserstein lifting of a functor, introduced in a previous work, corresponds to a change of base in a fibrational sense. This observation enables us to reuse existing results about soundness of up-to techniques in a fibrational setting. We focus on the fibrations of predicates and relations valued in a quantale. To illustrate our approach, we provide an example on distances between regular languages.

The study of the sobriety of Scott spaces has got a relatively long history in domain theory. Lawson and Hoffmann independently proved that the Scott space of every continuous directed complete poset (usually called domain) is sober. Johnstone constructed the first directed complete poset whose Scott space is non-sober. Soon after, Isbell gave a complete lattice with a non-sober Scott space. Based on Isbell’s example, Xu, Xi, and Zhao showed that there is even a complete Heyting algebra whose Scott space is non-sober. Achim Jung then asked whether every countable complete lattice has a sober Scott space. The main aim of this paper is to answer Jung’s problem by constructing a countable complete lattice whose Scott space is non-sober. This lattice is then modified to obtain a countable distributive complete lattice with a non-sober Scott space. In addition, we prove that the topology of the product space $\Sigma P\times \Sigma Q$ coincides with the Scott topology of the product poset $P\times Q$ if the set Id(P) and Id(Q) of all incremental ideals of posets P and Q are both countable. Based on this, it is deduced that a directed complete poset P has a sober Scott space, if Id(P) is countable and $\Sigma P$ is coherent and well filtered. In particular, every complete lattice L with Id(L) countable has a sober Scott space.

We prove a correspondence between $\kappa$-small fibrations in simplicial presheaf categories equipped with the injective or projective model structure (and left Bousfield localizations thereof) and relatively $\kappa$-compact maps in their underlying quasi-categories for suitably large regular cardinals $\kappa$. We thus obtain a transition result between weakly universal small fibrations in the (type-theoretic) injective Dugger–Rezk-style standard presentations of model toposes and object classifiers in Grothendieck $\infty$-toposes in the sense of Lurie.

We study the positivity and causality axioms for Markov categories as properties of dilations and information flow and also develop variations thereof for arbitrary semicartesian monoidal categories. These help us show that being a positive Markov category is merely an additional property of a symmetric monoidal category (rather than extra structure). We also characterize the positivity of representable Markov categories and prove that causality implies positivity, but not conversely. Finally, we note that positivity fails for quasi-Borel spaces and interpret this failure as a privacy property of probabilistic name generation.

Working in homotopy type theory, we introduce the notion of n-exactness for a short sequence $F\to E\to B$ of pointed types and show that any fiber sequence $F\hookrightarrow E \twoheadrightarrow B$ of arbitrary types induces a short sequence

that is n-exact at $\| E\|_{n-1}$. We explain how the indexing makes sense when interpreted in terms of n-groups, and we compare our definition to the existing definitions of an exact sequence of n-groups for $n=1,2$. As the main application, we obtain the long n-exact sequence of homotopy n-groups of a fiber sequence.

Jacobs has proposed definitions for (weak, strong, split) generic objects for a fibered category; building on his definition of (split) generic objects, Jacobs develops a menagerie of important fibrational structures with applications to categorical logic and computer science, including higher order fibrations, polymorphic fibrations, $\lambda2$ -fibrations, triposes, and others. We observe that a split generic object need not in particular be a generic object under the given definitions, and that the definitions of polymorphic fibrations, triposes, etc. are strict enough to rule out some fundamental examples: for instance, the fibered preorder induced by a partial combinatory algebra in realizability is not a tripos in this sense. We propose a new alignment of terminology that emphasizes the forms of generic object appearing most commonly in nature, i.e. in the study of internal categories, triposes, and the denotational semantics of polymorphism. In addition, we propose a new class of acyclic generic objects inspired by recent developments in higher category theory and the semantics of homotopy type theory, generalizing the realignment property of universes to the setting of an arbitrary fibration.

For a $T_0$ space X, let $\mathsf{K}(X)$ be the poset of all nonempty compact saturated subsets of X endowed with the Smyth order $\sqsubseteq$. $(\mathsf{K}(X), \sqsubseteq)$ (shortly $\mathsf{K}(X)$) is called the Smyth power poset of X. In this paper, we mainly discuss some basic properties of the Scott topology on Smyth power posets. It is proved that for a well-filtered space X, its Smyth power poset $\mathsf{K}(X)$ with the Scott topology is still well-filtered, and a $T_0$ space Y is well-filtered iff the Smyth power poset $\mathsf{K}(Y)$ with the Scott topology is well-filtered and the upper Vietoris topology is coarser than the Scott topology on $\mathsf{K}(Y)$. A sober space Z is constructed for which the Smyth power poset $\mathsf{K}(Z)$ with the Scott topology is not sober. A few sufficient conditions are given for a $T_0$ space X under which its Smyth power poset $\mathsf{K}(X)$ with the Scott topology is sober. Some other properties, such as local compactness, first-countability, Rudin property and well-filtered determinedness, of Smyth power spaces, and the Scott topology on Smyth power posets, are also investigated.