# Search results for: Nils Kürbis

Dialectica > 73 > 1-2 > 31 - 63

*A*is characterised as the...

Bulletin of the Section of Logic > 2019 > 48 > 2 > 81-97

Journal of Philosophical Logic > 2015 > 44 > 6 > 713-727

Sentences containing definite descriptions, expressions of the form `The F', can be formalised using a binary quantier 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 INF℩ of...

Dialectica > 73 > 1-2 > 31 - 63

The problem of negative truth is the problem of how, if everything in the world is positive, we can speak truly about the world using negative propositions. A prominent solution is to explain negation in terms of a primitive notion of metaphysical incompatibility. I argue that if this account is correct, then minimal logic is the correct logic. The negation of a proposition *A* is characterised as the...

Bulletin of the Section of Logic > 2019 > 48 > 2 > 81-97

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.

Journal of Philosophical Logic > 2015 > 44 > 6 > 713-727

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

Wydawnictwo Uniwersytetu Łódzkiego,
Nils Kürbis,
University College London Department of Philosophy,
n.kurbis@ucl.ac.uk

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.