{"id":"W2345246322","doi":"10.18778/0138-0680.44.3.4.03","title":"A Short and Readable Proof of Cut Elimination for Two First-Order Modal Logics","year":2015,"lang":"en","type":"article","venue":"Bulletin of the Section of Logic","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical proof; Modal logic; Mathematics; Proof theory; Modal; Normal modal logic; Structural proof theory; Extension (predicate logic); Calculus (dental); Algebra over a field; Discrete mathematics; Proof complexity; Order (exchange); Pure mathematics; Computer science; Programming language","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002545292,0.003466158,0.00128346,0.003047955,0.00214266,0.002783776,0.002421675,0.002325771,0.02994153],"category_scores_gemma":[0.008159937,0.001367108,0.00331131,0.002760492,0.002915176,0.005748346,0.005235672,0.01130871,0.00875188],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002958783,"about_ca_system_score_gemma":0.001535268,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002179802,"about_ca_topic_score_gemma":0.002860168,"domain_scores_codex":[0.9976011,0.0004280204,0.0001412573,0.0003524163,0.001272164,0.000205129],"domain_scores_gemma":[0.9960491,0.002390333,0.000206598,0.0003357638,0.0008559274,0.0001622505],"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.0001761323,0.0003341707,0.00040233,0.002029953,0.0001894004,0.001616189,0.000821194,0.004799104,0.01404683,0.6653033,0.1223847,0.1878967],"study_design_scores_gemma":[0.0001186406,0.0001227223,0.001093653,0.0004110191,0.0001161073,0.0008098952,0.00008147077,0.006972271,0.006891816,0.7943127,0.1889314,0.0001382938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003147531,0.01054434,0.9065759,0.008149386,0.00553025,0.000520966,0.001962538,0.003525193,0.06004397],"genre_scores_gemma":[0.1422051,0.009800372,0.7536458,0.01526333,0.007141072,0.002277366,0.003635055,0.002373217,0.06365861],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02994153,"threshold_uncertainty_score":0.1001644,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03953101584587338,"score_gpt":0.2636362021293309,"score_spread":0.2241051862834575,"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."}}