MétaCan
Menu
Back to cohort
Record W2886673224 · doi:10.1515/ms-2017-0138

Single identities forcing lattices to be Boolean

2018· article· en· W2886673224 on OpenAlexaff
Ivan Chajda, Helmut Länger, R. Padmanabhan

Bibliographic record

VenueMathematica Slovaca · 2018
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Algebra and Logic
Canadian institutionsUniversity of Manitoba
Fundersnot available
KeywordsUnary operationMathematicsComplete Boolean algebraBoolean algebras canonically definedStone's representation theorem for Boolean algebrasDistributive propertyTwo-element Boolean algebraBoolean algebraForcing (mathematics)Distributive latticeFree Boolean algebraLattice (music)Variable (mathematics)Discrete mathematicsAlgebra over a fieldPure mathematicsAlgebra representation

Abstract

fetched live from OpenAlex

Abstract In this note we characterize Boolean algebras among lattices of type (2, 2, 1) with join, meet and an additional unary operation by means of single two-variable respectively three-variable identities. In particular, any uniquely complemented lattice satisfying any one of these equational constraints is distributive and hence a Boolean algebra.

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.002
metaresearch head score (Gemma)0.005
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: Empirical
Teacher disagreement score0.006
Threshold uncertainty score0.018

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.005
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0020.006
Scholarly communication0.0060.006
Open science0.0010.004
Research integrity0.0010.003
Insufficient payload (model declined to judge)0.0050.001

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.043
GPT teacher head0.278
Teacher spread0.236 · 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

Citations3
Published2018
Admission routes1
Has abstractyes

Explore more

Same venueMathematica SlovacaSame topicAdvanced Algebra and LogicFrench-language works237,207