Let U be a strictly increasing sequence of integers. By a greedy algorithm, every nonnegative integer has a greedy U -representation. The successor function maps the greedy U -representation of N onto the greedy U -representation of N+1. We characterize the sequences U such that the successor function associated to U is a left, resp. a right sequential function. We also show that the odometer a...

In 1990, J.L. Krivine introduced the notion of storage operator to simulate, for Church integers, the “call by value” in a context of a “call by name” strategy. In this present paper, we define, for every λ-term S which realizes the successor function on Church integers, the notion of S-storage operator. We prove that every storage operator is a S-storage operator. But the converse is not alway...

Successor planning process in family businesses is recognized as one of the most important phases of family business lifecycle. Family businesses play a vital role in developing regional and global economy and fuel the creation of new jobs, new business growth and increase in entrepreneurial activities. In this study, it was attempted to investigate the impact of family business characteristics...

A language in which we can express arithmetic and which contains its own satisfaction predicate (in the style of Kripke’s theory of truth) can be formulated using just two nonlogical primitives: ′ (the successor function) and Sat (a satisfaction predicate). Let L be a language with vocabulary: , ( ) ∃ ¬ ∨ = ′ Sat plus the variables x0, x1, x2, . . .. A term is a variable followed by zero or mor...