Hostname: page-component-76fb5796d-zzh7m Total loading time: 0 Render date: 2024-04-27T21:40:54.175Z Has data issue: false hasContentIssue false
  • English
  • Français

Testing the independence of a system of axioms, using a logical computer

Published online by Cambridge University Press:  24 October 2008

Eric Foxley
Eric Foxley
Affiliation:
The UniversityNottingham
Get access Rights & Permissions [Opens in a new window]

Extract

The object of this paper is to show how a well-known method of demonstrating the independence of one member of a system of axioms can be incorporated into a systematic method of testing for independence, suitable for solution on a logical computer of the type now being built at the University of Nottingham.

Type
Research Article
Information
Mathematical Proceedings of the Cambridge Philosophical Society , Volume 57 , Issue 3 , July 1961 , pp. 443 - 448
Copyright
Copyright © Cambridge Philosophical Society 1961

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

REFERENCES

(1)Church, A.Conditioned disjunction as a primitive connective for the propositional calculus. Portug. math. 7 (1948), 87–90.Google Scholar
(2)Rose, A.The use of universal decision elements as flip-flops. Z. Math. Log. 4 (1948), 169–74.CrossRefGoogle Scholar
(3)Hilbert, D. and Ackermann, W.Mathematical logic (Chelsea, 1950).Google Scholar
(4)Rose, A.Many valued logical machines. Proc. Camb. Phil. Soc. 54 (1958), 307–21.CrossRefGoogle Scholar
(5)Rose, A.Conditioned disjunction as a primitive connective for the m-valued propositional calculus. Math. Ann. 123 (1951), 76–8.CrossRefGoogle Scholar