The following pages link to (Q4398473):
Displaying 16 items.
- From the weak to the strong existence property (Q448335) (← links)
- The analytical completeness of Dzhaparidze's polymodal logics (Q685073) (← links)
- Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and normal form theorems (Q1004086) (← links)
- Post's problem for ordinal register machines: an explicit approach (Q1032632) (← links)
- Fundamentals of generalized recursion theory (Q1078561) (← links)
- Power set recursion (Q1346246) (← links)
- Learning by switching type of information. (Q1427864) (← links)
- Generalized notions of mind change complexity (Q1881221) (← links)
- Effective forcing versus proper forcing (Q1923578) (← links)
- Mind change complexity of inferring unbounded unions of restricted pattern languages from positive data (Q2268856) (← links)
- Characterizing the interpretation of set theory in Martin-Löf type theory (Q2500469) (← links)
- (Q3679149) (← links)
- (Q4513978) (← links)
- (Q5012918) (← links)
- Achilles and the tortoise climbing up the arithmetical hierarchy (Q5906326) (← links)
- Hyper-polynomial hierarchies and the polynomial jump (Q5958122) (← links)