Does Koepke's notion of ordinal computability admit an analogue of the Kleene $T$-predicate? If so, is the existence of such a $T$-predicate independent of $ZFC$? Also, if one assumes the existence of such a $T$-predicate, can an analogue of the Kleene hierarchy be defined for Koepke's ordinal computability, and can one define a set theory based on that analogue of the Kleene hierarchy rather than, say, the cumulative hierarchy?
$\begingroup$
$\endgroup$
7
asked Oct 23, 2015 at 12:21
-
$\begingroup$ You might consider adding a top-level tag in order to make more people see this question. $\endgroup$– Stefan Kohl ♦Commented Oct 23, 2015 at 12:51
-
$\begingroup$ @StefanKohl: How does one add a top-level tag? $\endgroup$– Thomas BenjaminCommented Oct 23, 2015 at 13:53
-
$\begingroup$ Emil Jerabek already added one in the meantime. -- Top-level tags ("arXiv tags") are those which start with two letters followed by a dot. $\endgroup$– Stefan Kohl ♦Commented Oct 23, 2015 at 15:16
-
$\begingroup$ @StefanKohl: Since I have never heard of such a tag (and I couldn't find such a tag in the list of tags, what does such a tag signify? $\endgroup$– Thomas BenjaminCommented Oct 23, 2015 at 15:26
-
$\begingroup$ These tags describe the broad area(s) of mathematics a question belongs to. The other tags are in general for finer specification. Often people look for questions with the top-level tags for the areas they are interested in, and if a question has none, it easily gets overlooked by people who might know an answer. $\endgroup$– Stefan Kohl ♦Commented Oct 23, 2015 at 15:36
|
Show 2 more comments