{"id":"W3043920080","doi":"10.1017/s1755020320000180","title":"CUT-FREE COMPLETENESS FOR MODULAR HYPERSEQUENT CALCULI FOR MODAL LOGICS K, T, AND D","year":2020,"lang":"en","type":"article","venue":"The Review of Symbolic Logic","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Modal; Completeness (order theory); Mathematical proof; Accessibility relation; Interpretation (philosophy); Normal modal logic; Modular design; Mathematics; Algebra over a field; Relation (database); Calculus (dental); Pure mathematics; Modal logic; Computer science; Discrete mathematics; Mathematical analysis; Data mining; Geometry; Programming language","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":[],"consensus_categories":[],"category_scores_codex":[0.0008023762,0.0001914995,0.000618481,0.00001923847,0.00014136,0.00004721431,0.001365051,0.00005767626,0.000003933817],"category_scores_gemma":[0.0003043803,0.0001090034,0.0002214649,0.0002123287,0.0001263298,0.00009300892,0.0003462207,0.00007586338,0.000006973634],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000177435,"about_ca_system_score_gemma":0.00004880331,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002154049,"about_ca_topic_score_gemma":0.000001568594,"domain_scores_codex":[0.998586,0.0001101076,0.0004306732,0.0003700323,0.0002047775,0.0002983894],"domain_scores_gemma":[0.998616,0.000179909,0.0002401676,0.0006885828,0.0001659606,0.000109323],"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.000008044585,0.00003436063,0.00002070217,0.007507795,0.00004754638,0.000002133042,0.0003881896,0.00002347639,0.0002537909,0.9695019,0.001393604,0.02081849],"study_design_scores_gemma":[0.002532613,0.001693074,0.0002617643,0.0008028841,0.0003565864,0.0001464651,0.0001947929,0.06976685,0.0006717339,0.5309229,0.3917128,0.0009375284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0005301028,0.0979133,0.8810802,0.01626373,0.0002566143,0.003102761,0.00002014414,0.0001154804,0.0007177417],"genre_scores_gemma":[0.9494339,0.01752145,0.02037106,0.01156887,0.0004297492,0.0005669445,0.00002036738,0.000028669,0.0000590432],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9489037,"threshold_uncertainty_score":0.4445029,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08285298046001914,"score_gpt":0.2929221384889657,"score_spread":0.2100691580289465,"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."}}