Plausibility logic

Daniel Lehmann*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

20 Scopus citations

Abstract

This is an effort towards an abstract presentation of the formal properties of the way we tend to jump to conclusions from less than fully convincing information. In [6], such properties were presented as families of binary relations between propositional formulas, i.e., built out of preexisting propositional logic. Though the family of cumulative relations is easily amenable to an abstract presentation that does not use the propositional connectives, as was noticed in [8] and [9], no such presentation is known for the more attractive family of preferential relations. Plausibility Logic is a step towards such an abstract presentation. It enables the definition of connectives: each connective is defined by introduction rules only. It provides a nonmonotonic presentation of the Gentzen’s consequence relation of classical logic. But, no representation theorem is known for Plausibility Logic and it does not enjoy Cut Elimination.

Original languageEnglish
Title of host publicationComputer Science Logic - 5th Workshop, CSL 1991, Proceedings
EditorsEgon Borger, Gerhard Jager, Hans Kleine Buning, Michael M. Richter
PublisherSpringer Verlag
Pages227-241
Number of pages15
ISBN (Print)9783540557890
DOIs
StatePublished - 1992
Event5th Workshop on Computer Science Logic, CSL 1991 - Berne, Switzerland
Duration: 7 Oct 199111 Oct 1991

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume626 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference5th Workshop on Computer Science Logic, CSL 1991
Country/TerritorySwitzerland
CityBerne
Period7/10/9111/10/91

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1992.

Fingerprint

Dive into the research topics of 'Plausibility logic'. Together they form a unique fingerprint.

Cite this