Deduction in many-valued logics: a survey.
Reiner Hähnle, Gonzalo Escalada-Imaz (1997)
Mathware and Soft Computing
Similarity:
Reiner Hähnle, Gonzalo Escalada-Imaz (1997)
Mathware and Soft Computing
Similarity:
M.-A. Nait Abdallah (1988)
Banach Center Publications
Similarity:
Michael Franssen, Harrie De Swart (2004)
RACSAM
Similarity:
Cocktail is a tool for deriving correct programs from their specifications. The present version is powerful enough for educational purposes. The tool yields support for many sorted first order predicate logic, formulated in a pure type system with parametric constants (CPTS), as the specification language, a simple While-language, a Hoare logic represented in the same CPTS for deriving programs from their specifications and a simple tableau based automated theorem prover for verifying...
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...
Marisa Venturini-Zilli (1988)
Banach Center Publications
Similarity:
Slobodan Vujošević (2012)
Review of the National Center for Digitization
Similarity:
Lau, Raymond, Wong, On (2000)
Novi Sad Journal of Mathematics
Similarity:
Miodrag Kapetanović, Aleksandar Krapež (1989)
Publications de l'Institut Mathématique
Similarity:
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...
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...
R. Kulesza (1970)
Applicationes Mathematicae
Similarity:
Jan Woleński (2017)
Bulletin of the Section of Logic
Similarity:
This paper deals with the problem of universality property of logic. At first, this property is analyzed in the context of first-order logic. Three senses of the universality property are distinguished: universal applicability, topical neutrality and validity (truth in all models). All theses senses can be proved to be justified. The fourth understanding, namely the amount of expressive power, is connected with the criticism of the first-order thesis: first-order logic is the logic....
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...