SearcharxivSearch

arXiv subjects

Nils Kürbis

Publications and source records attributed to Nils Kürbis.

16 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

Normalisation for Positive Free Logics without and with Definite Descriptions

This paper proves normalisation theorems for intuitionist and classical positive free logic, without and with the iota operator for definite descriptions `the F'. Positive free logic also opens a number of options for rules for iota. In total, six different formalisations of theories of definite descriptions will be discussed, three proposed by Lambert, and three alternatives. The latter are motivated by considerations relating to proof-theoretic harmony between introduction and elimination rules. The philosophical importance of the various systems and results is indicated. The paper builds on Kürbis (2025), but is largely self-contained. The proofs for the present systems are easier than those for negative free logic.

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

Normalisation for Negative Free Logics without and with Definite Descriptions

This paper proves normalisation theorems for intuitionist and classical negative free logic, without and with the $\invertediota$ operator for definite descriptions. Rules specific to free logic give rise to new kinds of maximal formulas additional to those familiar from standard intuitionist and classical logic. When $\invertediota$ is added it must be ensured that reduction procedures involving replacements of parameters by terms do not introduce new maximal formulas of higher degree than the ones removed. The problem is solved by a rule that permits restricting these terms in the rules for $\forall$, $\exists$ and $\invertediota$ to parameters or constants. A restricted subformula property for deductions in systems without $\invertediota$ is considered. It is improved upon by an alternative formalisation of free logic building on an idea of Jaśkowski's. In the classical system the rules for $\invertediota$ require treatment known from normalisation for classical logic with $\lor$ or $\exists$. The philosophical significance of the results is also indicated.

cs.LO

Normalisation and Subformula Property for a System of Classical Logic with Tarski's Rule, and a Correction

This paper considers a formalisation of classical logic using general introduction rules and general elimination rules. It proposes a definition of `maximal formula', `segment' and `maximal segment' suitable to the system, and gives reduction procedures for them. It is then shown that deductions in the system convert into normal form, i.e. deductions that contain neither maximal formulas nor maximal segments, and that deductions in normal form satisfy the subformula property. Tarski's Rule is treated as a general introduction rule for implication. The general introduction rule for negation has a similar form. Maximal formulas with implication or negation as main operator require reduction procedures of a more intricate kind not present in normalisation for intuitionist logic. The Correction added to the end of the paper corrects an error: Theorem 2 is mistaken, and so is a corollary drawn from it as well as a corollary that was concluded by the same mistake. Luckily this does not affect the main result of the paper.

cs.LO

Comment on Mark Textor: Brentano's Positing Theory of Existence

This article is the text of a commentary on a talk delivered by Mark Textor entitled 'Brentano's Positing Theory of Existence' in December 2015. It contains ideas on implementing Textor's Neo-Brentanian theory of existence in a natural deduction proof system for negative free logic.

math.LO

Bilateral Inversion Principles

This paper formulates a bilateral account of harmony that is an alternative to one proposed by Francez. It builds on an account of harmony for unilateral logic proposed by Kürbis and the observation that reading the rules for the connectives of bilateral logic bottom up gives the grounds and consequences of formulas with the opposite speech act. I formulate a process I call 'inversion' which allows the determination of assertive elimination rules from assertive introduction rules, and rejective elimination rules from rejective introduction rules, and conversely. It corresponds to Francez's notion of vertical harmony. I also formulate a process I call 'conversion', which allows the determination of rejective introduction rules from assertive elimination rules and conversely, and the determination of assertive introduction rules from rejective elimination rules and conversely. It corresponds to Francez's notion of horizontal harmony. The account has a number of features that distinguishes it from Francez's.

cs.LO

Normalisation and subformula property for a system of intuitionistic logic with general introduction and elimination rules

This paper studies a formalisation of intuitionistic logic by Negri and von Plato which has general introduction and elimination rules. The philosophical importance of the system is expounded. Definitions of `maximal formula', `segment' and `maximal segment' suitable to the system are formulated and corresponding reduction procedures for maximal formulas and permutative reduction procedures for maximal segments given. Alternatives to the main method used are also considered. It is shown that deductions in the system convert into normal form and that deductions in normal form have the subformula property.

math.LO

A Binary Quantifier for Definite Descriptions for Cut Free Free Logics

This paper presents rules in sequent calculus for a binary quantifier $I$ to formalise definite descriptions: $Ix[F, G]$ means `The $F$ is $G$'. The rules are suitable to be added to a system of positive free logic. The paper extends the proof of a cut elimination theorem for this system by Indrzejczak by proving the cases for the rules of $I$. There are also brief comparisons of the present approach to the more common one that formalises definite descriptions with a term forming operator. In the final section rules for $I$ for negative free and classical logic are also mentioned.

math.LO

Normalisation for Bilateral Classical Logic with some Philosophical Remarks, and a Note on it

Bilateralists hold that the meanings of the connectives are determined by rules of inference for their use in deductive reasoning with asserted and denied formulas. This paper presents two bilateral connectives comparable to Prior's tonk, for which, unlike for tonk, there are reduction steps for the removal of maximal formulas arising from introducing and eliminating formulas with those connectives as main operators. Adding either of them to bilateral classical logic results in an incoherent system. One way around this problem is to count formulas as maximal that are the conclusion of reductio and major premise of an elimination rule and to require their removability from deductions. The main part of the paper consists in a proof of a normalisation theorem for bilateral logic. The closing sections address philosophical concerns whether the proof provides a satisfactory solution to the problem at hand and confronts bilateralists with the dilemma that a bilateral notion of stability sits uneasily with the core bilateral thesis. The Note corrects an error in one of the reduction steps in the paper.

cs.LO

Proof-Theory and Semantics for a Theory of Definite Descriptions

This paper presents a sequent calculus and a dual domain semantics for a theory of definite descriptions in which these expressions are formalised in the context of complete sentences by a binary quantifier $I$. $I$ forms a formula from two formulas. $Ix[F, G]$ means `The $F$ is $G$'. This approach has the advantage of incorporating scope distinctions directly into the notation. Cut elimination is proved for a system of classical positive free logic with $I$ and it is shown to be sound and complete for the semantics. The system has a number of novel features and is briefly compared to the usual approach of formalising `the $F$' by a term forming operator. It does not coincide with Hintikka's and Lambert's preferred theories, but the divergence is well-motivated and attractive.

cs.LO

Definite Descriptions in Intuitionist Positive Free Logic

This paper presents rules of inference for a binary quantifier $I$ for the formalisation of sentences containing definite descriptions within intuitionist positive free logic. $I$ binds one variable and forms a formula from two formulas. $Ix[F, G]$ means `The $F$ is $G$'. The system is shown to have desirable proof-theoretic properties: it is proved that deductions in it can be brought into normal form. The discussion is rounded up by comparisons between the approach to the formalisation of definite descriptions recommended here and the more usual approach that uses a term-forming operator $ι$, where $ιxF$ means `the F'.

cs.LO

A Binary Quantifier for Definite Descriptions in Intuitionist Negative Free Logic: Natural Deduction and Normalisation

This paper presents a way of formalising definite descriptions with a binary quantifier $ι$, where $ιx[F, G]$ is read as `The $F$ is $G$'. Introduction and elimination rules for $ι$ in a system of intuitionist negative free logic are formulated. Procedures for removing maximal formulas of the form $ιx[F, G]$ are given, and it is shown that deductions in the system can be brought into normal form.

cs.LO

Two Treatments of Definite Descriptions in Intuitionist Negative Free Logic

Sentences containing definite descriptions, expressions of the form `The $F$', can be formalised using a binary quantifier $ι$ that forms a formula out of two predicates, where $ιx[F, G]$ is read as `The $F$ is $G$'. This is an innovation over the usual formalisation of definite descriptions with a term forming operator. The present paper compares the two approaches. After a brief overview of the system $\mathbf{INF}^ι$ of intuitionist negative free logic extended by such a quantifier, which was presented in \citep{kurbisiotaI}, $\mathbf{INF}^ι$ is first compared to a system of Tennant's and an axiomatic treatment of a term forming $ι$ operator within intuitionist negative free logic. Both systems are shown to be equivalent to the subsystem of $\mathbf{INF}^ι$ in which the $G$ of $ιx[F, G]$ is restricted to identity. $\mathbf{INF}^ι$ is then compared to an intuitionist version of a system of Lambert's which in addition to the term forming operator has an operator for predicate abstraction for indicating scope distinctions. The two systems will be shown to be equivalent through a translation between their respective languages. Advantages of the present approach over the alternatives are indicated in the discussion.

cs.LO

A Sketch of a Proof-Theoretic Semantics for Necessity

This paper considers proof-theoretic semantics for necessity within Dummett's and Prawitz's framework. Inspired by a system of Pfenning's and Davies's, the language of intuitionist logic is extended by a higher order operator which captures a notion of validity. A notion of relative necessary is defined in terms of it, which expresses a necessary connection between the assumptions and the conclusion of a deduction.

cs.LO

Proof-Theoretic Semantics, a Problem with Negation and Prospects for Modality

This paper discusses proof-theoretic semantics, the project of specifying the meanings of the logical constants in terms of rules of inference governing them. I concentrate on Michael Dummett's and Dag Prawitz' philosophical motivations and give precise characterisations of the crucial notions of harmony and stability, placed in the context of proving normalisation results in systems of natural deduction. I point out a problem for defining the meaning of negation in this framework and prospects for an account of the meanings of modal operators in terms of rules of inference.

cs.LO