MétaCan
Menu
Back to cohort
Record W2008731436 · doi:10.2178/jsl/1230396765

Examining Fragments of the Quantified Propositional Calculus

2008· article· en· W2008731436 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

VenueJournal of Symbolic Logic · 2008
Typearticle
Languageen
FieldComputer Science
TopicLogic, Reasoning, and Knowledge
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsMathematicsAxiomMathematical proofHierarchyCalculus (dental)Propositional calculusPropositional variableProof complexityConnection (principal bundle)Propositional formulaAlgebra over a fieldDiscrete mathematicsPure mathematicsComputer scienceIntermediate logicTheoretical computer science

Abstract

fetched live from OpenAlex

Abstract When restricted to proving formulas, the quantified propositional proof system is closely related to the theorems of Buss's theory . Namely, has polynomial-size proofs of the translations of theorems of , and proves that is sound. However, little is known about when proving more complex formulas. In this paper, we prove a witnessing theorem for similar in style to the KPT witnessing theorem for . This witnessing theorem is then used to show that proves is sound with respect to formulas. Note that unless the polynomial-time hierarchy collapses is the weakest theory in the S 2 hierarchy for which this is true. The witnessing theorem is also used to show that is p -equivalent to a quantified version of extended-Frege for prenex formulas. This is followed by a proof that G i , p -simulates with respect to all quantified propositional formulas. We finish by proving that S 2 can be axiomatized by plus axioms stating that the cut-free version of is sound. All together this shows that the connection between and does not extend to more complex formulas.

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: Observational · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.725
Threshold uncertainty score0.253

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.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
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.054
GPT teacher head0.250
Teacher spread0.196 · 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