Leave these fields empty (spam trap):
Name
You can leave this blank to post anonymously, or you can create a Tripcode by using the format Name#Password
Comment
[i]Italic Text[/i]
[b]Bold Text[/b]
[spoiler]Spoiler Text[/spoiler]
>Highlight/Quote Text
[pre]Preformatted & Monospace Text[/pre]
[super]Superset Text[/super]
[sub]Subset Text[/sub]
1. Numbered lists become ordered lists
* Bulleted lists become unordered lists
File

Sandwich


420chan is Getting Overhauled - Changelog/Bug Report/Request Thread (Updated July 26)

Logic cw help

Reply
- Thu, 11 Dec 2014 16:07:45 EST FYItrjmk No.14517
File: 1418332065440.jpg -(33613B / 32.83KB, 420x319) Thumbnail displayed, click image for full size. Logic cw help
Hey if anybody could take a look at this and give me the answers and or help me understand whats expected.
Suppose you are given an algorithm R that can test for any propositional
formula in Conjunctive Normal Form whether it has a resolution refutation or not.
(a) Describe (informally) how to construct from the algorithm R an algorithm T that can
test for any propositional formula in Disjunctive Normal Form whether it a tautology
or not.
(b) Demonstrate how your algorithm T works using the DNF
A ∨ (¬A ∧ B ∧ ¬C) ∨ (¬A ∧ ¬B ∧ ¬C) ∨ (¬A ∧ C)
(c) Explain how the computational complexities of the algorithms R and T related?

Report Post
Reason
Note
Please be descriptive with report notes,
this helps staff resolve issues quicker.