Related papers: On Preparation Theorems for $\mathbb{R}_{an,exp}$-…
Ordered logics and type systems have been used in a variety of applications including computational linguistics, memory allocation, stream processing, logical frameworks, parametricity, and enforcing security protocols. In most…
Existing refinement calculi provide frameworks for the stepwise development of imperative programs from specifications. This paper presents a refinement calculus for deriving logic programs. The calculus contains a wide-spectrum logic…
This paper extends the classical Ostrogradsky-Hermite reduction for rational functions to more general functions in primitive extensions of certain types. For an element $f$ in such an extension $K$, the extended reduction decomposes $f$ as…
We first show that the projection image of a discrete definable set is again discrete for an arbitrary definably complete locally o-minimal structure. This fact together with the results in a previous paper implies tame dimension theory and…
The notion of constructible functions in the setting of tame real geometry has been introduced by Cluckers and Dan Miller in their work on parametric integration of globally subanalytic functions. A function on a globally subanalytic set is…
Definite descriptions are expressions of the form "the unique $x$ satisfying property $C$," which allow reference to objects through their distinguishing characteristics. They play a crucial role in ontology and query languages, offering an…
We describe an algorithm to decompose rational functions from which we determine the poset of groups fixing these functions.
Regular functions of infinite words are (partial) functions realized by deterministic two-way transducers with infinite look-ahead. Equivalently, Alur et. al. have shown that they correspond to functions realized by deterministic Muller…
We introduce a category-theoreticabstraction of a syntax with auxiliary functions, called an admissiblemonad morphism. Relying on an abstract form of structural recursion,we then design generic tools to construct admissible monad…
Let $A \cong k\langle X \rangle / I$ be an associative algebra. A finite word over alphabet $X$ is $I${\it-reducible} if its image in $A$ is a $k$-linear combination of length-lexicographically lesser words. An {\it obstruction} in a…
Regular functions from infinite words to infinite words can be equivalently specified by MSO-transducers, streaming $\omega$-string transducers as well as deterministic two-way transducers with look-ahead. In their one-way restriction, the…
We provide a sound and complete proof system for an extension of Kleene's ternary logic to predicates. The concept of theory is extended with, for each function symbol, a formula that specifies when the function is defined. The notion of…
We develop a weakest-precondition-style calculus \`a la Dijkstra for reasoning about amortized expected runtimes of randomized algorithms with access to dynamic memory - the $\textsf{aert}$ calculus. Our calculus is truly quantitative, i.e.…
The main purpose of this paper is to give characterization theorems on derivations as well as on linear functions. Among others the following problem will be investigated: Let $n\in\mathbb{Z}$, $f, g\colon\mathbb{R}\to\mathbb{R}$ be…
Definite descriptions are phrases of the form 'the $x$ such that $\varphi$', used to refer to single entities in a context. They are often more meaningful to users than individual names alone, in particular when modelling or querying data…
One of the elegant achievements in the history of proof theory is the characterization of the provably total recursive functions of an arithmetical theory by its proof-theoretic ordinal as a way to measure the time complexity of the…
We prove that some holomorphic continuations of functions in the classes $\mathbf{an}^*$ and $\mathcal{G}$ are definable in the o-minimal structures $\mathbb{R}_{\mathrm{an}^*}$ and $\mathbb{R}_{\mathcal{G}}$ respectively. More…
We present two new classes of orthogonal functions, log orthogonal functions (LOFs) and generalized log orthogonal functions (GLOFs), which are constructed by applying a $\log$ mapping to Laguerre polynomials. We develop basic approximation…
In order to give appropriate semantics to qualitative conditionals of the form "if A then normally B", ordinal conditional functions (OCFs) ranking the possible worlds according to their degree of plausibility can be used. An OCF accepting…
In this paper, we introduce new classes of functions that extend the known classes of functions of complex variable, such as entire functions, meromorphic functions, rational functions and polynomial functions and take values in the set of…