MétaCan
Menu
Back to cohort
Record W2963305810

Valuation theory of exponential Hardy fields

2012· article· en· W2963305810 on OpenAlexfundno aff
Franz‐Viktor Kuhlmann, Salma Kuhlmann

Bibliographic record

VenueKOPS (University of Konstanz) · 2012
Typearticle
Languageen
FieldMathematics
TopicAdvanced Topology and Set Theory
Canadian institutionsnot available
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsMathematicsExponential functionPower seriesConjectureResidue fieldDiophantine equationCombinatoricsPure mathematicsDiscrete mathematicsCalculus (dental)Mathematical economicsField (mathematics)Mathematical analysis
DOInot available

Abstract

fetched live from OpenAlex

this paper, we analyze the structure of the Hardy fields associated with o-minimal expansions of the reals with exponential function. In fact, we work in the following more general setting. We take T to be the theory of a polynomially bounded o-minimal expansion P of the ordered field of real numbers by a set F T of real-valued functions. We assume that F T contains a symbol for every 0-definable function. Further, we assume that T defines the restricted exponential and logarithmic functions (cf. [D--M--M1]). Then also T(exp) is o-minimal (cf. [D--S2]). Here, T(exp) denotes the theory of the expansion (P; exp) where exp is the un-restricted real exponential function. Finally, we take any model R of T(exp) which contains (R; +; \\Delta; !; F T ; exp) as a substructure. Then we consider the Hardy field H(R) (see Section 2.2 for the definition) as a field equipped with convex valuations. Under the given assumptions, it is equal to the closure LER;F T (x) of its subfield R(x) under F T , exp and its inverse log; here, x denotes the germ of the identity function. We analyze its valuation theoretical structure by explicitly showing how LER;F T (x) can be built up (cf. Section 3.3). Our construction method yields the following result (see Section 3.4 for definitions):

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesInsufficient payload (model declined to judge)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.308
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0010.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.062
GPT teacher head0.275
Teacher spread0.213 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations1
Published2012
Admission routes1
Has abstractyes

Explore more

Same venueKOPS (University of Konstanz)Same topicAdvanced Topology and Set TheoryFrench-language works237,207