Related papers: An example of a non adequate numeral system
A zero-sum sequence over ${\mathbb Z}$ is a sequence with terms in ${\mathbb Z}$ that sum to $0$. It is called minimal if it does not contain a proper zero-sum subsequence. Consider a minimal zero-sum sequence over ${\mathbb Z}$ with…
We introduced the notation of a set of prohibitions and give definitions of a complete set and a crucial word with respect to a given set of prohibitions. We consider 3 particular sets which appear in different areas of mathematics and for…
Analysis on fractals is a growing field, with hints of potential for widespread applicability across all of STEM. One of the most heavily researched type of fractals are the nested fractals, fractal shapes defined by virtue of being made of…
We consider the untyped lambda calculus with constructors and recursively defined constants. We construct a domain-theoretic model such that any term not denoting bottom is strongly normalising provided all its `stratified approximations'…
In this letter, a new notion of stability is introduced, which is called triangular stability. A system is called triangularly stable if the norm of its state vector is bounded by a decreasing linear function of time such that its…
We present an extension of System F with call-by-name exceptions. The type system is enriched with two syntactic constructs: a union type for programs whose execution may raise an exception at top level, and a corruption type for programs…
A numerical set $T$ is a subset of $\mathbb N_0$ that contains $0$ and has finite complement. The atom monoid of $T$ is the set of $x \in \mathbb N_0$ such that $x+T \subseteq T$. Marzuola and Miller introduced the anti-atom problem: how…
Many different systems with explicit substitutions have been proposed to implement a large class of higher-order languages. Motivations and challenges that guided the development of such calculi in functional frameworks are surveyed in the…
Scoring systems are classification models that only require users to add, subtract and multiply a few meaningful numbers to make a prediction. These models are often used because they are practical and interpretable. In this paper, we…
We describe an algorithm to count the number of distinct real zeros of a polynomial (square) system f. The algorithm performs O(n D kappa(f)) iterations where n is the number of polynomials (as well as the dimension of the ambient space), D…
We describe a framework for systematic enumeration of families combinatorial structures which possess a certain regularity. More precisely, we describe how to obtain the differential equations satisfied by their generating series. These…
Consider a non-standard numeration system like the one built over the Fibonacci sequence where nonnegative integers are represented by words over $\{0,1\}$ without two consecutive 1. Given a set $X$ of integers such that the language of…
We look for a parallel to the notion of ``proper forcing'' among lambda-complete forcing notions not collapsing lambda^+ . We suggest such a definition and prove that it is preserved by suitable iterations.
In the present paper and as an application of Roth's theorem concerning the rational approximation of algebraic numbers, we give a sufficient condition that will assure us that a series of positive rational terms is a transcendental number.…
In this book I treat the structure of D-module which has countable basis. If we do not care for topology of D-module, then we consider Hamel basis. If norm is defined in D-module, then we consider Schauder basis. In case of Schauder basis,…
We provide a semi-grammatical description of the set of normal proofs of positive formulae in minimal predicate logic, i.e. a grammar that generates a set of schemes, from each of which we can produce a finite number of normal proofs. This…
Sequences of numbers (either natural integers, or integers or rational) of level $k \in \mathbb{N}$ have been defined in \cite{Fra05,Fra-Sen06} as the sequences which can be computed by deterministic pushdown automata of level $k$. This…
Parametric timed automata extend the standard timed automata with the possibility to use parameters in the clock guards. In general, if the parameters are real-valued, the problem of language emptiness of such automata is undecidable even…
This work is meant to be a step towards the formal definition of the notion of algorithm, in the sense of an equivalence class of programs working "in a similar way". But instead of defining equivalence transformations directly on programs,…
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…