Assertion: problem | /r/HasProperty | decidable
Facets:
value: for ≤ 4
type: OTHER
value: for 3
type: OTHER
value: partially
type: DEGREE
Source sentences:
text: A problem is partially decidable, semidecidable, solvable, or provable if A is a recursively enumerable set.
text: This problem is decidable if n ≤ 2,  but remains undecidable for n ≥ 5.
text: It is unknown whether the problem is decidable for 3 ≤ n ≤ 4.
text: This problem is decidable if ≤ 2, but remains undecidable for ≥ 5.
text: It is unknown whether the problem is decidable for 3 ≤ ≤ 4.