On a Second-Order Version of Russellian Theory of Definite Descriptions
By: Yaroslav Petrukhin
Potential Business Impact:
Lets computers talk about relationships between things.
Definite descriptions are first-order expressions that denote unique objects. In this paper, we propose a second-order counterpart, designed to refer to unique relations between objects. We investigate this notion within the framework of Russell's theory of definite descriptions. While full second-order logic is incomplete, its fragment defined by Henkin's general models admits completeness. We develop our theory within this fragment and formalize it using a cut-free sequent calculus.
Similar Papers
Description Logics with Two Types of Definite Descriptions: Complexity, Expressiveness, and Automated Deduction
Logic in Computer Science
Helps computers understand descriptions better.
Decidability in First-Order Modal Logic with Non-Rigid Constants and Definite Descriptions
Logic in Computer Science
Makes smart computers understand complex rules better.
A General (Uniform) Relational Semantics for Sentential Logics
Logic in Computer Science
Makes many different logic systems work the same.