Undecidability and uniform definability in classes of structures related to Pascal triangles modulo $n$

In: Tatra Mountains Mathematical Publications, vol. 11, no. 2

Ivan Korec

Detaily:

Rok, strany: 1997, 129 - 146

O článku:

Classes of structures containing $B_n(x, y)=\binom{x+y}x \mod n$ or related relations are considered. Definability of usual arithmetical operations and operations modulo $n$ in such classes is investigated. Further, for every infinite set $X$ of positive integers the elementary theory of the class $\{\langle\Bbb N; B_n\rangle:n\in X\}$ is shown to be undecidable (although it may happen that every its element has decidable theory).

Ako citovať:

ISO 690:

Korec, I. 1997. Undecidability and uniform definability in classes of structures related to Pascal triangles modulo $n$. In Tatra Mountains Mathematical Publications, vol. 11, no.2, pp. 129-146. 1210-3195.

APA:

Korec, I. (1997). Undecidability and uniform definability in classes of structures related to Pascal triangles modulo $n$. Tatra Mountains Mathematical Publications, 11(2), 129-146. 1210-3195.