Results 291 to 300 of about 1,435,923 (372)
Some of the next articles are maybe not open access.
Normality operators and classical recapture in many-valued logic
Logic Journal of the IGPL, 2018In this paper, we use a ‘normality operator’ in order to generate logics of formal inconsistency and logics of formal undeterminedness from any subclassical many-valued logic that enjoys a truth-functional semantics.
R. Ciuni, Massimiliano Carrara
semanticscholar +1 more source
Calculi for Many-Valued Logics
Logica Universalis, 2021We present a number of equivalent calculi for many-valued logics and prove soundness and strong completeness theorems. The calculi are obtained from the truth tables of the logic under consideration in a straightforward manner and there is a natural duality among these calculi. We also prove the cut elimination theorems for the sequent-like systems.
Kaminski, Michael, Francez, Nissim
openaire +1 more source
MANY-VALUED LOGIC OF INFORMAL PROVABILITY: A NON-DETERMINISTIC STRATEGY
The Review of Symbolic Logic, 2018Mathematicians prove theorems in a semi-formal setting, providing what we’ll call informal proofs. There are various philosophical reasons not to reduce informal provability to formal provability within some appropriate axiomatic theory (Leitgeb, 2009 ...
Pawel Pawlowski, R. Urbaniak
semanticscholar +1 more source
Fundamenta Informaticae, 1991
Two families of many-valued modal logics are investigated. Semantically, one family is characterized using Kripke models that allow formulas to take values in a finite many-valued logic, at each possible world. The second family generalizes this to allow the accessibility relation between worlds also to be many-valued. Gentzen sequent calculi are given
openaire +2 more sources
Two families of many-valued modal logics are investigated. Semantically, one family is characterized using Kripke models that allow formulas to take values in a finite many-valued logic, at each possible world. The second family generalizes this to allow the accessibility relation between worlds also to be many-valued. Gentzen sequent calculi are given
openaire +2 more sources
1992
1 Preliminaries.- 2 Many-Valued Propositional Calculi.- 3 Survey of Three-Valued Propositional Calculi.- 4 Some n-valued Propositional Calculi: A Selection.- 5 Intuitionistic Propositional Calculus.- 6 First-Order Predicate Calculus for Many-Valued Logics.- 7 The Method of Finitely Generated Trees in n-valued Logical Calculi.- 8 Fuzzy Propositional ...
Leonard Bolc, Piotr Borowik
openaire +1 more source
1 Preliminaries.- 2 Many-Valued Propositional Calculi.- 3 Survey of Three-Valued Propositional Calculi.- 4 Some n-valued Propositional Calculi: A Selection.- 5 Intuitionistic Propositional Calculus.- 6 First-Order Predicate Calculus for Many-Valued Logics.- 7 The Method of Finitely Generated Trees in n-valued Logical Calculi.- 8 Fuzzy Propositional ...
Leonard Bolc, Piotr Borowik
openaire +1 more source
Logic programs and many-valued logic
Symposium on Theoretical Aspects of Computer Science, 1984A. Mycroft
openaire +2 more sources
Designing in many-valued logic
Proceedings of the Second International Conference on Intelligent Processing and Manufacturing of Materials. IPMM'99 (Cat. No.99EX296), 1999The analysis described is based on the many-valued logic of Lukasiewitcz (1970). It leads to the construction of a simple design model when the analysis cannot be based upon a two-valued logic. The reference is based on the semantics of Kripke, immersion in a definite possible world, and on the process of verification and confirmation of Carnap.
DONNARUMMA A, PAPPALARDO, Michele
openaire +2 more sources
1996
Throughout this chapter, we shall assume that k is a natural number larger than 2. We shall denote the set {0, 1,..., k − 1} by E k . The function f(x n ) = f(x 1, x 2,...,x n ) is called a function of the k-valued logic if, on any tuple α = (α 1, α2,..., α n ) of values of the variables x 1, x 2,..., x n , where α1 ∈ E k , the value f(a) also belongs ...
G. P. Gavrilov, A. A. Sapozhenko
openaire +1 more source
Throughout this chapter, we shall assume that k is a natural number larger than 2. We shall denote the set {0, 1,..., k − 1} by E k . The function f(x n ) = f(x 1, x 2,...,x n ) is called a function of the k-valued logic if, on any tuple α = (α 1, α2,..., α n ) of values of the variables x 1, x 2,..., x n , where α1 ∈ E k , the value f(a) also belongs ...
G. P. Gavrilov, A. A. Sapozhenko
openaire +1 more source
2018
Many-valued logics may be distinguished from classical logic on purely semantic grounds. One of the simplifying assumptions on which classical logic is based is the thesis of bivalence, which states that there are only two truth-values – true and false – and every sentence must be one or the other.
openaire +1 more source
Many-valued logics may be distinguished from classical logic on purely semantic grounds. One of the simplifying assumptions on which classical logic is based is the thesis of bivalence, which states that there are only two truth-values – true and false – and every sentence must be one or the other.
openaire +1 more source