Related papers: Composition Conditions for Classes of Analytic Fun…

A sound and complete embedding of conditional logics into classical higher-order logic is presented. This embedding enables the application of off-the-shelf higher-order automated theorem provers and model finders for reasoning within and…

We prove that the partition rank and the analytic rank of tensors are equal up to a constant, over finite fields of any characteristic and any large enough cardinality depending on the analytic rank. Moreover, we show that a plausible…

For locally compact Hausdorff spaces $X$ and $Y$, and function algebras $A$ and $B$ on $X$ and $Y$, respectively, surjections $T:A \longrightarrow B$ satisfying norm multiplicative condition $\|Tf\, Tg\|_Y =\|fg\|_X$, $f,g\in A$, with…

Any function can be constructed using a hierarchy of simpler functions through compositions. Such a hierarchy can be characterized by a binary rooted tree. Each node of this tree is associated with a function which takes as inputs two…

We prove, in ZF+$\bf\Sigma^1_2$-determinacy, that for any analytic equivalence relation $E$, the following three statements are equivalent: (1) $E$ does not have perfectly many classes, (2) $E$ satisfies hyperarithmetic-is-recursive on a…

The aim of this paper is to define a new operator by using the generalized Struve functions. By using this operator we define a subclass of analytic functions. We discuss some properties of this class such as inclusion problems, radius…

We present a necessary and sufficient condition for the topological equivalence of a continuous function on a plane to a projection onto one of coordinates.

The use of function contracts to specify the behavior of functions often remains limited to the scope of a single function call. Relational properties link several function calls together within a single specification. They can express more…

Causal abstractions allow us to relate causal models on different levels of granularity. To ensure that the models agree on cause and effect, frameworks for causal abstractions define notions of consistency. Two distinct methods for causal…

Using quilted Floer cohomology and relative quilt invariants, we define a composition functor for categories of Lagrangian correspondences in monotone and exact symplectic Floer theory. We show that this functor agrees with geometric…

This article explores a relationship between inconsistency in the pairwise comparisons method and conditions of order preservation. A pairwise comparisons matrix with elements from an alo-group is investigated. This approach allows for a…

Parse trees are fundamental syntactic structures in both computational linguistics and compilers construction. We argue in this paper that, in both fields, there are good incentives for model-checking sets of parse trees for some word…

We study projective functions. We prove that projective functions generalise lower and upper-semianalytic ones while being stable by composition and difference. We show that the class of projective functions is closed under sums,…

We define two versions of compositions of matrix-valued rational functions of appropriate sizes and whenever analytic at infinity, offer a set of formulas for the corresponding state-space realization, in terms of the realizations of the…

Proposition algebra is based on Hoare's conditional connective, which is a ternary connective comparable to if-then-else and used in the setting of propositional logic. Conditional statements are provided with a simple semantics that is…

Designers of autonomous agents, whether in physical or virtual environments, need to express nondeterminisim, failure, and parallelism in behaviors, as well as accounting for synchronous coordination between agents. Behavior Trees are a…

We show NP-completeness for various problems about the existence of arithmetic expression trees. When given a set of operations, inputs, and a target value does there exist an expression tree with those inputs and operations that evaluates…

Necessary and sufficient conditions are already known in the Hardy spaces of both the disc and the half plane for a composition operator to be an isometry, by Nordgren in the disc and by Chalendar and Partington in the half plane. All the…

We investigate some types of composition operators, linear and not, and conditions for some spaces to be mapped into themselves and for the operators to satisfy some good properties.

We study positional properties in the context of game-based reactive synthesis. Our motivation stems from having a usable specification logic, for which tractable synthesis is guaranteed. We demonstrate that every $\omega$-regular…