Authors
Andrzej Indrzejczak
University of Lodz
Abstract
We provide an application of a sequent calculus framework to the formalization of definite descriptions. It is a continuation of research undertaken in [20, 22]. In the present paper a so-called free description theory is examined in the context of different kinds of free logic, including systems applied in computer science and constructive mathematics for dealing with partial functions. It is shown that the same theory in different logics may be formalised by means of different rules and gives results of varying strength. For all presented calculi a constructive cut elimination is provided.
Keywords sequent calculus  definite descriptions  free logic  definedness logic  partial terms  cut elimination
Categories (categorize this paper)
DOI 10.12775/llp.2020.020
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 71,436
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

[Omnibus Review].Robert Goldblatt - 1986 - Journal of Symbolic Logic 51 (1):225-227.
Free Logics.Ermanno Bencivenga - 2002 - In D. M. Gabbay & F. Guenthner (eds.), Handbook of Philosophical Logic, 2nd Edition. Kluwer Academic Publishers. pp. 147--196.
A More Unified Approach to Free Logics.Edi Pavlović & Norbert Gratzl - 2021 - Journal of Philosophical Logic 50 (1):117-148.

View all 21 references / Add more references

Citations of this work BETA

Add more citations

Similar books and articles

Tautology Elimination, Cut Elimination, and S5.Andrezj Indrzejczak - 2017 - Logic and Logical Philosophy 26 (4):461-471.
Simple Cut Elimination Proof for Hybrid Logic.Andrezj Indrzejczak - 2016 - Logic and Logical Philosophy 25 (2):129-141.
Sufficient Conditions for Cut Elimination with Complexity Analysis.João Rasga - 2007 - Annals of Pure and Applied Logic 149 (1-3):81-99.
Sequent Calculi for Some Trilattice Logics.Norihiro Kamide & Heinrich Wansing - 2009 - Review of Symbolic Logic 2 (2):374-395.
New Sequent Calculi for Visser's Formal Propositional Logic.Katsumasa Ishii - 2003 - Mathematical Logic Quarterly 49 (5):525.
A Survey of Nonstandard Sequent Calculi.Andrzej Indrzejczak - 2014 - Studia Logica 102 (6):1295-1322.
Bunched Logics Displayed.James Brotherston - 2012 - Studia Logica 100 (6):1223-1254.

Analytics

Added to PP index
2020-11-03

Total views
12 ( #813,077 of 2,520,378 )

Recent downloads (6 months)
2 ( #270,555 of 2,520,378 )

How can I increase my downloads?

Downloads

My notes