Partially answering this question involves ideas from the theory of computability such as Turing degrees and truth-table degrees. We want to make this paper ...

Weihrauch degrees, omniscience principles and weak computability. The Journal of Symbolic Logic, 76(1) (2011) 143–176. [4] Vasco Brattka, Guido Gherardi, and ...

of intertwined perspectives such as numerical simulation, computability theory, computa- tional complexity, or analog computation. The last one understands ...

Bounded arithmetic, weak analysis, polyspace computability, conservation re- sults, cut-elimination. 1. Introduction. Close connections between bounded theories ...

theorem and computability theory. Adv. Math. 444 (2024), article no. 109618 Zbl 07837848. MR 4723965. [5] É. Borel, Contribution à l'analyse arithmétique du ...

Nov 3, 2016 ... This highly interdisciplinary workshop brought together 51 Mathematicians from. Number Theory, Logic, Algebraic Geometry, Computability, ...

His current research interest is computability theory. Holger Teismann was born and educated in Germany. He came to Canada in 1998 to pursue postdoctoral ...

computability and recursion theory), 03F30 (first-order arithmetic and fragments), 03C62 (mod- els of arithmetic and set theory), 03H15 (nonstandard models ...

Computability, 4(1):57–68, 2015. Page 17. Mathematical Logic: Proof Theory, Constructive Mathematics. 1709. A quantitative analysis of ...