Pages that link to "Item:Q5773619"
From MaRDI portal
The following pages link to Systems of Logic Based on Ordinals<sup>†</sup> (Q5773619):
Displaying 22 items.
- The Possibility of Analysis: Convergence and Proofs of Convergence (Q3295778) (← links)
- Fair play for machines (Q3451543) (← links)
- A Fortuitous Year with Leon Henkin (Q3454802) (← links)
- Approaching simple and powerful service-computing<sup>1</sup> (Q3498554) (← links)
- How We Think of Computing Today (Q3507474) (← links)
- Why Turing’s Thesis Is Not a Thesis (Q4637226) (← links)
- Incomputability Emergent, and Higher Type Computation (Q4637227) (← links)
- ARITHMETICAL INTERPRETATIONS AND KRIPKE FRAMES OF PREDICATE MODAL LOGIC OF PROVABILITY (Q4918381) (← links)
- CURRENT RESEARCH ON GÖDEL’S INCOMPLETENESS THEOREMS (Q4959663) (← links)
- Fine-grained I/O complexity via reductions: new lower bounds, faster algorithms, and a time hierarchy (Q4993299) (← links)
- Three topological reducibilities for discontinuous functions (Q5046178) (← links)
- Feferman and the Truth (Q5214789) (← links)
- AXIOMATIZATION OF PROVABLE n-PROVABILITY (Q5222538) (← links)
- Reflection calculus and conservativity spectra (Q5377088) (← links)
- Accelerating machines: a review (Q5451177) (← links)
- The Church-Turing Thesis over Arbitrary Domains (Q5452180) (← links)
- Recursive Predicates and Quantifiers (Q5843994) (← links)
- Inductive logic programming (Q5895240) (← links)
- Strictly primitive recursive realizability. II: Completeness with respect to iterated reflection and a primitive recursive \(\omega\)-rule (Q5937826) (← links)
- An open formalism against incompleteness (Q5937853) (← links)
- Did Turing stand on Gödel's shoulders? (Q6169862) (← links)
- Complexity barriers as independence (Q6599290) (← links)
