Searching…
Typi- cally, the strength of variants of the infinite Ramsey theorem is precisely calibrated from the viewpoints of computability and proof theory.
computability of this limit, rates of convergence to the limit and so on and so forth. Although well documented, periodicity is still too much an idealized ...
Bloch, Algebraic K-theory and classfield theory for arithmetic surfaces., Annals of Math ... fact not only theoretical results about algorithmic computability of ...
of the 6th Workshop on Computability and Complexity in Analysis, vol. 120 of Electronic Notes in Theoretical Computer Science, pp. 125-133 (2005). [20] ...
Her talk also went over connections with computability and Borel combinatorics. At the applied end of set theory, we had talks about the current developments.
In- deed, higher computability even contributes to the problem by generating wealthy ... Theory, 34(4):605–612, 1988. [4] K. Gröchenig. Time-frequency analysis of ...
Considerations from computability theory [43] tell us that effective Cauchy rates are in general excluded, and one thus looks at an equivalent but ...
In formulating his conjecture, Wilkie was probably influenced by Khovanskii's theory of fewnomials [25]. ... imply the (effective) polynomial time computability ...
PRIN 2017-2017NWTM8R Mathematical Logic: models, sets, computability. Page 21. Set Theory. 99. Rigidity conjectures in continuous quotients. Alessandro Vignati.
[9] Rogers H., Theory of Recursive Functions and Effective Computability, McGraw-Hill, New. York, 1967. The axiomatic derivation of absolute lower bounds.