Definition:Consistent (Logic)/Proof System

From ProofWiki
Jump to navigation Jump to search

Definition

Let $\LL$ be a logical language.

Let $\mathscr P$ be a proof system for $\LL$.


Then $\mathscr P$ is consistent if and only if:

There exists a logical formula $\phi$ such that $\not \vdash_{\mathscr P} \phi$

That is, some logical formula $\phi$ is not a theorem of $\mathscr P$.


Propositional Logic

Suppose that in $\mathscr P$, the Rule of Explosion (Variant 3) holds.


Then $\mathscr P$ is consistent if and only if:

For every logical formula $\phi$, not both of $\phi$ and $\neg \phi$ are theorems of $\mathscr P$


Also defined as

Consistency is obviously necessary for soundness in the context of a given semantics.

Therefore it is not surprising that some authors obfuscate the boundaries between a consistent proof system (in itself) and a sound proof system (in reference to the semantics under discussion).


Also see


Sources

Retrieved from "https://proofwiki.org/w/index.php?title=Definition:Consistent_(Logic)/Proof_System&oldid=572896"