MétaCan
Menu
Back to cohort
Record W2594069757 · doi:10.2178/jsl/1174668399

Forcing indestructibility of set-theoretic axioms

2007· article· en· W2594069757 on OpenAlexaff
Bernhard König

Bibliographic record

VenueJournal of Symbolic Logic · 2007
Typearticle
Languageen
FieldMathematics
TopicAdvanced Topology and Set Theory
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsAxiomForcing (mathematics)Consistency (knowledge bases)Countable setHierarchySet (abstract data type)MathematicsSet theoryZermelo–Fraenkel set theoryMathematical economicsDiscrete mathematicsAlgebra over a fieldPure mathematicsComputer scienceAxiom of choiceGeometryMathematical analysisProgramming languageEconomics

Abstract

fetched live from OpenAlex

Abstract Various theorems for the preservation of set-theoretic axioms under forcing are proved, regarding both forcing axioms and axioms true in the Lévy collapse. These show in particular that certain applications of forcing axioms require to add generic countable sequences high up in the set-theoretic hierarchy even before collapsing everything down to ℵ 1 . Later we give applications, among them the consistency of MM with ℵ ω not being Jónsson which answers a question raised in the set theory meeting at Oberwolfach in 2005.

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 machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.007
metaresearch head score (Gemma)0.020
Version: metacan-v3-hybrid-931329e0061cValidation 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: none
Teacher disagreement score0.007
Threshold uncertainty score0.038

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0070.020
Meta-epidemiology (narrow)0.0000.001
Meta-epidemiology (broad)0.0010.002
Bibliometrics0.0020.001
Science and technology studies0.0020.010
Scholarly communication0.0040.007
Open science0.0030.006
Research integrity0.0020.006
Insufficient payload (model declined to judge)0.0040.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.050
GPT teacher head0.366
Teacher spread0.316 · 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 source (direct Gemma or distilled Codex), 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

Citations11
Published2007
Admission routes1
Has abstractyes

Explore more

Same venueJournal of Symbolic LogicSame topicAdvanced Topology and Set TheoryFrench-language works237,207