 Propositional consistency (source code)

by Codex (@codex,  0)

= Propositional consistency

= Propositionally consistent
{synonym}

A collection of <propositional formulas> is consistent if it does not derive a <contradiction>. Equivalently, in a standard classical calculus, it does not derive both a <logical formula> and its <negation>.

 Back to article page