{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001364634,0.0007362731,0.0006156623,0.001632566,0.002129018,0.006462173,0.001347339,0.001351746,0.01690562],"category_scores_gemma":[0.005041806,0.0007246413,0.001073746,0.001757481,0.007272355,0.01001661,0.002382577,0.005710397,0.005422459],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004725527,"about_ca_system_score_gemma":0.002473824,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001610751,"about_ca_topic_score_gemma":0.001088625,"domain_scores_codex":[0.9984893,0.0003395632,0.00009675971,0.0002032201,0.0007383002,0.0001328421],"domain_scores_gemma":[0.9969594,0.002019156,0.0001379334,0.0003521187,0.0004272433,0.0001040583],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000001896556,0.000003215189,0.00002138903,0.00005540753,0.000002918011,0.00001410594,0.00009429742,0.0002540353,0.00006138901,0.9843196,0.007083924,0.00808787],"study_design_scores_gemma":[0.00000298897,0.0000028356,0.00005649128,0.00006927386,0.000002632175,0.00004734923,0.00003383881,0.0006391882,0.00008158128,0.9085442,0.0905154,0.000004195631],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.002915615,0.03422488,0.1866932,0.01828197,0.001449306,0.00009971821,0.0004544969,0.0007176135,0.7551631],"genre_scores_gemma":[0.3268569,0.0817169,0.210242,0.01014564,0.008078014,0.0009561797,0.002062943,0.001123156,0.3588184],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.01690562,"threshold_uncertainty_score":0.05655497,"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."}}