Results 291 to 300 of about 385,766 (333)

Three-valued constructive logic and logic programs

Proceedings 25th International Symposium on Multiple-Valued Logic, 2002
We propose three valued constructive logic with strong negation 3N by describing both proof and model theory. We relate the proposed three valued system to J. Lukasiewicz's (1920) three valued logic. We demonstrate that 3N is very useful to formalize a semantics for logic programs with negation as failure within the framework of constructive logic.
openaire   +1 more source

Three-valued logic

1991
Abstract The main aim of this chapter is to study the logic of inexactness arising from Korner’s theory of inexact classes and predicates (Chapter 1, §1.3.2 and Chapter 7, §7.7). We first study logics whose truth-values are the QBA’s B2, N3, and Q4 (Chapter 7, Fig. 7.1). Though the centre of attention is N3, a completeness proof is given
openaire   +1 more source

Incidence Calculus on Łukasiewicz's Three-valued Logic

Fundamenta Informaticae, 2005
Incidence calculus is a probabilistic logic which possesses both numerical and symbolic approaches. However, Liu in [5] pointed out that the original incidence calculus had some drawbacks and she established a generalized incidence calculus theory (GICT) based on Łukasiewicz's three-valued logic to improve it.
Qi, G., Milligan, P., Sage, P.
openaire   +2 more sources

Rough Set Logic for Kleene's Three-valued Logic

2020 Joint 11th International Conference on Soft Computing and Intelligent Systems and 21st International Symposium on Advanced Intelligent Systems (SCIS-ISIS), 2020
The rough set logic (RSL) was proposed by Duntsch and there have been many studies on the logical system based on RSL. Some researches around RSL study the deductive system for the RSL. However, the characteristics of the deductive system have not been investigated enough.
Yotaro Nakayama, Seiki Akama, Tetsuya Murai   +2 more
openaire   +1 more source

KLEENE’S THREE VALUED LOGICS AND THEIR CHILDREN [PDF]

Fundamenta Informaticae, 1994
Kleene’s strong three-valued logic extends naturally to a four-valued logic proposed by Belnap. We introduce a guard connective into Belnap’s logic and consider a few of its properties. Then we show that by using it four-valued analogs of Kleene’s weak three-valued logic, and the asymmetric logic of Lisp are also available.
openaire   +2 more sources

Three-Valued Paraconsistent Propositional Logics

2015
Three-valued matrices provide the simplest semantic framework for introducing paraconsistent logics. This paper is a comprehensive study of the main properties of propositional paraconsistent three-valued logics in general, and of the most important such logics in particular.
Ofer Arieli, Arnon Avron
openaire   +1 more source

Strong Three-Valued Paraconsistent Logics

2015
After describing the two formulations of the principle of non contradiction in modern logic \(T \vdash \lnot (p \wedge \lnot p)\) (NC) and \(T, p, \lnot p \vdash q\) (EC) and explaining that three-valued matrices can be used to easily prove their independence, we investigate the possibilities to construct strong paraconsistent negations, i.e., for ...
Jean-Yves Beziau, Anna Franceschetto
openaire   +1 more source

Algebraization of the Three-valued BCK-logic

MLQ, 2002
In this paper, the authors propose a definition of \(n\)-valued system in the context of algebraizable logics. They define and study the variety \(V_3\), showing that it is definitionally equivalent to the equivalent quasivariety semantics for three-valued BCK-logic. As a consequence, the authors find an axiomatic definition of the above system.
García Olmedo, Francisco M., Rodríguez Salas, Antonio J.   +1 more
openaire   +2 more sources

A Note on Three-Valued Logic Simulation

IEEE Transactions on Computers, 1972
In this note we discuss a few attributes and pitfalls of three-valued (0, 1, u) digital logic simulation. The areas covered include hazard and race detection, fault detection, verifying the reset logic of a machine, and the problems encountered with self-timing circuits and in employing a complement for u.
openaire   +1 more source

Three-valued Logic, Indeterminacy and Quantum Mechanics

Journal of Philosophical Logic, 2001
The paper starts with a discussion of future contingents, claiming that Łukasiewicz 3-valued logic was motivated by these considerations, but a ``semi-classical'' 3-valued logic ``that retains all classical tautologies'' is more appropriate than Łukasiewicz logic to express them.
openaire   +2 more sources