5. Prove: For every proposition of length n (where the length of a proposition is the num- ber of characters in it, coun
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
5. Prove: For every proposition of length n (where the length of a proposition is the num- ber of characters in it, coun
5. Prove: For every proposition of length n (where the length of a proposition is the num- ber of characters in it, counting parentheses) using any of the connectives -, , V, +, there exists an equivalent proposition of length at most 3n using only the connectives - 7 2 ㄱ, -. Note that a proposition is written in full format, adding parentheses whenever adding a connective, including over the entire formula. For example, ((-A)VB) is a proposition in full format and it is of length 8.
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!