default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnton Freund
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j17]Anton Freund, Davide Manca:
Normal functions and maximal order types. J. Log. Comput. 34(6): 1064-1081 (2024)- 2023
- [j16]Anton Freund
:
Bachmann-Howard derivatives. Arch. Math. Log. 62(5-6): 581-618 (2023) - 2022
- [j15]Anton Freund:
A Mathematical Commitment without Computational strength. Rev. Symb. Log. 15(4): 880-906 (2022) - 2021
- [j14]Anton Freund, Michael Rathjen:
Derivatives of normal functions in reverse mathematics. Ann. Pure Appl. Log. 172(2): 102890 (2021) - [j13]Anton Freund:
Well Ordering Principles and -Statements: a Pilot Study. J. Symb. Log. 86(2): 709-745 (2021) - 2020
- [j12]Anton Freund:
Computable aspects of the Bachmann-Howard principle. J. Math. Log. 20(2): 2050006:1-2050006:26 (2020) - [j11]Anton Freund:
Predicative Collapsing Principles. J. Symb. Log. 85(1): 511-530 (2020) - [j10]Anton Freund:
How Strong are single fixed Points of Normal Functions? J. Symb. Log. 85(2): 709-732 (2020) - [j9]Anton Freund:
A note on ordinal exponentiation and derivatives of normal functions. Math. Log. Q. 66(3): 326-335 (2020) - [j8]Anton Freund:
What is effective transfinite recursion in reverse mathematics? Math. Log. Q. 66(4): 479-483 (2020) - [j7]Anton Freund:
From Kruskal's theorem to Friedman's gap condition. Math. Struct. Comput. Sci. 30(8): 952-975 (2020) - [j6]Anton Freund, Fedor Pakhomov:
Short Proofs for Slow Consistency. Notre Dame J. Formal Log. 61(1): 31-49 (2020) - 2019
- [j5]Anton Freund:
A note on iterated consistency and infinite proofs. Arch. Math. Log. 58(3-4): 339-346 (2019) - 2018
- [j4]Anton Freund:
Type-two well-ordering principles, admissible sets, and $\Pi _1^1$ -comprehension. Bull. Symb. Log. 24(4): 460-461 (2018) - 2017
- [j3]Anton Freund:
Proof lengths for instances of the Paris-Harrington principle. Ann. Pure Appl. Log. 168(7): 1361-1382 (2017) - [j2]Anton Freund:
Slow reflection. Ann. Pure Appl. Log. 168(12): 2103-2128 (2017) - 2015
- [j1]Anton Freund, Moreno Andreatta, Jean-Louis Giavitto:
Lattice-based and topological representations of binary relations with an application to music. Ann. Math. Artif. Intell. 73(3-4): 311-334 (2015)
Informal and Other Publications
- 2020
- [i2]Anton Freund, Michael Rathjen, Andreas Weiermann:
Minimal bad sequences are necessary for a uniform Kruskal theorem. CoRR abs/2001.06380 (2020) - [i1]Anton Freund:
From Kruskal's theorem to Friedman's gap condition. CoRR abs/2003.02714 (2020)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-16 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
