Results 231 to 240 of about 10,516 (283)
Colonial harm in new packaging: Indigenous critiques of the tobacco industry's 'harm reduction' rhetoric. [PDF]
Health Promot IntMaddox R +12 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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.
Michael Kaminski +2 more
exaly +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 +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
The Modalized Many-Valued Logic
2018 14th International Conference on Semantics, Knowledge and Grids (SKG), 2018The intermediate logic is a three-valued logic proposed by Zhu. A modalized many-valued logic will be proposed in this paper which the unary connective @ $i$ is taken as a modality and a Gentzen-typed deduction system will be given so that the the system is sound and complete with the linearly many-valued semantics of the many-valued logic,
Bo Chen +5 more
openaire +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
Many valued paraconsistent logic
Proceedings 31st IEEE International Symposium on Multiple-Valued Logic, 2002In contrast to most logics, in paraconsistent logic it is not true that everything followed from a contradiction. The semantics for one of the best known paraconsistent logics, LP, permits sentences to be both true and false; but at the same time, the semantic characterization of the logical particles is classical.
openaire +1 more source
Proceedings 1997 27th International Symposium on Multiple- Valued Logic, 2002
Firstly we examine the definition of many-valued logic within the framework of (logical) matrix theory. Secondly we discuss the general result, challenging the existence of many-valued logic, according to which every logic may be seen as two-valued.
openaire +1 more source
Firstly we examine the definition of many-valued logic within the framework of (logical) matrix theory. Secondly we discuss the general result, challenging the existence of many-valued logic, according to which every logic may be seen as two-valued.
openaire +1 more source
2005
CERES is a method for cut-elimination in classical logic which is based on resolution. In this paper we extend CERES to CERES-m, a resolution-based method of cut-elimination in Gentzen calculi for arbitrary finitely-valued logics. Like in the classical case the core of the method is the construction of a resolution proof in finitely-valued logics ...
Matthias Baaz, Alexander Leitsch
openaire +1 more source
CERES is a method for cut-elimination in classical logic which is based on resolution. In this paper we extend CERES to CERES-m, a resolution-based method of cut-elimination in Gentzen calculi for arbitrary finitely-valued logics. Like in the classical case the core of the method is the construction of a resolution proof in finitely-valued logics ...
Matthias Baaz, Alexander Leitsch
openaire +1 more source
Many-valued computational logics
Journal of Philosophical Logic, 1989This paper deals with the problem of decidability of propositional logics defined by finite generalized matrices. The notions of computational logic and of computational semantics are introduced and it is shown that for finitely-valued logics, the class of computational calculi coincides with the class of logics with computational semantics.
openaire +2 more sources