With the following (false) argument, one could claim that PL1 is decidable: We take a complete proof calculus for PL1. W

Business, Finance, Economics, Accounting, Operations Management, Computer Science, Electrical Engineering, Mechanical Engineering, Civil Engineering, Chemical Engineering, Algebra, Precalculus, Statistics and Probabilty, Advanced Math, Physics, Chemistry, Biology, Nursing, Psychology, Certifications, Tests, Prep, and more.
Post Reply
answerhappygod
Site Admin
Posts: 899604
Joined: Mon Aug 02, 2021 8:13 am

With the following (false) argument, one could claim that PL1 is decidable: We take a complete proof calculus for PL1. W

Post by answerhappygod »

With the following (false) argument, one could claim that PL1 is decidable:
We take a complete proof calculus for PL1. With it we can find a proof for any true formula in finite time. For every other formula / I proceed as follows: I apply the calculus to ¬/ and show that ¬/ is true. Thus / is false. Thus I can prove or refute every formula in PL1. Find the mistake in the argument and change it so it becomes correct.
(b) Construct a decision process for the set of true and unsatisfiable formulas in PL1.
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!
Top
Post Reply

Return to “Archived Questions & Answers”