COMPARISON OF DEDUCTION THEOREMS IN DIVERSE LOGIC SYSTEMS

Guo-Jun Wang ()
Additional contact information
Guo-Jun Wang: Institute of Mathematics, Shaanxi Normal University, Xi'an 710062, P. R. China

New Mathematics and Natural Computation (NMNC), 2005, vol. 01, issue 01, 65-77

Abstract: Deduction theorem and its weak forms in classical mathematical logic system, Łukasiewicz logic system, Gödel logic system, product logic system, and the fuzzy logic systemℒ*are discussed and compared. It is pointed out that the weak form of deduction theorem inℒ*has a clear structure and can be employed to define the concept of consistency degrees of finite theories. Moreover, it is clarified that the negation operator of Gödel type is too strong and is therefore unsuitable for establishing fuzzy logic systems.

Keywords: Deduction theorem; fuzzy logic system; consistency degree; almost tautology; almost contradiction (search for similar items in EconPapers)
Date: 2005
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S1793005705000044
Access to full text is restricted to subscribers

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wsi:nmncxx:v:01:y:2005:i:01:n:s1793005705000044

Ordering information: This journal article can be ordered from

DOI: 10.1142/S1793005705000044

Access Statistics for this article

New Mathematics and Natural Computation (NMNC) is currently edited by Paul P Wang

More articles in New Mathematics and Natural Computation (NMNC) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().