MétaCan
Menu
Back to cohort
Record W2012135231 · doi:10.1093/jigpal/jzi021

The Complexity of Propositional Proofs with the Substitution Rule

2005· article· en· W2012135231 on OpenAlexaffabout
Alasdair Urquhart

Bibliographic record

VenueLogic Journal of IGPL · 2005
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Algebra and Logic
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsMathematical proofSubstitution (logic)Propositional calculusComputer scienceMathematical economicsMathematicsProgramming language

Abstract

fetched live from OpenAlex

We prove that for sufficiently large N, there are tautologies of size O(N) that require proofs containing Ω(N) lines in axiomatic systems of propositional logic based on axioms and the rule of substitution for single variables. These tautologies have proofs with O(log2N) lines in systems with the multiple substitution rule.

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.008
metaresearch head score (Gemma)0.092
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.022
Threshold uncertainty score0.073

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0080.092
Meta-epidemiology (narrow)0.0010.002
Meta-epidemiology (broad)0.0020.004
Bibliometrics0.0030.005
Science and technology studies0.0030.005
Scholarly communication0.0130.033
Open science0.0040.008
Research integrity0.0030.006
Insufficient payload (model declined to judge)0.0220.003

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.029
GPT teacher head0.250
Teacher spread0.222 · 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

Citations2
Published2005
Admission routes2
Has abstractyes

Explore more

Same venueLogic Journal of IGPLSame topicAdvanced Algebra and LogicFrench-language works237,207