@article{MASLO_1994_44_5_a5,
author = {Korec, Ivan},
title = {Structures related to {Pascal's} triangle modulo $2$ and their elementary theories},
journal = {Mathematica slovaca},
pages = {531--554},
year = {1994},
volume = {44},
number = {5},
mrnumber = {1338427},
zbl = {0824.11008},
language = {en},
url = {http://geodesic.mathdoc.fr/item/MASLO_1994_44_5_a5/}
}
Korec, Ivan. Structures related to Pascal's triangle modulo $2$ and their elementary theories. Mathematica slovaca, Tome 44 (1994) no. 5, pp. 531-554. http://geodesic.mathdoc.fr/item/MASLO_1994_44_5_a5/
[Bo] BONDARENKO B. A.: Generalized Pascal Triangles and Pyramids, Their Fractals. Graphs and Applications (Russian), Fan, Tashkent, 1990. | MR | Zbl
[K1] KOREC I.: Generalized Pascal triangles. Decidability results. Acta Math. Univ. Comenian. 46-47 (1985), 93-130. | MR | Zbl
[K2] KOREC I.: Generalized Pascal triangles. In: Proceedings of the V. Universal Algebra Symposium, Turawa, Poland, May 1988 (K. Halkowska and S. Stawski, eds.), World Scientific, Singapore, 1989, pp. 198-218. | MR
[K3] KOREC I.: Definability of arithmetic operations in Pascal triangle modulo an integer divisible by two primes. Grazer Math. Ber. 318 (1993), 53-61. | MR | Zbl
[Le] LE M.: On the number of solutions of the generalized Ramanjuan-Nagell equation $x^2 - D = 2^{n+2}$. Acta Arith. 60 (1991), 149-167. | MR
[Mo] MONK J. D.: Mathematical Logic. Springer Verlag, New York, 1976. | MR | Zbl
[Ri] RICHARD D.: Answer to a problem raised by J. Robinson: the arithmetic of positive or negative integers is definable from successor and divisibility. J. Symbolic Logic 50 (1985), 927-935. | MR | Zbl
[Ro] ROBINSON J.: Definability and decision problems in arithmetic. J. Symbolic Logic 14 (1949), 98-114. | MR | Zbl
[Se] SEMENOV A. L.: On definability of arithmetic in their fragments. (Russian), Dokl. Akad. Nauk SSSR 263 (1982), 44-47. | MR
[Sh] SHOENFIELD J. R.: Mathematical Logic. Addison -Wesley, Reading, 1967. | MR | Zbl
[Si] SINGMASTER D.: Notes on binomial coefficients III - Any integer divides almost all binomial coefficients. J. London Math. Soc. (2) 8 (1974), 555-560. | MR | Zbl
[Wo] WOODS A.: Some Problems in Logic and Number Theory, and Their Connection. Ph.D. Thesis, University of Manchester, Manchester, 1981.
[Ye] YERSHOW, JU. L.: Decidability Problems and Constructive Models. (Russian), Nauka, Moscow, 1980.