Definition:Decidable

From ProofWiki
Jump to navigation Jump to search

Definition

A class $\CC$ of statements is decidable if and only if there exists an effective procedure for answering whether each statement in $\CC$ is true or false.


Formal System

A formal system $\FF$ is decidable if and only if there exists an effective procedure for determining whether a WFF of $\FF$ is a theorem of $\FF$.


Also see

  • Results about decidability can be found here.


Sources