MétaCan
Menu
Back to cohort

Chain conditions in computable rings

2010· article· en· W2091132231 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueTransactions of the American Mathematical Society · 2010
Typearticle
Languageen
FieldComputer Science
TopicComputability, Logic, AI Algorithms
Canadian institutionsUniversity of Waterloo
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsMathematicsArtinian ringIdeal (ethics)Ring (chemistry)Principal ideal ringCommutative ringMaximal idealSimple ringPrime idealPure mathematicsNoetherianNoetherian ringDiscrete mathematicsReduced ringNoncommutative ringRadical of a ringPrime (order theory)Algebra over a fieldCombinatoricsCommutative propertyLaw

Abstract

fetched live from OpenAlex

Friedman, Simpson, and Smith showed that, over RCA$_0$, the statements “Every ring has a maximal ideal” and “Every ring has a prime ideal” are equivalent to ACA$_0$ and WKL$_0$, respectively. More recently, Downey, Lempp, and Mileti have shown that, over RCA$_0$, the statement “Every ring that is not a field contains a nontrivial ideal” is equivalent to WKL$_0$. In this article we explore the reverse mathematical strength of the classic theorems from commutative algebra which say that every Artinian ring is Noetherian, and every Artinian ring is of finite length. In particular we show that, over RCA$_0$, the former implies WKL$_0$ and is implied by ACA$_0$, while over RCA$_0$+B$\Sigma _2$, the latter is equivalent to ACA$_0$.

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.

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.000
metaresearch head score (Gemma)0.000
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: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.701
Threshold uncertainty score0.454

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.001
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.001
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.010
GPT teacher head0.254
Teacher spread0.245 · 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