A theory of natural numbers will be outlined in what follows. This theory will also be extended to give an account of positive and negative integers and positive and negative rational numbers. The system of logic used will be that of Whitehead and Russell's Principia mathematica with the simple theory of types. It will be assumed that the reader is familiar with the more elementary properties of relations and with such notions as the relative product of two relations, the square of a relation, the cube of a relation, and the various other whole-number powers of relations.

The guiding principle of this theory is that the natural number zero is to be regarded as the relation of the zevoth power of a relation А to А itself, and the natural number 1 is to be regarded as the relation of the first power of a relation А to А itself, and the natural number 2 is to be regarded as the relation of the square of a relation А to А itself, and so on.

In this paper we give the complete list of the functions of one variable with some of their properties, and lists of functions corresponding to various properties of sum, product, implication, and equivalence. The range of the variables as well as that of functional values will be о (false), ½, 1 (true). As an application we consider Frege's, Russell's and Heyting's systems in ternary logic. The proofs are mostly omitted as obvious if sometimes laborious.

Functions will be denned by matrices: e.g. F(p, q)

In a paper J. Łukasiewicz and A. Tarski study the systems arising out of the implication function C (x, y) = min(1, 1 – x + y) and the negation function Nx = 1 – x, where x, y are real numbers between 0 and 1 inclusive. Let us then write Сxy = min(1, 1 – x + y) and Nx = 1 – x. (1)

In this note we shall consider another implication function, namely С′xy = ССNxyy, (2)

In this paper, we are concerned with the arithmetical definability of certain notions of integers and rationals in terms of other notions. The results derived will be applied to obtain a negative solution of corresponding decision problems.

In Section 1, we show that addition of positive integers can be defined arithmetically in terms of multiplication and the unary operation of successor S (where Sa = a + 1). Also, it is shown that both addition and multiplication can be defined arithmetically in terms of successor and the relation of divisibility | (where x|y means x divides y).

Emil Post has shown that the word problem for Thue systems is unsolvable. A Thue system is a system of strings of letters x1, x2, …, xr, where a string or word is either void or a succession of letters a1a2 … at with each ai some xi. We are given a finite number of pairs of strings Ai, Bii = 1, …, m. Operations in the Thue system consist of the replacements or “productions.”