Displaying similar documents to “Deduction in many-valued logics: a survey.”

A 2-set-up Routley-Meyer Semantics for the 4-valued Relevant Logic E4

Gemma Robles, Sandra M. López, José M. Blanco, Marcos M. Recio, Jesús R. Paradela (2016)

Bulletin of the Section of Logic

Similarity:

The logic BN4 can be considered as the 4-valued logic of the relevant conditional and the logic E4, as the 4-valued logic of (relevant) entailment. The aim of this paper is to endow E4 with a 2-set-up Routley-Meyer semantics. It is proved that E4 is strongly sound and complete w.r.t. this semantics.

A Lukasiewicz logic based Prolog.

Frank Klawonn, Rudolf Kruse (1994)

Mathware and Soft Computing

Similarity:

Prolog is a programming language based on a restricted subset of classical first order predicate logic. In order to overcome some problems of classical logic to handle imperfect human knowledge, we provide a formal framework for a Lukasiewicz logic based Prolog system. The use of Lukasiewicz logic with its connection to Ulam games enables us to deal with partial inconsistencies by interpreting the truth values as relative distance to contradiction. We also present the software tool LULOG...

Useful Four-Valued Extension of the Temporal Logic KtT4

Vincent Degauquier (2018)

Bulletin of the Section of Logic

Similarity:

The temporal logic KtT4 is the modal logic obtained from the minimal temporal logic Kt by requiring the accessibility relation to be reflexive (which corresponds to the axiom T) and transitive (which corresponds to the axiom 4). This article aims, firstly, at providing both a model-theoretic and a proof-theoretic characterisation of a four-valued extension of the temporal logic KtT4 and, secondly, at identifying some of the most useful properties of this extension in the context of partial...

Computing multiple-valued logic programs.

James J. Lu, Jacques Calmet, Joachim Schü (1997)

Mathware and Soft Computing

Similarity:

The logic of signed formula can be used to reason about a wide variety of multiple-valued logics [Häh94b, LMR97]. The formal theoretical foundation of multiple-valued logic programming based on signed formulas is set forth in [Lu96]. The current paper is an investigation into the operational semantics of such signed logic programming. The connection of signed logic programming to constraint logic programming is presented, search space issues are briefly discussed for both general and...

The Dynamic Epistemic Logic for Actual Knowledge

Arkadiusz Wójcik (2020)

Bulletin of the Section of Logic

Similarity:

The dynamic epistemic logic for actual knowledge models the phenomenon of actual knowledge change when new information is received. In contrast to the systems of dynamic epistemic logic which have been discussed in the past literature, our system is not burdened with the problem of logical omniscience, that is, an idealized assumption that the agent explicitly knows all classical tautologies and all logical consequences of his or her knowledge. We provide a sound and complete axiomatization...

Grzegorczyk’s Logics. Part I

Taneli Huuskonen (2015)

Formalized Mathematics

Similarity:

This article is the second in a series formalizing some results in my joint work with Prof. Joanna Golinska-Pilarek ([9] and [10]) concerning a logic proposed by Prof. Andrzej Grzegorczyk ([11]). This part presents the syntax and axioms of Grzegorczyk’s Logic of Descriptions (LD) as originally proposed by him, as well as some theorems not depending on any semantic constructions. There are both some clear similarities and fundamental differences between LD and the non-Fregean logics introduced...

Axiomatization of a Basic Logic of Logical Bilattices

Mitio Takano (2016)

Bulletin of the Section of Logic

Similarity:

A sequential axiomatization is given for the 16-valued logic that has been proposed by Shramko-Wansing (J Philos Logic 34:121–153, 2005) as a candidate for the basic logic of logical bilattices.

Categorical Abstract Logic: Hidden Multi-Sorted Logics as Multi-Term π-Institutions

George Voutsadakis (2016)

Bulletin of the Section of Logic

Similarity:

Babenyshev and Martins proved that two hidden multi-sorted deductive systems are deductively equivalent if and only if there exists an isomorphism between their corresponding lattices of theories that commutes with substitutions. We show that the π-institutions corresponding to the hidden multi-sorted deductive systems studied by Babenyshev and Martins satisfy the multi-term condition of Gil-F´erez. This provides a proof of the result of Babenyshev and Martins by appealing to the general...