相关论文: Ordinal notation systems corresponding to Friedman…
In recent years, the theory for Leibniz integral rule in the fractional sense has not been able to get substantial development. As an urgent problem to be solved, we study a Leibniz integral rule for Riemann-Liouville and Caputo type…
For every finitary set functor F we demonstrate that free algebras carry a canonical partial order. In case F is bicontinuous, we prove that the cpo obtained as the conservative completion of the free algebra is the free completely…
The paper presents necessary and sufficient conditions for the order reduction of optimal control systems. Exploring the corresponding Hamiltonian system allows to solve the order reduction problem in terms of dynamical systems,…
Order-of-addition experiments arise when the response depends on the order in which a set of components is added. Since the number of possible orders increases factorially with the number of components, full permutation designs are rarely…
We introduce a method for proving almost sure termination in the context of lambda calculus with continuous random sampling and explicit recursion, based on ranking supermartingales. This result is extended in three ways. Antitone ranking…
Several theorems about the equivalence of familiar theories of reverse mathematics with certain well-ordering principles have been proved by recursion-theoretic and combinatorial methods (Friedman, Marcone, Montalban et al.) and with…
We present a unified rule format for structural operational semantics with terms as labels that guarantees that the associated labelled transition system has some bounded-nondeterminism property. The properties we consider include finite…
We consider set covering problems where the underlying set system satisfies a particular replacement property w.r.t. a given partial order on the elements: Whenever a set is in the set system then a set stemming from it via the replacement…
We revisit the static dependency pair method for proving termination of higher-order term rewriting and extend it in a number of ways: (1) We introduce a new rewrite formalism designed for general applicability in termination proving of…
In this paper we will present some alternative types of mathematical description and methods of solution of the fractional-order dynamical system in the state space. We point out the difference in the true sense of the name "state" space…
A system is Koopman super-linearizable if it admits a finite-dimensional embedding as a linear system. Super-linearization is used to leverage methods from linear systems theory to design controllers or observers for nonlinear systems. We…
Answering a question by Honsell and Plotkin, we show that there are two equations between lambda terms, the so-called subtractive equations, consistent with lambda calculus but not simultaneously satisfied in any partially ordered model…
Over the last decade, it has been demonstrated that many systems in science and engineering can be modeled more accurately by fractional-order than integer-order derivatives, and many methods are developed to solve the problem of fractional…
We have discussed the problem of finding the condition on coefficients of $f''+A(z)f'+B(z)f=0, \quad B(z)(\not \equiv 0)$ so that all non-trivial solutions are of infinite order. The hyper-order of these non-trivial solutions of infinite…
The work considers a system of fractional order partial differential equations. The existence and uniqueness theorems for the classical solution of initial-boundary value problems are proved in two cases: 1) the right-hand side of the…
Given a formal context, an ordinal factor is a subset of its incidence relation that forms a chain in the concept lattice, i.e., a part of the dataset that corresponds to a linear order. To visualize the data in a formal context, Ganter and…
This paper presents a general framework of high-order finite difference (HFD) schemes for the tempered fractional Laplacian (TFL) based on new generating functions obtained from the discrete symbols. Specifically, for sufficiently smooth…
It was recently shown that arbitrary first-order models canonically extend to models (of the same language) consisting of ultrafilters. The main precursor of this construction was the extension of semigroups to semigroups of ultrafilters, a…
We characterize pairs of orthogonal countable ordinals. Two ordinals $\alpha$ and $\beta$ are orthogonal if there are two linear orders $A$ and $B$ on the same set $V$ with order types $\alpha$ and $\beta$ respectively such that the only…
We consider context-free languages equipped with the lexicographic ordering. We show that when the lexicographic ordering of a context-free language is scattered, then its Hausdorff rank is less than $\omega^\omega$. As a corollary of this…