A01=M. Downward
abstract
Abstract Type
Author_M. Downward
automated theorem proving
Binary Search Tree
Category=QDTL
deduction
Deduction Tree
Domain Elements
Elimination Rule
Empty List
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
Equality Axioms
first order reasoning
form
Functional Language
Hasse Diagram
Herbrand Universe
Inference Rule
Introduction Rule
Intuitionistic Logic
Lambda Calculus
Logic Languages
logic programming foundations
manual proof construction techniques
Natural Deduction
Natural Deduction Proofs
negation
Negation Normal Form
normal
Prolog language applications
Proof Objects
proof strategies
Proof Tree
propositional calculus
Quantifier Inferences
semantic
Semantic Tableau
tableau
Term Rewriting
trees
TRSs
truth
type
Vice Versa
Product details
- ISBN 9780748408023
- Weight: 453g
- Dimensions: 156 x 234mm
- Publication Date: 31 Mar 1998
- Publisher: Taylor & Francis Ltd
- Publication City/Country: GB
- Product Form: Paperback
Secure
checkout
Fast Shipping
Easy returns
Logic has acquired a reputation for difficulty, perhaps because many of the approaches adopted have been more suitable for mathematicians than computer scientists. This book shows that the subject is not inherently difficult and that the connections between logic and declarative language are straightforward. Many exercises have been included in the hope that these will lead to a much greater confidence in manual proofs, therefore leading to a greater confidence in automated proofs.
