MétaCan
Menu
Back to cohort
Record W2605592859 · doi:10.1215/00294527-3882335

Club-Isomorphisms of Aronszajn Trees in the Extension with a Suslin Tree

2017· article· en· W2605592859 on OpenAlexfundno aff
Teruyuki Yorioka

Bibliographic record

VenueNotre Dame Journal of Formal Logic · 2017
Typearticle
Languageen
FieldMathematics
TopicMathematical Dynamics and Fractals
Canadian institutionsnot available
FundersJapan Society for the Promotion of ScienceNatural Sciences and Engineering Research Council of CanadaShizuoka University
KeywordsMathematicsExtension (predicate logic)CombinatoricsTree (set theory)Computer scienceProgramming language

Abstract

fetched live from OpenAlex

We show that, under PFA.S/, a coherent Suslin tree forces that every two Aronszajn trees are club-isomorphic. . Todorevi [27] introduced the proper forcing axiom PFA.S/. This axiom asserts that there exists a coherent Suslin tree S such that the forcing axiom holds for every proper forcing notion P which preserves that S is Suslin, that is, for any set D I 2 ! 1 of @ 1 -many dense open subsets of P, there exists a filter of P which intersects all of the D 's. We note that, under the existence of a supercompact cardinal, PFA.S/ can be forced by the use of the theorem due to Miyamoto [16, Theorem 1.3] (see Theorem 2.1 below).

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.002
metaresearch head score (Gemma)0.001
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
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.081
Threshold uncertainty score0.318

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.072
GPT teacher head0.331
Teacher spread0.259 · 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.

The models applied no category: nothing in the taxonomy fit this work.
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

Citations0
Published2017
Admission routes1
Has abstractyes

Explore more

Same venueNotre Dame Journal of Formal LogicSame topicMathematical Dynamics and FractalsFrench-language works237,207