Functional predicate: Difference between revisions

Revision as of 05:39, 30 August 2007

Revision as of 16:27, 31 December 2007

Line 65:

:<math>(\forall X, \exists ! Y, P(X,Y))\rightarrow (\forall A, \exists B, \forall C, \forall D, P(C,D)\rightarrow (C \in A \rightarrow D \in B)).</math>

This version of the axiom schema of replacement is now suitable for use in a formal language that doesn't allow the introduction of new function symbols. Alternatively, one may interpret the original statement as a statement in such a formal language; it was merely an abbreviation for the statement produced at the end.

== See also ==

*[[Logical connective]]

*[[Logical constant]]

[[Category:Model theory]]

[[zh:泛函谓词]]