MétaCan
Menu
Back to cohort
Record W2001037801 · doi:10.1093/jigpal/jzl025

A Modal Extension of Weak Generalisation Predicate Logic

2006· article· fr· W2001037801 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.

Bibliographic record

VenueLogic Journal of IGPL · 2006
Typearticle
Languagefr
FieldComputer Science
TopicAdvanced Algebra and Logic
Canadian institutionsYork University
Fundersnot available
KeywordsModal logicModalPredicate (mathematical logic)Mathematical proofExtension (predicate logic)MathematicsAxiomIntuitionistic logicNormal modal logicCorollaryPredicate logicKripke semanticsIntermediate logicDynamic logic (digital electronics)Computer scienceAlgebra over a fieldDiscrete mathematicsTheoretical computer sciencePure mathematicsDescription logicProgramming languageLinear logic

Abstract

fetched live from OpenAlex

We introduce a new axiomatic system of modal logic, BM, extending classical first order logic by adding the binary modal symbol “▹” intended to simulate the metamathematical provability predicate “⊢” of classical logic. We demonstrate via examples how BM can be used to write equational proofs of first order classical theorems, and show that this ability hinges on a “conservation result”: BM proves A ▹ B for classical A and B iff A ⊢ B holds classically. We introduce appropriate Kripke semantics with respect to which we prove BM is sound and complete. As a corollary we prove the above mentioned conservation result.

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.001
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: Theoretical or conceptual
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.864
Threshold uncertainty score0.797

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
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.041
GPT teacher head0.264
Teacher spread0.224 · 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