The main aim of the present paper is to explain a nature of relationships exist between Nelson and Heyting algebras. In the realization, a topological duality theory of Heyting and Nelson algebras based on the topological duality theory of Priestley for bounded distributive lattices are applied. The general method of construction of spaces dual to Nelson algebras from a given dual space to Heyting algebra is described. The algebraic counterpart of this construction being a generalization of the Fidel-Vakarelov construction is (...) also given. These results are applied to compare the equational category N of Nelson algebras and some its subcategories with the equational category H of Heyting algebras. It is proved that the category N is topological over the category H. (shrink)

A formal theory of truth, alternative to tarski's 'orthodox' theory, based on truth-value gaps, is presented. the theory is proposed as a fairly plausible model for natural language and as one which allows rigorous definitions to be given for various intuitive concepts, such as those of 'grounded' and 'paradoxical' sentences.

At least one of these conceptions of probability underlies any theory of statistical inference (or, to use Neyman's phrase, 'inductive behavior'). ...

Bilattices, due to M. Ginsberg, are a family of truth value spaces that allow elegantly for missing or conflicting information. The simplest example is Belnap’s four-valued logic, based on classical two-valued logic. Among other examples are those based on finite many-valued logics, and on probabilistic valued logic. A fixed point semantics is developed for logic programming, allowing any bilattice as the space of truth values. The mathematics is little more complex than in the classical two-valued setting, but the result provides (...) a natural semantics for distributed logic programs, including those involving confidence factors. The classical two-valued and the Kripke/Kleene three-valued semantics become special cases, since the logics involved are natural sublogics of Belnap’s logic, the logic given by the simplest bilattice. (shrink)

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. We propose an extension of these ideas to the family of distributive bilattices. Finally we show that for bilinear bilattices the extensions do not produce any new equivalences.

In the traditional decision theories the role of forecasts is to a large extent swept under the carpet. I believe that a recognition of the connections between forecasts and decisions will be of benefit both for decision theory and for the art of forecasting.In this paper I have tried to analyse which factors, apart from the utilities of the outcomes of the decision alternatives, determine the value of a decision. I have outlined two answers to the question why a decision (...) which is made on the basis of a forecast is better than a decision which is based on a guess. Neither of these answers is universally valid. An assumption which is necessary for the first answer, i.e. Good's result, is that Bayes' rule is accepted as a correct and generally applicable decision principle. The second answer, which was given with the aid of probability intervals, departed from a more general decision principle, the maximin criterion for expected utilities, which was formulated in order to evade some of the criticism against Bayes' rule. However, the argument leading to the ansser is based on the assumption that the probability intervals associated with the states of nature represent certain knowledge. For this reason this answer is only approximatively valid.As a number of quotations in the section on “the weight of evidence” show, it is not sufficient to describe the knowledge about the states of nature by a single number, representing the (subjective) probability of the state, but something else has to be invoked which measures the amount of information on which a decision is based. Several authors have tried to characterize this mysterious quantity, which here was called the weight of evidence. However, there seems to be little agreement as to how this quantity should be measured. (shrink)

This paper is a reaction to the following remark by grzegorczyk: "the compound sentences are not a product of experiment. they arise from reasoning. this concerns also negations; we see that the lemon is yellow, we do not see that it is not blue." generally, in science the truth is ascertained as indirectly as falsehood. an example: a litmus-paper is used to verify the sentence "the solution is acid." this approach gives rise to a (very intuitionistic indeed) conservative extension of (...) the heyting logic satisfying natural duality laws. (shrink)

ABSTRACT In this paper we introduce a set of six logical values, arising in the application of three-valued logics to time intervals, find its algebraic structure, and use it to define a six-valued logic. We then prove, by using algebraic properties of the class of De Morgan algebras, that this semantically defined logic can be axiomatized as Belnap's ?useful? four-valued logic. Other directions of research suggested by the construction of this set of six logical values are described.

Bilattices, introduced by M. Ginsberg, constitute an elegant family of multiple-valued logics. Those meeting certain natural conditions have provided the basis for the semantics of a family of logic programming languages. Now we consider further restrictions on bilattices, to narrow things down to logic programming languages that can, at least in principle, be implemented. Appropriate bilattice background information is presented, so the paper is relatively self-contained.

Four known three-valued logics are formulated axiomatically and several completeness theorems with respect to nonstandard intuitive semantics, connected with the notions of information, contrariety and subcontrariety is given.

While Kripke's original paper on the theory of truth used a three-valued logic, we believe a four-valued version is more natural. Its use allows for possible inconsistencies in information about the world, yet contains Kripke's development within it. Moreover, using a four-valued logic makes it possible to work with complete lattices rather than complete semi-lattices, and thus the mathematics is somewhat simplified. But more strikingly, the four-valued version has a wide, natural generalization to the family of interlaced bilattices. Thus, with (...) little more work, the theory is extended to a broad class of settings. Indeed, a result like Theorem 6.2 would not even be possible to state without the interlaced bilattice machinery. We hope the notion of interlaced bilattice will make apparent further such connections. (shrink)

Classical fixpoint semantics for logic programs is based on the TP immediate consequence operator. The Kripke/Kleene, three-valued, semantics uses ΦP, which extends TP to Kleene’s strong three-valued logic. Both these approaches generalize to cover logic programming systems based on a wide class of logics, provided only that the underlying structure be that of a bilattice. This was presented in earlier papers. Recently well-founded semantics has become influential for classical logic programs. We show how the well-founded approach also extends naturally to (...) the same family of bilatticebased programming languages that the earlier fixpoint approaches extended to. Doing so provides a natural semantics for logic programming systems that have already been proposed, as well as for a large number that are of only theoretical interest. And finally, doing so simplifies the proofs of basic results about the well-founded semantics, by stripping away inessential details. (shrink)

Kleene’s well-known strong three-valued logic is shown to be one of a family of logics with similar mathematical properties. These logics are produced by an intuitively natural construction. The resulting logics have direct relationships with bilattices. In addition they possess mathematical features that lend themselves well to semantical constructions based on fixpoint procedures, as in logic programming.