Nowa wersja platformy, zawierająca wyłącznie zasoby pełnotekstowe, jest już dostępna.
Przejdź na https://bibliotekanauki.pl
Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 4

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
|
2016
|
tom 25
|
nr 2
173–201
EN
The logic BN4 was defined by R.T. Brady in 1982. It can be considered as the 4-valued logic of the relevant conditional. E4 is a variant of BN4 that can be considered as the 4-valued logic of (relevant) entailment. The aim of this paper is to define reduced general Routley-Meyer semantics for BN4 and E4. It is proved that BN4 and E4 are strongly sound and complete w.r.t. their respective semantics.
|
|
nr 4
371–390
EN
A simple Henkin-style completeness proof for Gödel 3-valued propositional logic G3 is provided. The idea is to endow G3 with an under-determined semantics (u-semantics) of the type defined by Dunn. The key concept in u-semantics is that of “under-determined interpretation” (u-interpretation). It is shown that consistent prime theories built upon G3 can be understood as (canonical) u-interpretations. In order to prove this fact we follow Brady by defining G3 as an extension of Anderson and Belnap’s positive fragment of First Degree Entailment Logic.
EN
A restriction of R-Mingle with the variable-sharing property and the Ackermann properties is defined. From an intuitive semantical point of view, this restriction is an alternative to Anderson and Belnap’s logic of entailment E.
4
Content available remote Relational semantics for the 4-valued relevant logics BN4 and E4
45%
EN
The logic BN4 was defined by R.T. Brady in 1982. It can be considered as the 4-valued logic of the relevant conditional. E4 is a variant of BN4 that can be considered as the 4-valued logic of (relevant) entailment. The aim of this paper is to define reduced general Routley-Meyer semantics for BN4 and E4. It is proved that BN4 and E4 are strongly sound and complete w.r.t. their respective semantics.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.