2. Determine whether each of the following proposed proof systems are complete. Justify your answers. (a) Axioms: All formulas. Rules: None. (b) Axioms: None. Rules: From nothing, infer any formula (c) Axioms: All formulas of the form ( → $). Rules: Hypothetical Syllogism. (d) Axioms: All formulas of the form ( → w). Rules: Modus Ponens. (e) Axioms: All formulas of the form ( → w). Rules: Hypothetical Syllogism. (f) Axioms: All tautologies. Rules: From any o that is not a tautology, infer any formula.

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
Question

I would like some guidance on how to prove completeness/incompleteness for parts c-f. 

If I disprove, I'd like to use a counterexample to show that a formula is a tautology and yet not derivable from a set.

If I prove, I'd like to show that for all possible formulas and sets, if the formula is a tautology to the set, then it is also derivable from the set. 

2. Determine whether each of the following proposed proof systems are complete. Justify your answers.
(a) Axioms: All formulas.
Rules: None.
(b) Axioms: None.
Rules: From nothing, infer any formula
(c) Axioms: All formulas of the form ( → $).
Rules: Hypothetical Syllogism.
(d) Axioms: All formulas of the form ( → 4).
Rules: Modus Ponens.
(e) Axioms: All formulas of the form (o → 4).
Rules: Hypothetical Syllogism.
(f) Axioms: All tautologies.
Rules: From any o that is not a tautology, infer any formula.
Transcribed Image Text:2. Determine whether each of the following proposed proof systems are complete. Justify your answers. (a) Axioms: All formulas. Rules: None. (b) Axioms: None. Rules: From nothing, infer any formula (c) Axioms: All formulas of the form ( → $). Rules: Hypothetical Syllogism. (d) Axioms: All formulas of the form ( → 4). Rules: Modus Ponens. (e) Axioms: All formulas of the form (o → 4). Rules: Hypothetical Syllogism. (f) Axioms: All tautologies. Rules: From any o that is not a tautology, infer any formula.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 6 steps with 6 images

Blurred answer
Knowledge Booster
Indefinite Integral
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, advanced-math and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,