Bisequent Calculi for Neutral Free Logic with Definite Descriptions

Autor:	Indrzejczak, Andrzej, Petrukhin, Yaroslav
Rok vydání:	2024
Předmět:	Computer Science - Logic in Computer Science
Druh dokumentu:	Working Paper
Popis:	We present a bisequent calculus (BSC) for the minimal theory of definite descriptions (DD) in the setting of neutral free logic, where formulae with non-denoting terms have no truth value. The treatment of quantifiers, atomic formulae and simple terms is based on the approach developed by Pavlovi\'{c} and Gratzl. We extend their results to the version with identity and definite descriptions. In particular, the admissibility of cut is proven for this extended system.
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/2412.01712 Zobrazit plný text záznamu View this record from Arxiv