Undecidable elementary theories of classes of generalized Pascal triangles

Rok, strany: 1995, 151 - 168

Generalized Pascal triangles (GPT) are mappings of (some cofinite subsets of) $\Bbb N×\Bbb N$ into finite sets associated to some finite algebras analogously as the classical Pascal triangle can be associated to the (infinite) algebra $\langle\Bbb N;+,0\rangle$. Elementary theories of various classes of structures related to GPT are investigated. It is shown that even for GPT of very simple structure (e.g., nilpotent ones or GPT modulo 2) these theories are undecidable.

ISO 690:

Korec, I. 1995. Undecidable elementary theories of classes of generalized Pascal triangles. In Tatra Mountains Mathematical Publications, vol. 5, no.1, pp. 151-168. 1210-3195.

APA:

Korec, I. (1995). Undecidable elementary theories of classes of generalized Pascal triangles. Tatra Mountains Mathematical Publications, 5(1), 151-168. 1210-3195.