Jump to content

Decidability: Difference between revisions

From Wikipedia, the free encyclopedia
Content deleted Content added
No edit summary
m indecidability→undecidability - Correct typos in one click
 
(27 intermediate revisions by 24 users not shown)
Line 1: Line 1:
{{Wiktionary}}
The word '''''decidable''''' has a variety of meanings in [[mathematical logic]], [[computing]], and [[recursion theory]].
The word '''''decidable''''' may refer to:


* [[Decidable language]]
*See [[Gödel's incompleteness theorem]] for an account of some meaning of this word in mathematical logic.
*[[Decidability (logic)]] for the equivalent in mathematical logic
*See [[recursive set|decidable set]] for a meaning in [[recursion theory]] (i.e., the theory of computability).
*[[Decidable problem]] and [[Undecidable problem]]
*See [[decidable language]] for a related meaning in computing.
*[[Gödel's incompleteness theorem]], a theorem on the undecidability of languages consisting of "true statements" in mathematical logic.
* [[Recursive set]], a "decidable set" in recursion theory


==See also==
{{disambig}}
* [[Decision problem]]
* [[List of undecidable problems]]
* [[Decision (disambiguation)]]
* [[Decide (disambiguation)]]

{{disambiguation}}

Latest revision as of 15:04, 6 November 2022

The word decidable may refer to:

See also

[edit]