Searcharxiv⌕ Search

arXiv subjects

Andrzej Indrzejczak

Publications and source records attributed to Andrzej Indrzejczak.

9 recordsLinked to original sources

Russell's Theory of Definite Descriptions in the Light of Structural Proof Theory

In 'On Denoting' Russell proposed the most influential theory of definite descriptions, expressions of the form 'the F'. Characteristic for Russell's approach is that definite descriptions are not treated as what they appear to be on the surface, i.e. as singular terms. Instead they are eliminated by a contextual definition. Russell formalises definite descriptions in the context of complete sentences of the form 'The F is G'. This requires scope markers to distinguish, e.g., internal from external negation. It was recognised by Burge, and Kalish and Montague, however, that the essential features of Russell's approach may be formalised while respecting the syntactic category to which definite descriptions appear to belong. An alternative, favoured by Neale, follows Russell in that complete sentences 'The F is G' are formalised by a binary quantifier. The undeniable importance of the theory of definite descriptions for logic, mathematics and philosophy demands that it be formalised to meet the standards of modern proof theory. This is the topic of the present paper. We systematise, compare and extend existing approaches. After presenting its essential features, we formalise Russell's theory of definite descriptions in sequent calculus. Three approaches will be considered. The first uses a binary quantifier, whereas the remaining two employ the term-forming iota operator. The first of these employs only the iota operator, the other employs in addition the lambda operator which does duty as a scope marker. All systems satisfy the standards for modern proof theory, in particular cut elimination. The appendix reformulates these systems in natural deduction, which is more convenient for practical purposes.

math.LO↗

A Cut-free, Sound and Complete Russellian Theory of Definite Descriptions

We present a sequent calculus for first-order logic with lambda terms and definite descriptions. The theory formalised by this calculus is essentially Russellian, but avoids some of its well known drawbacks and treats definite description as genuine terms. A constructive proof of the cut elimination theorem and a Henkin-style proof of completeness are the main results of this contribution.

cs.LO↗

Bisequent Calculi for Neutral Free Logic with Definite Descriptions

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ć 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.

cs.LO↗

Towards Proof-Theoretic Formulation of the General Theory of Term-Forming Operators

Term-forming operators (tfos), like iota- or epsilon-operator, are technical devices applied to build complex terms in formal languages. Although they are very useful in practice their theory is not well developed. In the paper we provide a proof-theoretic formulation of the general approach to tfos provided independently by several authors like Scott, Hatcher, Corcoran, and compare it with an approach proposed later by Tennant. Eventually it is shown how the general theory can be applied to specific areas like Quine's set theory NF.

math.LO↗

Definite Descriptions and Hybrid Tense Logic

We provide a version of first-order hybrid tense logic with predicate abstracts and definite descriptions as the only non-rigid terms. It is formalised by means of a tableau calculus working on sat-formulas. A particular theory of DD exploited here is essentially based on the approach of Russell, but with descriptions treated as genuine terms. However, the reductionist aspect of the Russellian approach is retained in several ways. Moreover, a special form of tense definite descriptions is formally developed. A constructive proof of the interpolation theorem for this calculus is given, which is an extension of the result provided by Blackburn and Marx.

cs.LO↗

Uniform Cut-free Bisequent Calculi for Three-valued Logics

We present a uniform characterisation of three-valued logics by means of the bisequent calculus (BSC). It is a generalised form of a sequent calculus (SC) where rules operate on the ordered pairs of ordinary sequents. BSC may be treated as the weakest kind of system in the rich family of generalised SC operating on items being some collections of ordinary sequents, like hypersequent and nested sequent calculi. It seems that for many non-classical logics, including some many-valued, paraconsistent and modal logics, the reasonably modest generalisation of standard SC offered by BSC is sufficient. In this paper we examine a variety of three-valued logics and show how they can be formalised in the framework of BSC. We present a constructive syntactic proof provided that these systems are cut-free, satisfy the subformula property, and allow one to prove the interpolation theorem in many cases.

cs.LO↗

Proceedings of the 10th International Conference on Non-Classical Logics. Theory and Applications

Non-Classical Logics. Theory and Applications (NCL) is an international conference aimed at presenting novel results and survey works in widely understood non-classical logics and their applications. This year's edition was also an opportunity to celebrate the 50th anniversary of the logic journal Bulletin of the Section of Logic (BSL), established in 1971 and since then published by the University of Lodz. On this occassion a number of renowned researchers having bonds with BSL were asked to deliver invited talks. Additionally, during the conference a special session was held commemorating J. Michael Dunn, outstanding logician and collecting editor of BSL, who passed away in 2021. Finally, collocated with the conference were three workshops devoted to, subsequently, non-Fregean logics, relating logics, and formal ontology, as well as a tutorial on graded logic.

cs.LO↗

Tableaux for Free Logics with Descriptions

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.

cs.LO↗