Computable set
Top View
- On Effective Undecidability and Post's Problem
- Computability Theory and Foundations of Mathematics
- Enumerations in Computable Structure Theory
- Algorithmic Complexity and Triviality
- Axiomatic Theory of Algorithms
- Notes on Definability
- BARWISE: INFINITARY LOGIC and ADMISSIBLE SETS Contents 0
- The Computably Enumerable Sets: a Partial Survey with Questions
- Arxiv:2009.09541V3
- Cobham Recursive Set Functions and Weak Set Theories ∗
- Minimalist Set Theory
- Every Computable Set Is Generically Reducible to Every Computable Set That Does Not Have Density 0 Or 1
- Computable Set Theory*
- Computability Theory These Notes Cover the Second Part of PMATH 432/632 Taught in the Winter Semester of 2020
- Proof Theory: from Arithmetic to Set Theory
- Theories and Computability
- Effectively Closed Sets and Enumerations
- Introduction to Computability Theory