Hostname: page-component-cd9895bd7-8ctnn Total loading time: 0 Render date: 2024-12-25T19:28:26.080Z Has data issue: false hasContentIssue false
  • English
  • Français

On the inconsistency of systems similar to

Published online by Cambridge University Press:  12 March 2014

M. W. Bunder  and
R. K. Meyer
M. W. Bunder
Affiliation:
Mathematics Institute, Oxford, England
R. K. Meyer
Affiliation:
Mathematics Institute, Oxford, England
Get access Rights & Permissions [Opens in a new window]

Extract

This note shows that the inconsistency proof of the system of illative combinatory logic given in [1] can be simplified as well as extended to the absolute inconsistency of a more general system.

One extension of the result in [1] lies in the fact that the following weakened form of the deduction theorem for implication will lead to the inconsistency:

Also the inconsistency follows almost as easily for

as it does for ⊢ H2X for arbitrary X, so we will consider the more general case.

The only properties we require other than (DT), (1) and Rule Eq for equality are modus ponens,

and

Let G = [x] Hn−1x⊃: . … H2x⊃ :Hx⊃ . x ⊃ A, where A is arbitrary. Then if Y is the paradoxical combinator and X = YG, X = GX.

Now X ⊂ X, i.e.,

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 43 , Issue 1 , March 1978 , pp. 1 - 2
Copyright
Copyright © Association for Symbolic Logic 1978

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCE

[1]Bunder, M. W., The inconsistency of , this Journal, vol. 41 (1976), pp. 467–468.Google Scholar