{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005493248,0.0004015495,0.0008709631,0.0021588,0.001829477,0.003593203,0.001602193,0.001515345,0.002744765],"category_scores_gemma":[0.0094183,0.0007117182,0.002680061,0.0019427,0.006376022,0.005989365,0.004071269,0.00374987,0.0004583974],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003000298,"about_ca_system_score_gemma":0.002257779,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002878674,"about_ca_topic_score_gemma":0.002156898,"domain_scores_codex":[0.9974367,0.0007011932,0.0001894362,0.0004739265,0.0009533771,0.000245421],"domain_scores_gemma":[0.990872,0.006277879,0.0003824449,0.001050256,0.001094577,0.000322773],"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.00001523171,0.00001473086,0.000181753,0.00007109062,0.00001861132,0.00006049548,0.000205944,0.002112672,0.0006702732,0.9893686,0.0004826414,0.006798024],"study_design_scores_gemma":[0.00001943034,0.000008902708,0.0001276475,0.00002485809,0.00001048545,0.00005973295,0.00003662188,0.01966252,0.001245714,0.9765316,0.002257519,0.00001498594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1034048,0.002517196,0.8678528,0.002771427,0.0001224074,0.0001349443,0.0002476867,0.0004966618,0.02245201],"genre_scores_gemma":[0.7341335,0.001193962,0.2577682,0.0007467187,0.0001583099,0.0002679356,0.0003095283,0.0001353421,0.005286544],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005493248,"threshold_uncertainty_score":0.02905142,"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."}}