Semi-decidable set
Summary
A set for which membership can be determined by a computational process that halts and accepts if the element is a member, but may not halt if the element is not a member.
Further reading
- Wikipedia, page 43580500, revision 1360947732, Glossary of set theory, section S. adopted
About this page
| Tag | RSHM6MH5Q8 |
|---|---|
| URI | m2://RSHM6MH5Q8 |
| Kind | concept |
| Writing | W1 stated |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge defines in: at least one definition (0 of 1)
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
- edge specializes both: the more general notions and the special cases (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.