Add to ORKGThe structure of set of primitive systems of natural numbers is described and the main properties of primitive systems are installed. With usage of concepts deadlockness and fe-minimalities of primitive systems the algorithm of listing of primitive systems of the numbers which are not exceeding the given number m is constructed
AbstractThe study of the redundancy of non-integer base numeration systems involves several fields o...
Much (perhaps all) of mathematics is about studying sets of objects with particular properties. Sect...
If ν and μ are some Δcomputable numberings of families of sets of the naturals then P(x,y) ⇔ ν(x)′ ≠...
AbstractA basic system is a nonempty collection of finite incomparable subsets of a set such that fo...
Objectives Definition of general principles for constructing indexing systems for elements of finite...
In the present paper, we deal with the methodology of constructing modular number systems (MNS), nam...
AbstractLet Δn and k be positive integers, k≥3. By an (l, n) system is meant a family of l distinct ...
The main purpose of this paper is to study the arithmetical properties of the primitive numbers of p...
Summary. Basic properties of the least common multiple and the greatest common divisor. The lattice ...
AbstractWe show that some decidability questions concerning recognizable sets of integers for abstra...
In this paper we defined the reduced residue system and proved its fundamental properties. Then we p...
When finding divisors of a number, various divisibility criteria are employed. Sometimes, the use of...
AbstractA numeration system is a sequence of integers such that any integer can be represented by me...
The natural numbers are presented first in the master's thesis. We introduced them through Pean axio...
This article studies the expressive power of finite automata recognizing setsof real numbers encoded...
AbstractThe study of the redundancy of non-integer base numeration systems involves several fields o...
Much (perhaps all) of mathematics is about studying sets of objects with particular properties. Sect...
If ν and μ are some Δcomputable numberings of families of sets of the naturals then P(x,y) ⇔ ν(x)′ ≠...
AbstractA basic system is a nonempty collection of finite incomparable subsets of a set such that fo...
Objectives Definition of general principles for constructing indexing systems for elements of finite...
In the present paper, we deal with the methodology of constructing modular number systems (MNS), nam...
AbstractLet Δn and k be positive integers, k≥3. By an (l, n) system is meant a family of l distinct ...
The main purpose of this paper is to study the arithmetical properties of the primitive numbers of p...
Summary. Basic properties of the least common multiple and the greatest common divisor. The lattice ...
AbstractWe show that some decidability questions concerning recognizable sets of integers for abstra...
In this paper we defined the reduced residue system and proved its fundamental properties. Then we p...
When finding divisors of a number, various divisibility criteria are employed. Sometimes, the use of...
AbstractA numeration system is a sequence of integers such that any integer can be represented by me...
The natural numbers are presented first in the master's thesis. We introduced them through Pean axio...
This article studies the expressive power of finite automata recognizing setsof real numbers encoded...
AbstractThe study of the redundancy of non-integer base numeration systems involves several fields o...
Much (perhaps all) of mathematics is about studying sets of objects with particular properties. Sect...
If ν and μ are some Δcomputable numberings of families of sets of the naturals then P(x,y) ⇔ ν(x)′ ≠...