Analytic combinatorics for a certain well-ordered class of iterated exponential terms

Autor: Andreas Weiermann

Publikováno v: Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AD,..., Iss Proceedings (2005)

The aim of this paper is threefold: firstly, to explain a certain segment of ordinals in terms which are familiar to the analytic combinatorics community, secondly to state a great many of associated problems on resulting count functions and thirdly,

Externí odkaz: https://doaj.org/article/f983f3ce048e46a6b91a2edb82e7160e

Some independence results related to finite trees

Autor: Harvey M. Friedman, Andreas Weiermann

Publikováno v: Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences. 381

We investigate some concrete independence results for systems of reverse mathematics which emerge from monotonicity properties of number-theoretic functions. Natural properties of the less than or equal to relation with respect to sums of natural num

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::9ba599a900165d4890a0f44a4b367b5c
https://doi.org/10.1098/rsta.2022.0017

GOODSTEIN SEQUENCES BASED ON A PARAMETRIZED ACKERMANN–PÉTER FUNCTION

Autor: Andreas Weiermann, Toshiyasu Arai, Stanley S. Wainer

Publikováno v: The Bulletin of Symbolic Logic. 27:168-186

Following our [6], though with somewhat different methods here, further variants of Goodstein sequences are introduced in terms of parameterized Ackermann–Péter functions. Each of the sequences is shown to terminate, and the proof-theoretic streng

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::ffbbea1ab1972b7516e2e2244375b135
https://doi.org/10.1017/bsl.2021.30

Calculating Maximal Order Types for Finite Rooted Unstructured Labeled Trees

Autor: Jeroen Van der Meeren, Diana Schmidt, Andreas Weiermann

Publikováno v: The Legacy of Kurt Schütte ISBN: 9783030494230

Diana Schmidt, in her Habilitationsschrift in 1979, completely classified the maximal order types of the natural tree embeddability relations for finite rooted structured labeled trees. Her results since have found interesting applications in proof t

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::e565859eff6eff551804ecd20ad799bc
https://doi.org/10.1007/978-3-030-49424-7_14

Ackermannian Goodstein sequences of intermediate growth

Autor: Andreas Weiermann, David Fernández-Duque

Publikováno v: Beyond the horizon of computability : 16th Conference on Computability in Europe, CiE 2020, Fisciano, Italy, June 29-July 3, 2020, Proceedings
Beyond the Horizon of Computability
Lecture Notes in Computer Science ISBN: 9783030514655
CiE

The original Goodstein process proceeds by writing natural numbers in nested exponential k-normal form, then successively raising the base to \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{am

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::99c696e26779b2bef87f07ceb4b528bb
https://hdl.handle.net/1854/LU-8668868