Abstract
ABSTRACTIn § 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Mathematical Proceedings of the Cambridge Philosophical Society
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
