◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

P. Uftring

9 papers hereh-index 425 citations13 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author6
  • last author3

Across the 9 of 9 papers where every author was matched, so the position is known.

fields
  • math.LO9

identity via Semantic Scholar / OpenAlex

activity
20202026
most citedWeak and Strong Versions of Effective Transfinite Recursion

3 citations · 6 across the 9 of their papers we have counts for

collaborators
Showing 2025 · math.LOShow all

2 papers · 2 filters

math.LO2025

Maximal order types for sequences with gap condition

Patrick Uftring

Higman's lemma states that for any well partial order X, the partial order X∗ of finite sequences with members from X is also well. By combining results due to Girard as wel…

math.LO2025

The uniform Kruskal theorem over RCA0​

Patrick Uftring

Kruskal's theorem famously states that finite trees (ordered using an infima-preserving embeddability relation) form a well partial order. Freund, Rathjen, and Weiermann extended t…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.