Deformalization as the immanent part of logical solving

Main Article Content

Николай Николаевич Непейвода

Аннотация

Deformalization is the part of logical process least investigated and studied. It is often non-trivial and hard task because of
subjective and objective complexities.

Subjective complexities connected with logic.
Deformalization is needed to present results of logical investigations to outsiders. Outsiders usually use languages and formalisms very far from logical ones.
Their thesaurus usually barely intersects with logical one.
Thus formulations on logical language cannot be appreciated and comprehended by outsiders and formulation of results needs to be completely replaced by non-logical. This task often is like to translating from one natural language into another with radically different semantic structure and system of notions (e.g. from Russian into Chinese and vice versa).

Subjective complexities connected with roles.
Systems of values of the problem solver and the decision consumer is radically different. Many aspects which were important during solution are out of scope of interests of the consumer. Many aspects which were "important" for the consumer are to be negligible for the solver but they are to be restored in presentation of the decision. This side of deformalization leads a bridge to the objective complexities.

Objective complexities.
Methods applied during formalization and solving induce "dual" methods are to be applied during deformalization.

General conclusions and propositions.
After analyzing whole process of logical solving in its unity it is possible to make some conclusions how logic can take a place which it is worth both in scientific analysis and in education.

Interesting in more detailed speculations of this matter are addressed to the Russian variant.

Скачивания

Данные скачивания пока не доступны.

Article Details

Как цитировать
Непейвода Н. Н. Deformalization as the immanent part of logical solving // Логические исследования / Logical Investigations. 2019. Т. 25. № 1. C. 120-130.
Раздел
Дискуссии

Литература

Anastassiou, Oktay, 2013 – Anastassiou, G.A., Oktay, D. (eds.) Advances in Applied Mathematics and Approximation Theory Contributions from AMAT 2012. Springer, 2013, 486 pp.
AGDA, 2017 – “The AGDA Wiki”. [http://wiki.portal.chalmers.se/agda/ pmwiki.php, accessed on 08.08.2017].
Arnold, 2004 – Arnold, V.I. “Zhestkie” i “myagkie” matematicheskie modeli [“Hard” and “soft” mathematical models]. Moscow: MCNIMO, 2004. 32 pp. (In Russian) Cardeñosa et al, 2005 – Cardeñosa, J., Gelbukh, A., Tovar, E. with prologue by Pèrez C.G. Universal Networking Language: Advances in Theory and Application. Special issue of Research on Computing Science. IPN, 2005. 443 pp.
Rlimam, 2007 – Elimam, A. S. “The Impact of Translation Memory Tools on the Translation Profession”, Translation Journal, Vol. 11, No. 1, 2007.
Fomichov, 2009 – Fomichov, V. A. Semantics-oriented natural lanuage processing: Mathematical Models and Algorithms. Springer, 2009. 328 pp.
Ivanov, 2015 – Ivanov, M.G. Kak ponimat’ kvantovuyu mehaniku [Understanding quantum mechanics], Moscow — Izhevsk: R&C Dynamics, 2015. 552 pp. (In Russian) Kohen, Nagel, 1993 – Kohen, M.R., Nagel, E. An Introduction to logic and scientific method. Harcourt: Brace and Co. 2nd ed. 1993.
Lagoudaki, 2006 – Lagoudaki, E. Translation Memory systems: Enlightening users’ perspective. Imperial College London, Translation Memories Survey, 2006. 16 pp.
Martins, 2013 – Lexical Issues of UNL: Universal Networking Language 2012 Panel, ed by Ronaldo Martins. Cambridge Scholars Publishing, 2013. 144 pp.
Kelvin, Tait, 1912 – Lord Kelvin, Tait, P.G. Treatise of natural philosophy part I, II. Cambridge: University Press, 1912.
Meshveliani, 2017 – Meshveliani, S.D. “Programmirovanie vychislitel’noj algebry na osnove konstruktivnoj matematiki. Oblasti s razlozheniem na prostye mnozhiteli” [Programming of computer algebra by constructive mathematics. Domains with factorization], Programmnye sistemy: teoriya i prilozheniya, 2017, Vol. 8, No. 1, pp. 3–46. (In Russian)
Nepejvoda, 1989 – Nepejvoda, N.N. “Logicheskij podhod kak al’ternativa sistemnomu v matematicheskom opisanii sistem” [Logical approach as alternative to system approach in a mathematical description of systems], Ekspertnye sistemy: sostoyanie i perspektivy [Expert systems: state of arts and perspectives]. Moscow: Nauka, 1989, pp. 20–30. (In Russian)
Nepejvoda, 2000 – Nepejvoda, N.N. Prikladnaya logika [Applied logics]. Nsk: NGUPress, 2000. 521 pp. (In Russian)
Nepejvoda, 2008 – Nepejvoda, N.N. “Logika kak central’noe zveno v obuchenii informatikov i analitikov” [Logic as crucial chain in tutoring of informatic and system analysis specialists], Sovet Rektorov, 2008, No. 3, 4, pp. 6–12, 7–15. (In Russian)
Nepejvoda, 2017 – Nepejvoda, N.N. “Formalizaciya i deformalizaciya kak neot’emlemye chasti logiki” [Formalization and deformalization as part of logics], in Desyatye smirnovskie chteniya po logike [Tenth Smirnov Readings on logic]. Moscow: Sovremennye Tetradi, 2017, pp. 105–106. (In Russian)
Nepejvoda, 2018 – Nepejvoda, N.N. “Formalization as the Immanent Part of Logical Solving”, Logical investigations, 2018, Vol. 24, No. 1, pp. 129–145.
Pfangzal, 1973 – Pfangzal, J. Theory of Measurement, 2nd ed. Physica-Verlag, 1973. 236 pp.
Roberts, 1985 – Roberts, F.S. Measurement Theory with Applications to Decisionmaking, Utility, and the Social Sciences. Cambridge University Press, I985. 420 pp. Scientometrics, 1978 – Scientometrics. Akademiai Kiado, Springer Science, Business Media, 1978.
Stevens, 1946 – Stevens, S.S. “On the Theory of Scales of Measurement”, Science New Series, Vol. 103, No. 2684 (Jun. 7, 1946), pp. 677–680.
Pym, 2013 – Pym, A. “Translation Skill-Sets in a Machine-Translation Age”, Meta: Translators’ Journal, Vol. 58, No. 3, pp. 487–503. [http://id.erudit.org/ iderudit/1025047ar, accessed on 18.09.2018].
Uchida et al, 2005 – Uchida H., Zhu M., Della Senta T. Universal Networking Language, 2nd ed. UNDL Foundation, 2005.