{"id":"W1537230380","doi":"10.1017/cbo9780511676277","title":"Logical Foundations of Proof Complexity","year":2010,"lang":"en","type":"book","venue":"Cambridge University Press eBooks","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":189,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University; University of Toronto","funders":"","keywords":"Proof complexity; Complexity class; Structural proof theory; Soundness; PH; Mathematics; Proof theory; Structural complexity theory; Discrete mathematics; Mathematical proof; Descriptive complexity theory; Propositional calculus; Hierarchy; Polynomial hierarchy; Algebra over a field; Computer science; Time complexity; Quantum complexity theory; Pure mathematics","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001755851,0.0003243858,0.0005117948,0.0001791856,0.0002644224,0.00008329904,0.002207631,0.0005019166,0.000007300041],"category_scores_gemma":[0.00004067023,0.0003339927,0.000286854,0.00003721313,0.000724103,0.0001869656,0.001313882,0.0007594887,0.00002086154],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001736285,"about_ca_system_score_gemma":0.0006530833,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006575368,"about_ca_topic_score_gemma":0.00001747755,"domain_scores_codex":[0.9983562,0.0001031633,0.000241662,0.0006345274,0.0003328174,0.0003315905],"domain_scores_gemma":[0.9978165,0.0001428507,0.0003675361,0.00106813,0.0004027987,0.0002021974],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0000112313,0.00004840144,0.000004250589,0.00007598004,0.00005017993,0.00005400422,0.00009654539,6.96886e-7,0.00004615833,0.947571,0.05095238,0.001089216],"study_design_scores_gemma":[0.0004774602,0.0001023118,0.0001340044,0.00007159143,0.00007878039,0.0000238112,0.000007350363,0.0009276844,0.0006474653,0.0008919791,0.996203,0.0004345551],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.00006281152,0.00004918371,0.06228048,0.00001927746,0.000474805,0.0004009685,0.00008591628,0.0001787738,0.9364478],"genre_scores_gemma":[0.002438207,0.000009239207,0.003810888,0.00002819504,0.0001529823,0.000001220983,0.00005952954,0.00001583835,0.9934839],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.946679,"threshold_uncertainty_score":0.9999112,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04752521863913661,"score_gpt":0.2337792296146979,"score_spread":0.1862540109755613,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}