{"id":"W2036428616","doi":"10.1016/j.entcs.2004.06.049","title":"A Language For Multiplicative-additive Linear Logic","year":2005,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Linear logic; Decidability; Modulo; Equivalence (formal languages); Concurrency; Rewriting; Mathematical proof; Mathematics; Multiplicative function; Curry–Howard correspondence; Term (time); Distributive property; Algebra over a field; Calculus (dental); Programming language; Discrete mathematics; Computer science; Natural deduction; 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.002086822,0.0008966638,0.0008434216,0.001965098,0.002197459,0.004948479,0.002291449,0.001256267,0.0102785],"category_scores_gemma":[0.002627345,0.0009021049,0.002183759,0.001992092,0.002870701,0.006805488,0.003044938,0.005251815,0.003955312],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001606258,"about_ca_system_score_gemma":0.001788515,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000956823,"about_ca_topic_score_gemma":0.001096409,"domain_scores_codex":[0.9982303,0.0004339734,0.0002373331,0.000290546,0.0006028469,0.00020508],"domain_scores_gemma":[0.9985642,0.0006659598,0.0001349103,0.0001869314,0.0003196045,0.0001284094],"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.00001063709,0.00001971919,0.00004440553,0.00008915886,0.000007505455,0.0001144574,0.0003036724,0.0004193711,0.001936032,0.9866372,0.002082762,0.008335094],"study_design_scores_gemma":[0.00002272131,0.00004953061,0.000103022,0.0000714488,0.00003908967,0.0006774074,0.000123154,0.008593436,0.003254087,0.8642916,0.1227351,0.00003934868],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004844846,0.001331643,0.9612084,0.001810839,0.000699513,0.0002167962,0.0005991068,0.001721446,0.02756744],"genre_scores_gemma":[0.2121425,0.002342664,0.7331947,0.002408411,0.001691355,0.00109632,0.001374687,0.0009885444,0.04476083],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0102785,"threshold_uncertainty_score":0.03438497,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01140642540156746,"score_gpt":0.2828745985792736,"score_spread":0.2714681731777062,"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."}}