Access Restriction

Author Boldrin, Luca ♦ Brennero, Via ♦ Sossai, Claudio
Source CiteSeerX
Content type Text
Publisher Kluwer Academic Publishers
File Format PDF
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Truth Functionality ♦ Suitable Language ♦ Truth-functional Semantics ♦ Completeness Theorem ♦ Necessity-valued Logic ♦ Forcing Technique ♦ Truth Value ♦ Measure-based Logic ♦ Sequent Calculus Form ♦ Pavelka Language ♦ Proof System ♦ Many-valued Truth-functional Semantics ♦ Classical Logic ♦ Subsequent Step ♦ Informational State ♦ Possibility Distribution ♦ Necessity Measure ♦ Enough Information
Description We present a truth-functional semantics for necessity-valued logics, based on the forcing technique. We interpret possibility distributions (which correspond to necessity measures) as informational states, and introduce a suitable language (basically, an extension of classical logic, similar to Pavelka’s language). Then we define the relation of “forcing ” between an informational state and a formula, meaning that the state contains enough information to support the validity of the formula. The subsequent step is the definition of a many-valued truth-functional semantics, by simply taking the truth value of a formula to be the set of all informational states that force the truth of the formula. A proof system in sequent calculus form is provided, and validity and completeness theorems are proved. 1
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research
Education Level UG and PG ♦ Career/Technical Study
Learning Resource Type Article
Publisher Date 1999-01-01
Publisher Institution Fuzzy Sets, Logics and Reasoning about Knowledge