This study provides a unified theory of properties, relations, and propositions (PRPs). Two conceptions of PRPs have emerged in the history of philosophy. The author explores both of these traditional conceptions and shows how they can be captured by a single theory.

Arguments are given against the thesis that properties and propositional functions are identical. The first shows that the familiar extensional treatment of propositional functions -- that, for all x, if f(x) = g(x), then f = g -- must be abandoned. Second, given the usual assumptions of propositional-function semantics, various propositional functions (e.g., constant functions) are shown not to be properties. Third, novel examples are given to show that, if properties were identified with propositional functions, crucial fine-grained intensional distinctions would (...) be lost. (shrink)

"The Logical Framework (LF) is a system for defining a wide class of logics. It is based on a general treatment of syntax, rules, and proofs in terms of a typed [lambda]-calculus with dependent types. Syntax is treated in a style similar to, but more general than, Martin-Löf's system of arities. The treatment of rules and proofs focuses on his notion of a judgement. Logics are encoded in the LF via a new principle, the judgements as types principle, whereby each (...) judgement is identified with the type of its proofs. This allows for a smooth treatment of discharge and variable occurrence conditions and leads to a uniform treatment of rules and proofs whereby rules are viewed as proofs of higher-order judgements and proof checking is reduced to type checking. The practical benefit of our treatment of formal systems is that logic-independent tools such as proof editors and proof checkers can be constructed.". (shrink)