Cart (Loading....) | Create Account
Close category search window

Graded consequence relations of lattice-valued propositional logic LP(X)

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Xuefang Wang ; Dept. of Appl. Math., Southwest Jiaotong Univ., Chengdu, China ; Meng, D. ; Yang Xu ; Keyun Qin

In this paper, graded consequence relations in lattice-valued propositional logic LP(X) are studied. First, valuation sets in LP(X) are defined and their properties are discussed. Based on these, a graded semantic consequence relation between an L-fuzzy set of formulae and a formula is specified. Accordingly, graded syntactic consequence relation is also given. It is demonstrated that these two classes of graded consequence relations are generalizations of counterparts in classical logic and even in LP(X). Furthermore, graded soundness problem, graded completeness theorem and graded deduction theorem for them are given and proven.

Published in:

Systems, Man and Cybernetics, 2003. IEEE International Conference on  (Volume:5 )

Date of Conference:

5-8 Oct. 2003

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.