Related papers: An example of a non adequate numeral system
We define a logic of propositional formula schemata adding to the syntax of propositional logic indexed propositions and iterated connectives ranging over intervals parameterized by arithmetic variables. The satisfiability problem is shown…
The formal system $\lambda\delta$ is a typed lambda calculus derived from $\Lambda_\infty$, aiming to support the foundations of Mathematics that require an underlying theory of expressions (for example the Minimal Type Theory). The system…
We first partly develop a mathematical notion of stable consistency intended to reflect the actual consistency property of human beings. Then we give a generalization of the first and second G\"odel incompleteness theorem to stably…
Safety is a syntactic condition of higher-order grammars that constrains occurrences of variables in the production rules according to their type-theoretic order. In this paper, we introduce the safe lambda calculus, which is obtained by…
Let $\mathbb{K}$ be a number field of degree $k$ and let $\mathcal{O}$ be an order in $\mathbb{K}$. A \emph{generalized number system over $\mathcal{O}$} (GNS for short) is a pair $(p,\mathcal{D})$ where $p \in \mathcal{O}[x]$ is monic and…
After a short review of the historical milestones on normal numbers, we introduce the Borel numbers as the reals admitting a probability function on their different bases representations. In this setting, we provide two probabilistic…
A complete apparatus is defined as reacting to every state of the measured system. Standard quantum mechanics of indistinguishable particles is shown to imply that apparatuses must be incomplete or else they would be drowned out by noise.…
We introduce the notion of a cellular system in order to deal with quasi-hereditary algebras. We shall prove that a necessary and sufficient condition for an algebra to be quasi-hereditary is the existence of a full divisible cellular…
Systems of germs of sets in infinite-dimensional spaces are introduced and studied. Such a system corresponds to a local zero-set of an ideal of the ring of analytic functions of infinite number of variables. Conversely, this system of…
We present several results on counting untyped lambda terms, i.e., on telling how many terms belong to such or such class, according to the size of the terms and/or to the number of free variables.
Nondeterministic Discounted-Sum Automata (NDAs) are nondeterministic finite automata equipped with a discounting factor $\lambda>1$, and whose transitions are labelled by weights. The value of a run of an NDA is the discounted sum of the…
A new sufficient condition for a list of real numbers to be the spectrum of a symmetric doubly stochastic matrix is presented; this is a contribution to the classical spectral inverse problem for symmetric doubly stochastic matrices that is…
We derive sufficient conditions for the solvability of the state estimation problem for a class of nonlinear control time-varying systems which includes those, whose dynamics have triangular structure. The state estimation is exhibited by…
Generalizations of linear numeration systems in which the set of natural numbers is recognizable by finite automata are obtained by describing an arbitrary infinite regular language following the lexicographic ordering. For these systems of…
lambda-good frame is for us a parallel of the class of models of a superstable theory. Our main line is to start with lambda-good^+ frame s, categorical in lambda, n-successful for n large enough and try to have parallel of stability theory…
Iterative numerical algorithms are typically equipped with a stopping criterion, where the iteration process is terminated when some error or misfit measure is deemed to be below a given tolerance. This is a useful setting for comparing…
A $\textit{covering system}$ is a collection of integer congruences such that every integer satisfies at least one congruence in the collection. A covering system is called $\textit{distinct}$ if all of its moduli are distinct. An expansive…
Higher-order recursion schemes are recursive equations defining new operations from given ones called "terminals". Every such recursion scheme is proved to have a least interpreted semantics in every Scott's model of \lambda-calculus in…
For a singular and symmetric discrete memoryless channel with positive dispersion, the third-order term in the normal approximation is shown to be upper bounded by a constant. This finding completes the characterization of the third-order…
The usefulness of parameterized algorithmics has often depended on what Niedermeier has called, "the art of problem parameterization". In this paper we introduce and explore a novel but general form of parameterization: the number of…