Zobrazeno 1 - 10
of 26
pro vyhledávání: '"Recursive ordinal"'
Autor:
William R. Stirton
Publikováno v:
Archive for Mathematical Logic. 61:317-343
Sections 1 through 4 define, in the usual inductive style, various classes of object including one which is called the “combinatory terms of polymorphic type”. Section 5 defines a reduction relation on these terms. Section 6 shows that the weak n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dd97471301bcb4118135665b162abce8
https://doi.org/10.1007/s00153-021-00792-5
https://doi.org/10.1007/s00153-021-00792-5
Autor:
Jacobs, Barry E.
Publikováno v:
Transactions of the American Mathematical Society, 1978 Mar 01. 237, 63-81.
Externí odkaz:
https://www.jstor.org/stable/1997610
Autor:
John N. Crossley
Publikováno v:
The Legacy of Kurt Schütte ISBN: 9783030494230
Kurt Schutte prized elegance in his work. Ever since the work of Gerhard Gentzen, ordinal numbers have been used as a measure in developing consistency proofs for ever more powerful theories. Here I discuss Schutte’s development of his elegant syst
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::567beb8ae6297870face9a1c57958ca7
https://doi.org/10.1007/978-3-030-49424-7_3
https://doi.org/10.1007/978-3-030-49424-7_3
Autor:
Olivier Finkel
Publikováno v:
Mathematical Logic Quarterly. 62:303-318
Local sentences and the formal languages they define were introduced by Ressayre in [Res88]. We prove that locally finite ω-languages and effective analytic sets have the same topological complexity: the Borel and Wadge hierarchies of the class of l
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3e1929d746bf39538f56dc5c73582cc2
https://doi.org/10.1002/malq.201400113
https://doi.org/10.1002/malq.201400113
Autor:
Dominique Lecomte, Olivier Finkel
Publikováno v:
Annals of Pure and Applied Logic. 160:163-191
We prove that, for each countable ordinal ξ≥1, there exist some Σξ0-complete ω-powers, and some Πξ0-complete ω-powers, extending previous works on the topological complexity of ω-powers [O. Finkel, Topological properties of omega context fr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ad9e884393d65a7cf6d05e02df96c3e0
https://doi.org/10.1016/j.apal.2009.02.005
https://doi.org/10.1016/j.apal.2009.02.005
Autor:
Philip D. Welch
Publikováno v:
Theoretical Computer Science. 394:223-228
We use the methods of descriptive set theory and generalized recursion theory to prove various Bounding Lemmata that contribute to a body of results on halting times of non-deterministic infinite time Turing machine computations. In particular we obs
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0a92b6b42d359b8affb2fd594dd0344c
https://doi.org/10.1016/j.tcs.2007.12.014
https://doi.org/10.1016/j.tcs.2007.12.014
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Linda Brown Westrick
We examine the computable part of the differentiability hierarchy defined by Kechris and Woodin. In that hierarchy, the rank of a differentiable function is an ordinal less than omega_1 which measures how complex it is to verify differentiability for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fb64464e29ed66beeee2eeff48d46b5c
Autor:
Lev D. Beklemishev
Publikováno v:
Annals of Pure and Applied Logic. 75(1-2):25-48
For “natural enough” systems of ordinal notation we show that α times iterated local reflection schema over a sufficiently strong arithmetic T proves the same Π 1 0 -sentences as ω α times iterated consistency. A corollary is that the two hie
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::92dd68c2b0fa16259c850a4837201036
Autor:
Julia F. Knight, Rodney G. Downey
Publikováno v:
Proceedings of the American Mathematical Society. 114:545-552
This paper completes an investigation of "jumps" of orderings. The last few cases are given in the proof that for each recursive ordinal α ≥ 1 \alpha \geq 1 and for each Turing degree d ≥ 0 ( α ) {\mathbf {d}} \geq {{\mathbf {0}}^{(\alpha )}} ,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fd6676da091199c536e6e5a642032703
https://doi.org/10.1090/s0002-9939-1992-1065942-0
https://doi.org/10.1090/s0002-9939-1992-1065942-0