Open AccessIN DEFENSE OF THE SELF-REFERENCING QUANTIFIER Sx. APPROXIMATION OF SELF-REFERENTIAL SENTENCES BY DYNAMIC SYSTEMS
Author(s) -
В. А. Степанов
Publication year - 2021
Publication title -
logiko-filosofskie študii
Language(s) - English
Resource type - Journals
eISSN - 2223-3954
pISSN - 2071-9183
DOI - 10.52119/lphs.2021.49.50.014
Subject(s) - quantifier (linguistics) , truth table , truth value , quantifier elimination , computer science , process (computing) , arithmetic , mathematics , algorithm , artificial intelligence , discrete mathematics , programming language
Arguments in defense of introducing the self-referencing quantifier Sx and its approximation on dynamical systems are consistently presented. The case of classical logic is described in detail. Generated 3-truth tables that match Priest’s tables (Priest 1979). In the process of constructing 4-truth tables, two more truth values were revealed that did not coincide with the original ones. Therefore, the closed tables turned out to be 6-digit.