Related papers: An example of a non adequate numeral system
One of the key concepts in testing is that of adequate test sets. A test selection criterion decides which test sets are adequate. In this paper, a language schema for specifying a large class of test selection criteria is developed; the…
We prove, for stably computably enumerable formal systems, direct analogues of the first and second incompleteness theorems of G\"odel. A typical stably computably enumerable set is the set of Diophantine equations with no integer…
Every orthonomic system of partial differential equations is known to possess a finite number of integrability conditions sufficient to ensure the validity of all. Herewith we offer an efficient algorithm to construct a sufficient set of…
We show that $n$ is almost perfect if and only if $I(n) - 1 < D(n) \leq I(n)$, where $I(n)$ is the abundancy index of $n$ and $D(n)$ is the deficiency of $n$. This criterion is then extended to the case of integers $m$ satisfying $D(m)>1$.
Counters that hold natural numbers are ubiquitous in modeling and verifying software systems; for example, they model dynamic creation and use of resources in concurrent programs. Unfortunately, such discrete counters often lead to…
A numeration system originally implies a digitization of real numbers, but in this paper it rather implies a compactification of real numbers as a result of the digitization. By definition, a numeration system with $G$, where $G$ is a…
We call a subset of an ordinal $\lambda$ recognizable if it is the unique subset $x$ of $\lambda$ for which some Turing machine with ordinal time and tape, which halts for all subsets of $\lambda$ as input, halts with the final state $0$.…
Five algebraic notions of termination are formalised, analysed and compared: wellfoundedness or Noetherity, L\"ob's formula, absence of infinite iteration, absence of divergence and normalisation. The study is based on modal semirings,…
It has long been taken for granted that there is only one type of thermodynamic system near absolute zero temperature: the ordinary one compatible with all statements of the third law, with a fundamental yet tacit assumption that all heat…
We define a general notion of "summability" of a set $I\subseteq\mathbb{C^{N}}$ and show that some trivial condition necessary for a set to be summable, is also sufficient. We deduce some intresting corollaries.
We extend the well-known Dumont--Thomas numeration systems to $\mathbb{Z}$ using an approach inspired by the two's complement numeration system. Integers in $\mathbb{Z}$ are canonically represented by a finite word (starting with…
We introduce more properties of forcing notions which imply that their lambda-support iterations are lambda-proper, where lambda is an inaccessible cardinal. This paper is a direct continuation of section A.2 of math.LO/0210205. As an…
A perfect number is a positive integer n such that n equals the sum of all positive integer divisors of n that are less than n. That is, although n is a divisor of n, n is excluded from this sum. Thus 6 = 1 + 2 + 3 is perfect, but 12 < 1 +…
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…
Infinite types and formulas are known to have really curious and unsound behaviors. For instance, they allow to type {\Omega}, the auto- autoapplication and they thus do not ensure any form of normalization/productivity. Moreover, in most…
A system of linear equations $L$ is said to be norming if a natural functional $t_L(\cdot)$ giving a weighted count for the set of solutions to the system can be used to define a norm on the space of real-valued functions on…
Complete residue systems play an integral role in abstract algebra and number theory, and a description is typically found in any number theory textbook. This note provides a concise overview of complete residue systems, including a robust…
A number is perfect if it is the sum of its proper divisors; here we call a finite group `perfect' if its order is the sum of the orders of its proper normal subgroups. (This conflicts with standard terminology but confusion should not…
Many numerical problems with input $x$ and output $y$ can be formulated as a system of equations $F(x, y) = 0$ where the goal is to solve for $y$. The condition number measures the change of $y$ for small perturbations to $x$. From this…
Suppose $\Lambda$ is a discrete infinite set of nonnegative real numbers. We say that $ {\Lambda}$ is of type 1 if the series $s(x)=\sum_{\lambda\in\Lambda}f(x+\lambda)$ satisfies a zero-one law. This means that for any non-negative…