Displaying similar documents to “[0,1]-Valued Logic: A Natural Generalization of Boolean Logic”

From two- to four-valued logic

Chris Brink (1993)

Banach Center Publications

Similarity:

The purpose of this note is to show that a known and natural four-valued logic co-exists with classical two-valued logic in the familiar context of truth tables. The tool required is the power construction.

Modal Boolean Connexive Logics: Semantics and Tableau Approach

Tomasz Jarmużek, Jacek Malinowski (2019)

Bulletin of the Section of Logic

Similarity:

In this paper we investigate Boolean connexive logics in a language with modal operators: □, ◊. In such logics, negation, conjunction, and disjunction behave in a classical, Boolean way. Only implication is non-classical. We construct these logics by mixing relating semantics with possible worlds. This way, we obtain connexive counterparts of basic normal modal logics. However, most of their traditional axioms formulated in terms of modalities and implication do not hold anymore without...

Between logic and probability.

Ton Sales (1994)

Mathware and Soft Computing

Similarity:

Logic and Probability, as theories, have been developed quite independently and, with a few exceptions (like Boole's), have largely ignored each other. And nevertheless they share a lot of similarities, as well a considerable common ground. The exploration of the shared concepts and their mathematical treatment and unification is here attempted following the lead of illustrious researchers (Reichenbach, Carnap, Popper, Gaifman, Scott & Krauss, Fenstad, Miller, David Lewis, Stalnaker,...

Many-Sorted Coalgebraic Modal Logic: a Model-theoretic Study

Bart Jacobs (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

This paper gives a semantical underpinning for a many-sorted modal logic associated with certain dynamical systems, like transition systems, automata or classes in object-oriented languages. These systems will be described as coalgebras of so-called polynomial functors, built up from constants and identities, using products, coproducts and powersets. The semantical account involves Boolean algebras with operators indexed by polynomial functors, called MBAOs, for Many-sorted Boolean...