Zobrazeno 1 - 10
of 185
pro vyhledávání: '"Fast-growing hierarchy"'
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:
Anton Freund
Publikováno v:
Annals of Pure and Applied Logic. 168:1361-1382
As Paris and Harrington have famously shown, Peano Arithmetic does not prove that for all numbers $k,m,n$ there is an $N$ which satisfies the statement $\operatorname{PH}(k,m,n,N)$: For any $k$-colouring of its $n$-element subsets the set $\{0,\dots,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9f54dede8851cf09745b48c9a3c09fcb
https://doi.org/10.1016/j.apal.2017.01.004
https://doi.org/10.1016/j.apal.2017.01.004
Autor:
Andreas Krebs, Mai Gehrke
Publikováno v:
ACM SIGLOG News. 4:29-53
Complexity theory and the theory of regular languages both belong to the branch of computer science where the use of resources in computing is the main focus. However, they operate at different levels. While complexity theory seeks to classify comput
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5ee572b6473214412d770456e43f64fa
https://doi.org/10.1145/3090064.3090068
https://doi.org/10.1145/3090064.3090068
Autor:
Borut Robič
Publikováno v:
The Foundations of Computability Theory ISBN: 9783662624203
The Foundations of Computability Theory ISBN: 9783662448076
The Foundations of Computability Theory ISBN: 9783662448076
In this chapter we will introduce a different view of sets of natural numbers. Sometimes such a set can be defined by a property of its members, where the property is expressed by a formula of Formal Arithmetic. Sets defined by formulas of the same c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::12407f0f52a88a931856289975d2133e
https://doi.org/10.1007/978-3-662-62421-0_15
https://doi.org/10.1007/978-3-662-62421-0_15
Autor:
Silvia Steila
Publikováno v:
Trends in Logic ISBN: 9783030302283
We present a combinatorial bound for the H-bounded version of the Termination Theorem. As a consequence we improve the result by Solovay and Ketonen on the relationship between the Paris–Harrington Theorem and the Fast Growing Hierarchy.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9a9a2a0f638c819cbb2ee15594fa96ba
https://doi.org/10.1007/978-3-030-30229-0_11
https://doi.org/10.1007/978-3-030-30229-0_11
Publikováno v:
Ecological Complexity. 35:25-27
We address the character and positioning of Rosennean complexity in hierarchical models of Nature. The best form of hierarchical representation of Natural systems is a model hierarchy, whose character we present. The complexity which appears between
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::82c6d59130fd4c019b3f6d2f3c9de8fd
https://doi.org/10.1016/j.ecocom.2017.02.001
https://doi.org/10.1016/j.ecocom.2017.02.001
Publikováno v:
Communications in Theoretical Physics. 66:263-268
It is the aim of the present article to give a general expression of flow equations of the q-KP hierarchy. The distinct difference between the q-KP hierarchy and the KP hierarchy is due to q-binomial and the action of q-shift operator θ, which origi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4f5e809284ccdba766061fae8114e230
https://doi.org/10.1088/0253-6102/66/3/263
https://doi.org/10.1088/0253-6102/66/3/263
Publikováno v:
Mathematical Logic Quarterly. 62:420-426
We introduce a hierarchy of sets which can be derived from the integers using countable collections. Such families can be coded into countable algebraic structures preserving their algorithmic properties. We prove that for different finite levels of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::68c7a686e2d5b073a5a98a4b44dc5a2c
https://doi.org/10.1002/malq.201500056
https://doi.org/10.1002/malq.201500056
Autor:
Jean-François Ponge
Publikováno v:
BioScience. 67:672-674
This book, written with 12 collaborators (biologists, physicists, and philosophers from various countries), is the result of a long-standing endeavor to find a law in the “organization of nature,” according to the expression used in an enlighteni
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fa9f929cec03aa4d1ec3ce448828d902
https://doi.org/10.1093/biosci/bix039
https://doi.org/10.1093/biosci/bix039
Publikováno v:
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. :2211-2217
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4c5455a2919c90bca651dd10d952fd93
https://doi.org/10.1587/transfun.e99.a.2211
https://doi.org/10.1587/transfun.e99.a.2211