On Rational Entailment for Propositional Typicality Logic
Richard Booth, Giovanni Casini, Thomas Meyer, Ivan Varzinczak

TL;DR
This paper explores propositional typicality logic (PTL), introducing multiple entailment notions based on rational closure, and demonstrates the impossibility of satisfying all desirable postulates simultaneously, advocating for diverse entailment approaches.
Contribution
It presents an impossibility theorem for PTL entailment postulates and investigates three semantic entailment variants based on rational closure and minimality.
Findings
Impossibility theorem for PTL entailment postulates
Development of three different PTL entailment notions
Analysis of minimality-based rational closure in PTL
Abstract
Propositional Typicality Logic (PTL) is a recently proposed logic, obtained by enriching classical propositional logic with a typicality operator capturing the most typical (alias normal or conventional) situations in which a given sentence holds. The semantics of PTL is in terms of ranked models as studied in the well-known KLM approach to preferential reasoning and therefore KLM-style rational consequence relations can be embedded in PTL. In spite of the non-monotonic features introduced by the semantics adopted for the typicality operator, the obvious Tarskian definition of entailment for PTL remains monotonic and is therefore not appropriate in many contexts. Our first important result is an impossibility theorem showing that a set of proposed postulates that at first all seem appropriate for a notion of entailment with regard to typicality cannot be satisfied simultaneously. Closer…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
