z-logo
open-access-imgOpen Access
Formal polynomials, heuristics and proofs in logic
Author(s) -
У. Карниэлли
Publication year - 2010
Publication title -
logičeskie issledovaniâ
Language(s) - English
Resource type - Journals
eISSN - 2413-2713
pISSN - 2074-1472
DOI - 10.21146/2074-1472-2010-16-0-280-294
Subject(s) - classical logic , algebra over a field , mathematics , mathematical proof , modal , modal logic , representation (politics) , heuristics , computer science , calculus (dental) , discrete mathematics , pure mathematics , mathematical optimization , geometry , dentistry , chemistry , politics , political science , polymer chemistry , law , medicine
This note surveys some previous results on the role of formal polynomials as a representation method for logical derivation in classical and non-classical logics, emphasizing many-valued logics, paraconsistent logics and modal logics. It also discusses the potentialities of formal polynomials as heuristic devices in logic and for expressing certain meta-logical properties, as well as pointing to some promising generalizations towards algebraic geometry.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here