Proof-Theory and Semantics for a Theory of Definite Descriptions

08/09/2021
by   Nils Kürbis, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/04/2021

Definite Descriptions in Intuitionist Positive Free Logic

This paper presents rules of inference for a binary quantifier I for the...
research
02/18/2021

Semantics and Axiomatization for Stochastic Differential Dynamic Logic

Building on previous work by André Platzer, we present a formal language...
research
08/04/2021

Two Treatments of Definite Descriptions in Intuitionist Negative Free Logic

Sentences containing definite descriptions, expressions of the form `The...
research
06/18/2014

Typed Hilbert Epsilon Operators and the Semantics of Determiner Phrases (Invited Lecture)

The semantics of determiner phrases, be they definite de- scriptions, in...
research
08/04/2021

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 bi...
research
02/01/2012

Reasoning about Unreliable Actions

We analyse the philosopher Davidson's semantics of actions, using a stro...
research
05/17/2021

A Complete Axiomatisation for Divergence Preserving Branching Congruence of Finite-State Behaviours

We present an equational inference system for finite-state expressions, ...

Please sign up or login with your details

Forgot password? Click here to reset