Correspondence analysis and automated proof-searching for first degree entailment
Y Petrukhin, V Shangin - European Journal of Mathematics, 2020 - Springer
In this paper, we present correspondence analysis for the well-known four-valued logic First
Degree Entailment (FDE). Correspondence analysis is Kooi and Tamminga's technique for …
Degree Entailment (FDE). Correspondence analysis is Kooi and Tamminga's technique for …
Knowledge and ignorance in Belnap–Dunn logic
D Kozhemiachenko, L Vashentseva - Logic Journal of the IGPL, 2023 - academic.oup.com
In this paper, we argue that the usual approach to modelling knowledge and belief with the
necessity modality does not produce intuitive outcomes in the framework of the Belnap …
necessity modality does not produce intuitive outcomes in the framework of the Belnap …
The Value of the One Value: Exactly True Logic revisited
A Kapsner, U Rivieccio - Journal of Philosophical Logic, 2023 - Springer
In this paper we re-assess the philosophical foundation of Exactly True Logic (ET L), a
competing variant of First Degree Entailment (FDE). In order to do this, we first rebut an …
competing variant of First Degree Entailment (FDE). In order to do this, we first rebut an …
Describing and quantifying contradiction between pieces of evidence via Belnap Dunn logic and Dempster-Shafer theory
M Bı́lková, S Frittella… - International …, 2023 - proceedings.mlr.press
Belnap Dunn logic is a four-valued logic introduced to model reasoning with incomplete or
contradictory information. In this article, we show how Dempster-Shafer theory can be used …
contradictory information. In this article, we show how Dempster-Shafer theory can be used …
Hilbert-style axiomatization of first-degree entailment and a family of its extensions
Y Shramko - Annals of Pure and Applied Logic, 2021 - Elsevier
This paper presents a Hilbert-style system for the logic of first-degree entailment defined in a
Fmla-Fmla framework. The effective use of this formulation as a basis for a whole family of …
Fmla-Fmla framework. The effective use of this formulation as a basis for a whole family of …
Exactly true and non-falsity logics meeting infectious ones
A Belikov, Y Petrukhin - Journal of Applied Non-Classical Logics, 2020 - Taylor & Francis
In this paper, we study logical systems which represent entailment relations of two kinds. We
extend the approach of finding 'exactly true'and 'non-falsity'versions of four-valued logics that …
extend the approach of finding 'exactly true'and 'non-falsity'versions of four-valued logics that …
On bivalent semantics and natural deduction for some infectious logics
A Belikov - Logic Journal of the IGPL, 2022 - academic.oup.com
In this work, we propose a variant of so-called informational semantics, a technique
elaborated by Voishvillo, for two infectious logics, Deutsch's and Szmuc's. We show how the …
elaborated by Voishvillo, for two infectious logics, Deutsch's and Szmuc's. We show how the …
Mortensen logics
L Estrada-González, F Cano-Jorge - arXiv preprint arXiv:2204.06731, 2022 - arxiv.org
Mortensen introduced a connexive logic commonly known as' M3V'. M3V is obtained by
adding a special conditional to LP. Among its most notable features, besides its being …
adding a special conditional to LP. Among its most notable features, besides its being …
Alternative multilattice logics: An approach based on monosequent and indexed monosequent calculi
N Kamide - Studia Logica, 2021 - Springer
Two new multilattice logics called submultilattice logic and indexed multilattice logic are
introduced as a monosequent calculus and an indexed monosequent calculus, respectively …
introduced as a monosequent calculus and an indexed monosequent calculus, respectively …
Between Hilbert and Gentzen: four-valued consequence systems and structural reasoning
Y Shramko - Archive for Mathematical Logic, 2022 - Springer
Structural reasoning is simply reasoning that is governed exclusively by structural rules. In
this context a proof system can be said to be structural if all of its inference rules are …
this context a proof system can be said to be structural if all of its inference rules are …