Characterizations of Preferential Entailments

Logic Journal of the IGPL 10 (3):245-272 (2002)
  Copy   BIBTEX

Abstract

The “preferential entailments” considered in this text are all defined in the same way, by a binary relation, or “preference relation”. This relation can be among interpretations, or sets of interpretations, or among “states” which are copies of interpretations or copies of sets of interpretations. This provides four kinds of preferential entailments. What we do here is to provide a characterization result for these four kinds of preferential entailments. We choose properties as simple and natural as possible, and sometimes we provide various characterizations for the same notion. It appears that the apparently most complicated notion possesses by far the simplest characterization result. A by-product of our results is that case is equivalent to case : we can define directly the relation among sets of interpretations, eliminating the need for “states” in this case. The paper deals mainly with propositional logic, however it describes also the situation in first order logic. Any complete theory has one model in the propositional case and many models in the first order case. This is why the simplest notion in the first order case has exactly the same syntactical characterization as the notion in the propositional case

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 101,773

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2015-02-04

Downloads
31 (#742,682)

6 months
5 (#1,084,146)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Semantics for Dual Preferential Entailment.Katarina Britz, Johannes Heidema & Willem Labuschagne - 2009 - Journal of Philosophical Logic 38 (4):433-446.

Add more citations

References found in this work

Completeness results for circumscription.Donald Perlis & Jack Minker - 1986 - Artificial Intelligence 28 (1):29-42.
Nonmonotonic inference operations.Michael Freund & Daniel Lehmann - 1993 - Logic Journal of the IGPL 1 (1):23-68.
The expressive power of circumscription.Tom Costello - 1998 - Artificial Intelligence 104 (1-2):313-329.

Add more references