A new effective construction decomposes higher-arity relations on finite domains into binary relations via functional completeness of 2-input functions in many-valued logic, yielding a uniform proof of Peirce's reduction thesis.
Koshkin, Logical reduction of relations: from relational databases to Peirce’s reduction thesis, Logic Journal of the IGPL, 31 (2023) no
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.LO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Functional completeness and primitive positive decomposition of relations on finite domains
A new effective construction decomposes higher-arity relations on finite domains into binary relations via functional completeness of 2-input functions in many-valued logic, yielding a uniform proof of Peirce's reduction thesis.