
As an Amazon Associate and affiliate partner, Menrva Books earns from qualifying purchases. Learn more
No description available.
This work investigates the boundaries of decidability within first-order logic by identifying specific classes of quantificational formulas for which the decision problem is solvable. The authors, Burton Dreben and Warren D. Goldfarb, utilize a rigorous mathematical framework to categorize logical formulas based on their quantifier structure and predicate complexity. By synthesizing historical developments in formal logic with their own technical proofs, they establish a comprehensive taxonomy of solvable cases that remain foundational to the study of automated theorem proving and computational complexity.
What You Will Find
Experts in mathematical logic and theoretical computer science recognize this text as a definitive reference for the classification of solvable decision problems. Readers frequently note the high level of technical density, which requires a strong background in formal logic to fully comprehend the proofs presented.
Page Count:
0
Publication Date:
1980-01-01
Publisher:
Addison-Wesley Longman, Incorporated
ISBN-10:
0201025396
ISBN-13:
9780201025392
No comments yet. Be the first to share your thoughts!