The elimination of contextually defined predicates in a modal system
In a recent note Bergmann states that “nonextensional languages may contain sentences from which contextually denned predicates are not eliminable.” A restatement of his argument is as follows. Suppose L is a functional calculus of fourth order. Included among the definitions occurring in L isLet ϕ occur in A (where A represents a well-formed formula of L) without an argument. The elimination of ϕ from A in accordance with (1) requiresThe proof of (2) depends on the principle of extensionalityHence Bergmann's conclusion “no such general elimination rule can be constructed for nonextensional languages.”
1974 ◽
Vol 71
(4)
◽
pp. 297-304
2018 ◽
Vol 149
(03)
◽
pp. 761-779
◽
1972 ◽
Vol 13
(2)
◽
pp. 147-152
◽
Keyword(s):
1972 ◽
Vol 69
(4)
◽
pp. 295-333
◽
Keyword(s):
1981 ◽
Vol 90
(1-2)
◽
pp. 147-153
◽
2012 ◽
Vol 142
(5)
◽
pp. 1051-1069
◽
1979 ◽
Vol 83
(3-4)
◽
pp. 205-211
◽