{"id":"W2095441824","doi":"10.1007/s11225-010-9294-y","title":"On the Proof-Theory of two Formalisations of Modal First-Order Logic","year":2010,"lang":"en","type":"article","venue":"Studia Logica","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"York University","funders":"","keywords":"Sequent; Sequent calculus; Mathematical proof; Cut-elimination theorem; Normal modal logic; Modal logic; Proof theory; Calculus (dental); Mathematics; Proof calculus; Modal; Natural deduction; Predicate logic; Structural proof theory; Dynamic logic (digital electronics); Predicate (mathematical logic); Discrete mathematics; Algebra over a field; Computer science; Pure mathematics; Programming language; Description logic","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.0003747268,0.0001129392,0.0001686492,0.0000443496,0.0001988095,0.00001234102,0.0007470601,0.00004202154,0.0001033116],"category_scores_gemma":[0.0003252776,0.00006144882,0.00007108658,0.000343139,0.0002138448,0.0001311503,0.0002327555,0.000195891,0.00001529293],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006278495,"about_ca_system_score_gemma":0.00004356485,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003767613,"about_ca_topic_score_gemma":0.00002949948,"domain_scores_codex":[0.9991165,0.00006374408,0.0002144793,0.0002102335,0.0002000003,0.0001950659],"domain_scores_gemma":[0.9984867,0.0006509419,0.0001552766,0.0005486913,0.0001261202,0.00003224342],"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.000006325055,0.0001139872,0.000158191,0.000004866707,0.00001218376,0.000001144957,0.0005940538,0.0004081191,0.0006660335,0.9961377,0.0001046885,0.001792696],"study_design_scores_gemma":[0.0002530524,0.0002605705,0.003312004,0.000006388367,0.00000701734,0.000002847783,0.00008534313,0.0009784477,0.002070172,0.9924185,0.0005049823,0.0001006319],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2143905,0.0001140315,0.7103682,0.003562497,0.0005435132,0.0007331757,0.000009639626,0.00009963352,0.07017879],"genre_scores_gemma":[0.9854467,0.000005266126,0.01402186,0.0003607696,0.00003310674,0.00004447281,6.816848e-7,0.000003791328,0.00008336062],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7710562,"threshold_uncertainty_score":0.250581,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02698497281611857,"score_gpt":0.2651746369767692,"score_spread":0.2381896641606506,"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."}}