Бинарная реляционная семантика релевантной логики.

Abstract

The introduced binary relational semantics Sea for relevant logic has as reference points two-storeyed worlds [1, 19]. The ground floor of each such a world consists of propositions or its negations (atomic floor) and the first floor consists of formulae (entailment floor). A distinctive peculiarity of the semantics Sea is that any formula cannot be verified (or falsified) in all worlds. And so a formula A is considered as semantically true, iff A is verified in each world, where $A\rightarrow A$ is verified. Here the $S^{ea}$ semantics is adopted for both well known systems $E$, $R$.