DeepAI AI Chat
Log In Sign Up

Tableaux for Free Logics with Descriptions

by   Andrzej Indrzejczak, et al.
University of Oxford

The paper provides a tableau approach to definite descriptions. We focus on several formalizations of the so-called minimal free description theory (MFD) usually formulated axiomatically in the setting of free logic. We consider five analytic tableau systems corresponding to different kinds of free logic, including the logic of definedness applied in computer science and constructive mathematics for dealing with partial functions (here called negative quasi-free logic). The tableau systems formalise MFD based on PFL (positive free logic), NFL (negative free logic), PQFL and NQFL (the quasi-free counterparts of the former ones). Also the logic NQFLm is taken into account, which is equivalent to NQFL, but whose language does not comprise the existence predicate. It is shown that all tableaux are sound and complete with respect to the semantics of these logics.


page 1

page 2

page 3

page 4


On Free Description Logics with Definite Descriptions

Definite descriptions are phrases of the form 'the x such that φ', used ...

Towards an efficient prover for the C1 paraconsistent logic

The KE inference system is a tableau method developed by Marco Mondadori...

Non-Rigid Designators in Epistemic and Temporal Free Description Logics (Extended Version)

Definite descriptions, such as 'the smallest planet in the Solar System'...

Two Treatments of Definite Descriptions in Intuitionist Negative Free Logic

Sentences containing definite descriptions, expressions of the form `The...

Algebraizability of the Logic of Quasi-N4-Lattices

The class of quasi-N4-lattices (QN4-lattices) was introduced as a common...