DocumentCode
2089779
Title
Finite-valued approximations of product logic
Author
Aguzzoli, Stefano ; Gerla, Brunella
Author_Institution
Inst. for Sci. & Technol. Res., ITC-IRST, Trento, Italy
fYear
2000
fDate
2000
Firstpage
179
Lastpage
184
Abstract
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
Keywords
decidability; formal logic; decidability; finite-valued approximating logics; product logic; propositional infinite-valued product logic; Algebra; Artificial intelligence; Calculus; Character generation; Computer science; Logic design;
fLanguage
English
Publisher
ieee
Conference_Titel
Multiple-Valued Logic, 2000. (ISMVL 2000) Proceedings. 30th IEEE International Symposium on
Conference_Location
Portland, OR
ISSN
0195-623X
Print_ISBN
0-7695-0692-5
Type
conf
DOI
10.1109/ISMVL.2000.848617
Filename
848617
Link To Document