All Questions

Given some way to to encode programs to strings with a finite alphabet, which we assume has a computable translation to/from Turing machines, a program is irreducible if no subsequence of it has the ...

I'm doing some archeology and trying to understand a claim. As summed up by David Roberts, on the FOM list in 2011: Let the statement "every infinite sequence of rationals in [0,1] has an ...

Over the years of my study of set theory, I have encountered several sentences of the form V = X: V = L, V = HOD, V = WF (the exclusive assertion of the cumulative hierarchy), and (if I understand ...

After looking through many papers, I noticed that most of the discussions and proofs for Higman's Lemma and Kruskal's Tree Theorem only have formal applications in set theory, logic, and type theory. ...