Related papers: Conceptual Differential Calculus. I: First Order L…
We introduce a notion of complexity of diagrams (and in particular of objects and morphisms) in an arbitrary category, as well as a notion of complexity of functors between categories equipped with complexity functions. We discuss several…
We consider mappings, which are structure consisting of a single function (and possibly some number of unary relations) and address the problem of approximating a continuous mapping by a finite mapping. This problem is the inverse problem…
The first steps towards linearisation of partial orders and equivalence relations are described. The definitions of partial orders and equivalence relations (on sets) are formulated in a way that is standard in category theory and that…
Theory of differential operators on associative algebras is not extended to the non-associative ones in a straightforward way. We consider differential operators on Lie algebras. A key point is that multiplication in a Lie algebra is its…
In differential geometry, the notation d^n f along with the corresponding formalism has fallen into disuse since the birth of exterior calculus. However, differentials of higher order are useful objects that can be interpreted in terms of…
Local fixpoint iteration describes a technique that restricts fixpoint iteration in function spaces to needed arguments only. It has been studied well for first-order functions in abstract interpretation and also in model checking. Here we…
We define a discrete closure operation for definably complete locally o-minimal structures $\mathcal M$. The pair of the underlying set of $\mathcal M$ and the discrete closure operation forms a pregeometry. We define the rank of a…
On the one hand the algebras of linear operators here act on finite-dimensional vector spaces, and on the other hand the point of view is generally an analysts'. Also, one might think of algebras as being used to add more data to basic…
A fundamental result from Boolean modal logic states that a first-order definable class of Kripke frames defines a logic that is validated by all of its canonical frames. We generalise this to the level of non-distributive logics that have…
Let L^1(G) and M(G) be group algebra and measure algebra of a locally compact group G, respectively and D:L^1(G)-->M(G) be a continuous linear map. We consider D behaving like derivation or anti-derivation at orthogonal elements for several…
We propose a sheaf-theoretic approach to the theory of differential calculi on quantum principal bundles over non-affine bases. After recalling the affine case we define differential calculi on sheaves of comodule algebras as sheaves of…
Logical relations are one of the most powerful techniques in the theory of programming languages, and have been used extensively for proving properties of a variety of higher-order calculi. However, there are properties that cannot be…
Much work has been done to give semantics to probabilistic programming languages. In recent years, most of the semantics used to reason about probabilistic programs fall in two categories: semantics based on Markov kernels and semantics…
In order to develop the foundations of logarithmic derived geometry, we introduce a model category of logarithmic simplicial rings and a notion of derived log \'etale maps and use this to define derived log stacks.
We study first-order logic over unordered structures whose elements carry a finite number of data values from an infinite domain which can be compared wrt. equality. As the satisfiability problem for this logic is undecidable in general, in…
Substructural type systems, such as affine (and linear) type systems, are type systems which impose restrictions on copying (and discarding) of variables, and they have found many applications in computer science, including quantum…
In this paper the fractional order logistic map in the sense of Caputo's fractional differences is numerically approached. It is shown that the necessary iterations number to avoid transients must be of order of thousand, not of order of…
Cartesian differential categories provide a categorical framework for multivariable differential calculus and also the categorical semantics of the differential $\lambda$-calculus. Taylor series expansion is an important concept for both…
The notion of inner linear Hopf algebra is a generalization of the notion of discrete linear group. In this paper, we prove two general results that enable us to enlarge the class of Hopf algebras that are known to be inner linear: the…
It is consistent that there is a partial order (P,<) of size aleph_1 such that every monotone (unary) function from P to P is first order definable in (P,<). The partial order is constructed in an extension obtained by finite support…