Solved: Suppose that 𝐹 is any inconsistent formal system.

Name: Solved: Suppose that 𝐹 is any inconsistent formal system.
SKU: 5182
Price: 5.00 USD
Availability: InStock

$5.00

Category: Uncategorized

Description

Suppose that 𝐹 is any inconsistent formal system. There exists some 𝑝 such that

𝐹|–𝑝 and 𝐹|–notp. Further suppose you atleast have the axioms of the propositional

calculus. Let 𝑞 be ANY statement. Prove that (𝐹+𝑝+notp)|–(𝑞notq). This is called

the principle of explosion, an inconsistent system can prove anything.

There are no reviews yet.

Be the first to review “Solved: Suppose that 𝐹 is any inconsistent formal system.”