Functional predicate: Difference between revisions

Revision as of 08:35, 9 April 2003

Revision as of 21:29, 27 April 2003

Line 35:

Many treatments of predicate logic don't allow functional predicates, only relational [[predicate (logic)|predicate]]s.

This is useful, for example, in the context of proving [[metalogic]]al theorems (such as [[GödelGödel's incompleteness theorem]]s), where one doesn't want to allow the introduction of new functional symbols (nor any other new symbols, for that matter).

But there is a method of replacing functional symbols with relational sybmols wherever the former may occur; furthermore, this is algorithmic and thus suitable for applying most metalogical theorems to the result.