Results 261 to 270 of about 375,050 (296)

A modal interpretation of three-valued logic

Journal of Philosophical Logic, 1974
It is well-known that the intuitions which led Lukasiewicz to propose his system of three-valued logic were modal in character, having to do with the indeterminacy of contingent future tense propositions.' It is also wellknown that the truth-tables for conjunction and negation which he proposes appear to be inconsistent with any such modal ...
openaire   +3 more sources

The cylindric algebras of three-valued logic

Journal of Symbolic Logic, 1998
In this paper we consider the three-valued logic used by Kleene [6] in the theory of partial recursive functions. This logic has three truth values: true (T), false (F), and undefined (U). One interpretation of U is as follows: Suppose we have two partially recursive predicates P(x) and Q(x) and we want to know the truth value of P(x) ∧ Q(x) for a ...
openaire   +2 more sources

A three-valued logic for refinement

2006
Predicates are a popular tool for specification. Unfortunately, they are less well suited to defining the semantics of programming languages. As as result, program refinement techniques are usually based on predicate transformers. This paper proposes a three-valued logic with a richer kind of predicate that is suitable for both specification and ...
openaire   +2 more sources

The C*-Algebras of Three-Valued Logic

1989
Summary We show that Grothendieck's functor K o maps 3-subhomogeneous AF C * -algebras with Hausdorff structure space one-one onto countable Lindenbaum algebras of 3-valued logic. Whereas in the interpretation of Birkhoff and von Neumann propositions arc identified with projections and form an uncountable nondistributive lattice, in our ...
openaire   +3 more sources

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   +2 more sources

A Three-Valued Fregean Quantification Logic

Journal of Philosophical Logic, 2018
Kripke’s Fregean quantification logic FQ fails to formalize the usual first-order logic with identity due to the interpretation of the conditional operator. Motivated by Kripke’s syntax and semantics, the three-valued Fregean quantification logic FQ3 is proposed. This three valued logic differs from Kleene and Łukasiewicz’s three-valued logics.
Minghui Ma, Yuanlei Lin
openaire   +2 more sources

A note on Lukasiewicz’s three-valued logic

2002
It is well known that Lukasiewicz’s three-valued-logic L3 admits – unlike classical logic – the definition of two non trivial, truth-functional modal operators and ∆. We address the question of finding a convenient syntactic characterization of the “modal content” of L3.
openaire   +3 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   +2 more sources

Probabilistic Inference on Three-Valued Logic

2007
In this paper, we extend Nilsson's probabilistic logic [1] to allow that each sentence S has three sets of possible worlds. We adopt the ideas of consistency and possible worlds introduced by Nilsson in [1], but propose a new method called linear equation method to deal with the problems of probabilistic inference, the results of our method is ...
openaire   +3 more sources

A three-valued quantificational logic of context

1997
In this paper we set a three-valued quantificational multi-modal logic which can be used in characterizing the general logical properties of contexts and those of agents. A new non-Kripke style framework of semantics is introduced, and a Hilbert style proof system is proposed for this logic which is proved to be sound and complete as main results of ...
Kaile Su, Decheng Ding, Huowang Chen
openaire   +2 more sources