Referenced Items are not available for this document.
In this paper we shall propose a method for the reduction of the problem of decidability in propositional infinite-valued Product Logic to suitably determined finite-valued approximating logics. In order to do so, functions associated with formulas of product logic are defined and their properties are exploited
Published in:
Multiple-Valued Logic, 2000. (ISMVL 2000) Proceedings. 30th IEEE International Symposium on
Date of Conference: 2000
- Page(s):
- 179 - 184
- Meeting Date :
- 23 May 2000-25 May 2000
- ISSN :
- 0195-623X
- Print ISBN:
- 0-7695-0692-5
- INSPEC Accession Number:
- 6629808
- Conference Location :
- Portland, OR
- Digital Object Identifier :
- 10.1109/ISMVL.2000.848617
- Product Type:
- Conference Publications
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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
