We prove that coverability and termination are not primitive-recursive for lossy counter machines and for Reset Petri nets.

A polynomially bounded recursive realizability, in which the recursive functions used in Kleene’s realizability are restricted to polynomially bounded functions, is introduced. It is used to show that provably total functions of Ruitenburg’s Basic Arithmetic are polynomially bounded (primitive) recursive functions. This sharpens our earlier result where those functions were proved to be primiti...

We follow [31] in defining the set of primitive recursive functions. The important helper notion is the homogeneous function from finite sequences of natural numbers into natural numbers where homogeneous means that all the sequences in the domain are of the same length. The set of all such functions is then used to define the notion of a set closed under composition of functions and under prim...

Let IΣ1 be the fragment of elementary Peano Arithmetic in which induction is restricted to Σ1-formulas. More than three decades ago, Charles Parsons showed that the provably total functions of IΣ1 are exactly the primitive recursive functions. In this paper, we observe that Parsons’ result is a consequence of Herbrand’s theorem concerning the ∃∀∃-consequences of universal theories. We give a se...

Compilers for functional languages such as Standard ML can do a good job compiling programs, especially programs that perform symbolic computation. However, they often do a poor job on programs in a wide range of real-world application domains, such as systems programming and scientific computing. One reason for this is that these compilers are not sensitive to program structure, that is, recur...

For weakly regular bent functions in odd characteristic the dual function is also bent. We analyse a recently introduced construction of nonweakly regular bent functions and show conditions under which their dual is bent as well. This leads to the definition of the class of dual-bent functions containing the class of weakly regular bent functions as a proper subclass. We analyse self-duality fo...

We follow [23] in defining the set of primitive recursive functions. The important helper notion is the homogeneous function from finite sequences of natural numbers into natural numbers where homogeneous means that all the sequences in the domain are of the same length. The set of all such functions is then used to define the notion of a set closed under composition of functions and under prim...

We study a powerful class of logic programs which terminate for a large class of goals. Both classes are characterized in a natural way in terms of mappings from variable-free atoms to natural numbers. Based on this idea we present a technique which improves the termination behaviour and allows a more multidirectional use of Prolog programs. The class of logic programs is shown to be strong eno...

We study the space of binary cubic and quadratic forms over the ring of integers O of an algebraic number field k. By applying the theory of prehomogeneous vector spaces founded by M. Sato and T. Shintani, we can associate the zeta functions for these spaces. Applying these zeta functions, we derive some density theorems on the distributions of discriminants of cubic algebras of O. In the case ...

Given a random sequence of holomorphic maps f1, f2, f3, . . . of the unit disk ∆ to a subdomain X, we consider the compositions Fn = f1 ◦ f2 ◦ . . . fn−1 ◦ fn. The sequence {Fn} is called the iterated function system coming from the sequence f1, f2, f3, . . . . We prove that a sufficient condition on the domain X for all limit functions of any {Fn} to be constant is also necessary. We prove the...