Pages that link to "Item:Q3851086"
From MaRDI portal
The following pages link to Enumeration and the Grzegorczyk Hierarchy (Q3851086):
Displaying 8 items.
- Complexity of algorithms and computations (Q1153141) (← links)
- Basic predicate calculus is not sound with respect to the strong variant of strictly primitive recursive realizability (Q2113424) (← links)
- Strictly primitive recursive realizability, I (Q4323037) (← links)
- THE NONARITHMETICITY OF THE PREDICATE LOGIC OF STRICTLY PRIMITIVE RECURSIVE REALIZABILITY (Q5099782) (← links)
- Hierarchies of Computable groups and the word problem (Q5567869) (← links)
- A New Hierarchy of Elementary Functions (Q5570927) (← links)
- Strictly primitive recursive realizability. II: Completeness with respect to iterated reflection and a primitive recursive \(\omega\)-rule (Q5937826) (← links)
- Basic predicate calculus is sound with respect to a modified version of strictly primitive recursive realizability (Q6194302) (← links)
