相关论文: From Sazonov's Non-Dcpo Natural Domains to Closed …
We develop domain theory in constructive univalent foundations without Voevodsky's resizing axioms. In previous work in this direction, we constructed the Scott model of PCF and proved its computational adequacy, based on directed complete…
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…
Deep neural networks (DNNs) have emerged as a powerful tool with a growing body of literature exploring Lyapunov-based approaches for real-time system identification and control. These methods depend on establishing bounds for the second…
As fragments of first-order logic, Description logics (DLs) do not provide nonmonotonic features such as defeasible inheritance and default rules. Since many applications would benefit from the availability of such features, several…
A construction of fully abstract typed models for PCF and PCF^+ (i.e., PCF + "parallel conditional function"), respectively, is presented. It is based on general notions of sequential computational strategies and wittingly consistent…
In this paper, by using a characterization of functions having fractional derivative, we propose a rigorous fractional Lyapunov function candidate method to analyze stability of fractional-order nonlinear systems. First, we prove an…
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…
In analogy to a result due to Drake and Thron about topological spaces, this paper studies the dcpos (directed complete posets) which are fully determined, among all dcpos, by their lattices of all Scott-closed subsets (such dcpos will be…
The majority of traditional classification ru les minimizing the expected probability of error (0-1 loss) are inappropriate if the class probability distributions are ill-defined or impossible to estimate. We argue that in such cases class…
We prove that for every indecomposable ordinal there exists a (transfinitely valued) Euclidean domain whose minimal Euclidean norm is of that order type. Conversely, any such norm must have indecomposable type, and so we completely…
Is there any Cartesian-closed category of continuous domains that would be closed under Jones and Plotkin's probabilistic powerdomain construction? This is a major open problem in the area of denotational semantics of probabilistic…
We prove that the sequential functionals of some fixed types at type level 2, taking finite sequences of unary functions as arguments, do form a directed complete partial ordering. This gives a full characterisation of for which types the…
We introduce a concept of a fractional-derivatives series and prove that any linear partial differential equation in two independent variables has a fractional-derivatives series solution with coefficients from a differentially closed field…
Identification of the unknown parameters and orders of fractional chaotic systems is of vital significance in controlling and synchronization of fractional-order chaotic systems. However there exist basic hypotheses in traditional…
A Condorcet domain is a collection of linear orders which satisfy an acyclic majority relation. In this paper we describe domains as collections of directed Hamilton paths. We prove that while Black's single-peaked domains are defined by…
We give a domain-theoretic semantics to a statistical programming language, using the plain old category of dcpos, in contrast to some more sophisticated recent proposals. Remarkably, our monad of minimal valuations is commutative, which…
The paper is devoted to the development of control procedures with a guide for conflict-controlled dynamical systems described by ordinary fractional differential equations with the Caputo derivative of an order $\alpha \in (0, 1).$ For the…
First-order logic with dependent sorts, such as Makkai's first-order logic with dependent sorts (FOLDS), or Aczel's and Belo's dependently typed (intuitionistic) first-order logic (DFOL), may be regarded as logic enriched dependent type…
A non-empty subset of a topological space is irreducible if whenever it is covered by the union of two closed sets, then already it is covered by one of them. Irreducible sets occur in proliferation: (1) every singleton set is irreducible,…
Directed spaces are natural topological extensions of dcpos in domain theory and form a cartesian closed category. We will show that the D-completion of free algebras over a Scott space $\Sigma L$, on the context of directed spaces, are…