Related papers: A decision procedure for linear "big O" equations
Let $F$ be a rational function of one complex variable of degree $m\geq 2$. The function $F$ is called simple if for every $z\in \mathbb C\mathbb P^1$ the preimage $F^{-1}\{z\}$ contains at least $m-1$ points. We show that if $F$ is a…
We give a new proof of quantifier elimination in the theory of all ordered abelian groups in a suitable language. More precisely, this is only "quantifier elimination relative to ordered sets" in the following sense. Each definable set in…
A word-to-word function is rational if it can be realized by a non-deterministic one-way transducer. Over finite words, it is a classical result that any rational function is regular, i.e. it can be computed by a deterministic two-way…
We suggest the necessary/sufficient criteria for the existence of a (order-by-order) solution y(x) of a functional equation F(x,y)=0 over a ring. In full generality, the criteria hold in the category of filtered groups, this includes the…
In this paper, we are going to describe the solutions of the functional equation $$ \varphi\Big(\frac{x+y}{2}\Big)(f(x)+f(y))=\varphi(x)f(x)+\varphi(y)f(y) $$ concerning the unknown functions $\varphi$ and $f$ defined on an open interval.…
We study and partially classify cubic rational expressions $g(x)/h(x)$ over a finite field $\mathbb{F}_q$, up to pre- and post-composition with independent M\"obius transformations. In particular, we obtain a full classification when $q$ is…
The multiplicative theory of a set of numbers (which could be natural, integer, rational, real or complex numbers) is the first-order theory of the structure of that set with (solely) the multiplication operation (that set is taken to be…
This paper presents a simple decidable logic of functional dependence LFD, based on an extension of classical propositional logic with dependence atoms plus dependence quantifiers treated as modalities, within the setting of generalized…
We investigate the problem of deciding whether a system of linear equations, together with divisibility conditions on the variables, has a solution over holomorphy subrings of global fields. We obtain decidability results when we allow…
We show that the first-order theory of structural subtyping of non-recursive types is decidable. Let $\Sigma$ be a language consisting of function symbols (representing type constructors) and $C$ a decidable structure in the relational…
In this paper we describe a general method to generate superoscillatory functions of several variables starting from a superoscillating sequence of one variable. Our results are based on the study of suitable infinite order differential…
Let $R$ be an o-minimal expansion of a group in a language in which $\textrm{Th}(R)$ eliminates quantifiers, and let $C$ be a predicate for a valuational cut in $R$. We identify a condition that implies quantifier elimination for…
It is open whether equivalence ( f = g ) is decidable for string-to-string polyregular functions. We consider their higher-order extension based on the {\lambda}-calculus definition of polyregular functions from Boja\'nczyk (2018). In this…
In this paper we consider a fragment of the first-order theory of the real numbers that includes systems of equations of continuous functions in bounded domains, and for which all functions are computable in the sense that it is possible to…
Let f:{-1,1}^n -> R be a real function on the hypercube, given by its discrete Fourier expansion, or, equivalently, represented as a multilinear polynomial. We say that it is Boolean if its image is in {-1,1}. We show that every function on…
We study the question of whether a given regular language of finite trees can be defined in first-order logic. We develop an algebraic approach to address this question and we use it to derive several necessary and sufficient conditions for…
We define a model of predicate logic in which every term and predicate, open or closed, has an absolute denotation independently of a valuation of the variables. For each variable a, the domain of the model contains an element [[a]] which…
Developing suitable formal semantics can be of great help in the understanding, design and implementation of a programming language, and act as a guide for software development tools like analyzers or partial evaluators. In this sense, full…
We present in this paper a first-order axiomatization of an extended theory $T$ of finite or infinite trees, built on a signature containing an infinite set of function symbols and a relation $\fini(t)$ which enables to distinguish between…
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…