Hostname: page-component-cd9895bd7-dzt6s Total loading time: 0 Render date: 2024-12-24T12:38:18.682Z Has data issue: false hasContentIssue false
  • English
  • Français

Logic on electronic computers: a practical method for reducing expressions to conjunctive normal form

Published online by Cambridge University Press:  24 October 2008

N. A. Routledge
N. A. Routledge
Affiliation:
King's CollegeCambridge
Get access Rights & Permissions [Opens in a new window]

Abstract

In § 1 we introduce our system and prove a theorem about its syntax. In § 2 we recall some stock results about the propositional calculus. In § 3 we consider a method of deriving an expression from a given expression and a real number. In § 4 we use this to derive a sequence of expressions from a given expression. In § 5 this sequence is shown to be just all the terms of a conjunctive normal form of the given expression. In § 6 we note that we may not need to produce all of these terms. In § 7 we describe a practical method (suitable for a binary digital electronic computer) which results from all this, and in § 8 we attempt to explain just why this is so.

Type
Research Article
Information
Mathematical Proceedings of the Cambridge Philosophical Society , Volume 52 , Issue 2 , April 1956 , pp. 161 - 173
Copyright
Copyright © Cambridge Philosophical Society 1956

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)Hilbert, D. and Bernays, P.Grundlagen der Mathematik, vol. 1 (Berlin, 1934).Google Scholar
(2)Post, E. L.Introduction to a general theory of elementary propositions. Amer. J. Math. 43 (1921), 163–85.CrossRefGoogle Scholar
(3)Rosenbloom, P. C.The elements of mathematical logic (New York, 1950).Google Scholar
(4)Schröter, K.Axiomatisierung der Fregeschen Aussagenkalküle (Leipzig, 1943).Google Scholar