Characterization of prime numbers in Łukasiewicz's logical matrix (Q751647): Difference between revisions

This paper extends a result by \textit{D. A. Bochvar} and \textit{V. K. Finn} [in: Researches on mathematical linguistics, mathematical logic and information languages, 238-295 (Russian) (``Nauka'', Moscow, 1972)], which relates functional properties of Łukasiewicz's functions \({\mathcal L}_{n+1}\) of the logic \({\mathcal L}_{n+1}\) to the property of n being prime. It is shown that n is prime iff \({\mathcal L}_{n+1}={\mathcal T}_{n+1}\), where \({\mathcal T}_{n+1}\) is the set of all functions preserving 0 and n. The author introduces the binary operation \(\to^{K}\) in an \(n+1\)-valued matrix logic such that \(x\to^{K}y=\{y\) if \([(0<x<y<n\) and (x,y)\(\neq 1)\) or \(0<x=y<n]\) else \(x\to y\}\) where \(x\to y\equiv \min (n,n-x+y)\) is the Łukasiewicz implication. Let \({\mathfrak M}^ K_{n+1}=<M_{n+1},\sim,\to^{K},\{n\}>\), where \(M_{n+1}=\{0,1,...,n\}\), \(\sim x=n-x\) and \(\{\) \(n\}\) is the set of designated values. Let \({\mathcal K}_{n+1}\) denote the set of all functions of the matrix \({\mathfrak M}^ K_{n+1}\), then it is shown that \({\mathcal K}_{n+1}={\mathcal L}_{n+1}\) if n is prime. If for \(n=p^{\beta}\) with p prime, \(\to^{K}\) is replaced by \(\to^{K^*}\), where \(x\to^{K^*}y=\{y\) if \([0<x\leq y<n\) and (x,y)\(\neq 1\) and \(x+y\neq n]\) else \(x\to y\}\), then it is shown that \({\mathcal K}^*_{n+1}={\mathcal L}_{n+1}\).