Free Delivery Over $100
|
|
|||
|
||||
OverviewFor propositional logic it can be decided whether a formula has a deduction from a finite set of other formulas. This volume begins with a method to decide this for the quantified formulas of those fragments of arithmetic which express the properties of order-plus-successor and of order-plus-addition (Pressburger arithmetic). It makes use of an algorithm eliminating quantifiers which, in turn, is also applied to obtain consistency proofs for these fragments. Full Product DetailsAuthor: Walter FelscherPublisher: Taylor & Francis Ltd Imprint: CRC Press Weight: 0.453kg ISBN: 9780367398576ISBN 10: 0367398575 Pages: 312 Publication Date: 05 September 2019 Audience: College/higher education , Professional and scholarly , Undergraduate , Postgraduate, Research & Scholarly Format: Paperback Publisher's Status: Active Availability: In Print  This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us. Table of ContentsReviewsAuthor InformationFelscher, Walter Tab Content 6Author Website:Countries AvailableAll regions |
||||
