Multi-valued Logics
نویسنده
چکیده
2 General theory 3 2.1 Semantics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2.2 Some logical calculi . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 2.2.1 Sequent and tableau calculi . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 2.2.2 Resolution calculi . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 2.3 Post systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12 2.4 Lukasiewicz systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 2.5 Other systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16 2.5.1 Bochvar’s and Kleene’s systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16 2.5.2 Gödel’s system . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17 2.5.3 Belnap’s system . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18 2.6 Extension to the predicate case . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19
منابع مشابه
χChek: A Model Checker for Multi-Valued Reasoning
This paper describes our multi-valued symbolic modelchecker χChek. χChek is a generalization of an existing symbolic model-checking algorithm for a multi-valued extension of the temporal logic CTL. Multi-valued modelchecking supports reasoning with values other than just TRUE and FALSE. Multi-valued logics are useful in software engineering because they support explicit modeling of uncertainty,...
متن کامل\chiChek: A Model Checker for Multi-Valued Reasoning
This paper describes our multi-valued symbolic modelchecker χChek. χChek is a generalization of an existing symbolic model-checking algorithm for a multi-valued extension of the temporal logic CTL. Multi-valued modelchecking supports reasoning with values other than just TRUE and FALSE. Multi-valued logics are useful in software engineering because they support explicit modeling of uncertainty,...
متن کاملReduction of Many-valued into Two-valued Modal Logics
In this paper we develop a 2-valued reduction of many-valued logics, into 2-valued multi-modal logics. Such an approach is based on the contextualization of many-valued logics with the introduction of higher-order Herbrand interpretation types, where we explicitly introduce the coexistence of a set of algebraic truth values of original many-valued logic, transformed as parameters (or possible w...
متن کاملResolution and Clause Learning for Multi-Valued CNF Formulas
Conflict-directed clause learning (CDCL) is the basis of SAT solvers with impressive performance on many problems. CDCL with restarts (CDCL-R) has been shown to have essentially the same reasoning power as unrestricted resolution (formally, they p-Simulate each other). We show that this property generalizes to multi-valued CNF formulas. In particular, for Signed (or Multi-Valued) CNF formulas, ...
متن کاملTruth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملData structures for symbolic multi-valued model-checking
Multi-valued logics can be effectively used to reason about incomplete and/or inconsistent systems, e.g. during early software requirements or as the systems evolve. In our earlier work we identified a useful family of multi-valued logics: those specified over finite distributive lattices where negation preserves involution, i.e., , , -/.0for every element of the logic. Model-checking over this...
متن کامل