{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":30,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":30,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"49dbef81ff3f","filters":{"venue":"Studia Logica"}},"results":[{"id":"W1511767298","doi":"10.1023/a:1026761331498","title":"Ability and Knowing How in the Situation Calculus","year":2000,"lang":"en","type":"article","venue":"Studia Logica","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; York University","funders":"","keywords":"Executable; Computer science; Plan (archaeology); Frame (networking); Artificial intelligence; Programming language; Software engineering","authors":[{"name":"Yves Lespérance","is_ca":true},{"name":"Hector J. Levesque","is_ca":true},{"name":"Fangzhen Lin","is_ca":false},{"name":"Richard B. Scherl","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02141528186502651,"gpt":0.2447857400587642,"spread":0.2233704581937377,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000556235,0.00008510598,0.0001095618,0.00002109926,0.0001664396,0.0001217811,0.0003619543,0.00003822634,0.00002512373],"category_scores_gemma":[0.00009976434,0.00004945413,0.00002996083,0.0002653062,0.00005909933,0.0001747795,0.00008824633,0.0001031444,0.00003532463],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002301578,"about_ca_system_score_gemma":0.00002344468,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000280153,"about_ca_topic_score_gemma":0.00009289142,"domain_scores_codex":[0.9991608,0.0001554273,0.00008769003,0.0002762441,0.0001319048,0.000187926],"domain_scores_gemma":[0.9994861,0.0001680979,0.0000216572,0.0002712375,0.0000235402,0.00002931968],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.0000145736,0.0004494778,0.03907232,0.00002431235,0.00002293789,0.00006925748,0.04366672,0.00004702349,0.0002505078,0.1961257,0.002769658,0.7174875],"study_design_scores_gemma":[0.0005792914,0.0001871528,0.9497229,0.00001191164,0.000008346117,0.00001730133,0.0005636452,0.004593274,0.00004190948,0.01962663,0.02440249,0.000245156],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7841108,0.00143707,0.01035339,0.005647963,0.0001688711,0.0004345178,8.541193e-7,0.0001214711,0.1977251],"genre_scores_gemma":[0.9987251,0.00007520053,0.0006913873,0.0002370799,0.00005396475,0.00001990102,5.062366e-7,0.000001612142,0.0001952659],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9106506,"threshold_uncertainty_score":0.2016681,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1592170291","doi":"10.1023/a:1010503321412","title":"Plausible Reasoning and the Resolution of Quantifier Scope Ambiguities","year":2001,"lang":"en","type":"article","venue":"Studia Logica","topic":"Categorization, perception, and language","field":"Psychology","cited_by":53,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Windsor","funders":"","keywords":"Scope (computer science); Commonsense reasoning; Computer science; Commonsense knowledge; Quantifier (linguistics); Computational linguistics; Simple (philosophy); Preference; Artificial intelligence; Phenomenon; Epistemology; Knowledge representation and reasoning; Mathematics; Programming language; Philosophy","authors":[{"name":"Walid S. Saba","is_ca":true},{"name":"Jean‐Pierre Corriveau","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03145428239249323,"gpt":0.3095952774193292,"spread":0.278140995026836,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004026108,0.00007871079,0.0001549032,0.0000415848,0.0001964043,0.0000177643,0.0000788468,0.00005669038,0.00165832],"category_scores_gemma":[0.00007288178,0.00005025147,0.00003576467,0.0001703715,0.0002944178,0.00004210253,0.00003479542,0.00007031328,0.00004554866],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009765477,"about_ca_system_score_gemma":0.00001449497,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001140164,"about_ca_topic_score_gemma":0.0004658925,"domain_scores_codex":[0.9992669,0.0001421394,0.0001721308,0.0001691546,0.00009971901,0.0001499208],"domain_scores_gemma":[0.999578,0.0001003623,0.00007783475,0.0001698455,0.00005303268,0.00002095469],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.0006715559,0.0001553789,0.06195803,0.00002106963,0.0001265531,0.00001113949,0.04054866,0.00002728268,0.0006369511,0.874562,0.01794428,0.003337132],"study_design_scores_gemma":[0.002656647,0.0001651769,0.9328102,0.00003287253,0.00008121478,0.00005022428,0.02236831,0.00004490459,0.00003359421,0.002898818,0.03865918,0.0001988073],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7582026,0.003830609,0.0007279057,0.0003432979,0.0003097991,0.0002335549,0.000006655951,0.00004594813,0.2362997],"genre_scores_gemma":[0.9926768,0.0009072145,0.0001026519,0.0001152918,0.0001538518,0.00002444909,0.000009811275,0.00000710472,0.006002854],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8716632,"threshold_uncertainty_score":0.9992543,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2031927644","doi":"10.1007/s11225-006-6610-7","title":"The Epsilon Calculus and Herbrand Complexity","year":2006,"lang":"en","type":"article","venue":"Studia Logica","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Sequent calculus; Mathematics; Calculus (dental); Natural deduction; Cut-elimination theorem; Operator (biology); Discrete mathematics; Algebra over a field; Pure mathematics; Proof calculus; Mathematical proof","authors":[{"name":"Georg Moser","is_ca":false},{"name":"Richard Zach","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03679857917696052,"gpt":0.2540852957107809,"spread":0.2172867165338204,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000345824,0.0001107702,0.0001438582,0.00001451015,0.0005858126,0.000243093,0.0004033566,0.00003991053,0.00000348017],"category_scores_gemma":[0.00002112194,0.00006052747,0.00004109022,0.000156344,0.0002045184,0.00008149619,0.0002425886,0.00008271155,0.00004293905],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001596427,"about_ca_system_score_gemma":0.0000192888,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003932781,"about_ca_topic_score_gemma":0.000415473,"domain_scores_codex":[0.9990271,0.00008515724,0.0001595606,0.0002739595,0.0001746325,0.0002796437],"domain_scores_gemma":[0.9994204,0.0001127536,0.00006362917,0.0003145262,0.00004256967,0.00004611246],"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.00000277391,0.00003278343,0.003270901,0.000004827153,0.000009661326,0.00001210489,0.0001407253,0.0000019611,0.00002147333,0.9861284,0.002674864,0.007699491],"study_design_scores_gemma":[0.0008000223,0.000275911,0.1527718,0.0000027111,0.00001212801,0.00004983806,0.0001468579,0.0012843,0.00008622347,0.4246717,0.4195467,0.0003517635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.04688468,0.01675142,0.4290733,0.00780057,0.002469783,0.001537977,0.000003092296,0.0009381126,0.4945411],"genre_scores_gemma":[0.997824,0.00003811323,0.001217546,0.00009546053,0.00009765064,0.00001957008,8.659405e-7,0.000003405739,0.0007033516],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9509394,"threshold_uncertainty_score":0.4505656,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1964472717","doi":"10.1007/s11225-005-2805-6","title":"Representations of monadic MV -algebras","year":2005,"lang":"en","type":"article","venue":"Studia Logica","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Subalgebra; Mathematics; Finitely-generated abelian group; Algebra over a field; Pure mathematics; Characterization (materials science); Discrete mathematics; Physics","authors":[{"name":"L. P. Belluce","is_ca":true},{"name":"Revaz Grigolia","is_ca":false},{"name":"Ada Lettieri","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0224064972674812,"gpt":0.2806372452550117,"spread":0.2582307479875305,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000900188,0.00008944515,0.0001456822,0.00005645369,0.0001070971,0.00001702781,0.000518484,0.00003129128,0.00007003408],"category_scores_gemma":[0.00006738936,0.00007068959,0.00006033311,0.0003671106,0.00007218263,0.0002471068,0.00020775,0.00007702786,0.0001262153],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001738227,"about_ca_system_score_gemma":0.00003551914,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007251322,"about_ca_topic_score_gemma":0.00001311284,"domain_scores_codex":[0.9991177,0.00003587085,0.0001979005,0.0002767184,0.0001743379,0.0001974439],"domain_scores_gemma":[0.9992704,0.00009990958,0.00008518931,0.0004285069,0.00005697717,0.00005899418],"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.000002733573,0.0001388733,0.002210591,0.000004662068,0.00001847045,0.00001040802,0.0007367485,0.0006427734,0.0008478049,0.957705,0.001838832,0.03584317],"study_design_scores_gemma":[0.001706017,0.0006342376,0.3258326,0.00002407112,0.00004269197,0.0000485257,0.0006056521,0.003655215,0.009329366,0.5824766,0.07472108,0.0009239003],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1475683,0.002638087,0.5622276,0.008349626,0.0004934638,0.0005419576,0.000008096589,0.0005367156,0.2776362],"genre_scores_gemma":[0.9536628,0.00004810025,0.04545415,0.0003577976,0.00007588112,0.00001650076,0.000001126656,0.000003338018,0.00038033],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8060945,"threshold_uncertainty_score":0.2882638,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1560057404","doi":"10.1023/a:1020564714107","title":"A Tale of Four Grammars","year":2002,"lang":"en","type":"article","venue":"Studia Logica","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Categorial grammar; Computational linguistics; Calculus (dental); Mathematics; Computer science; Combinatory categorial grammar; Linguistics; Rule-based machine translation; Algebra over a field; Programming language; Artificial intelligence; Pure mathematics; Generative grammar; Philosophy; Phrase structure rules; Tree-adjoining grammar; Mildly context-sensitive grammar formalism","authors":[{"name":"Claudia Casadio","is_ca":false},{"name":"Joachim Lambek","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05057923601685719,"gpt":0.2429902019303369,"spread":0.1924109659134797,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001872043,0.0001054222,0.0002025217,0.00004597268,0.0000868462,0.00004313864,0.0005831604,0.00005011715,0.00006656303],"category_scores_gemma":[0.00004761786,0.000076494,0.00008712002,0.0003174361,0.00006471499,0.0001063448,0.0002057619,0.00007100809,0.0002356296],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001323151,"about_ca_system_score_gemma":0.00001117156,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003776867,"about_ca_topic_score_gemma":0.00001182857,"domain_scores_codex":[0.9990048,0.00005394846,0.0001995476,0.0002651258,0.0002222414,0.0002543379],"domain_scores_gemma":[0.9993147,0.0000525633,0.0001064297,0.000402846,0.00006338551,0.00006009514],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000001947173,0.0002330005,0.005208686,0.00002820542,0.00004955423,0.00007036745,0.001488846,0.000006849184,0.0001734103,0.931614,0.009392315,0.05173279],"study_design_scores_gemma":[0.002706645,0.002499078,0.02807372,0.00001954983,0.00005772879,0.0001998767,0.0006171583,0.004987746,0.001013587,0.2886423,0.6697616,0.00142102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.01150613,0.003970752,0.4776364,0.001479026,0.001976664,0.0009176317,0.000002384782,0.0006862307,0.5018248],"genre_scores_gemma":[0.9942443,0.00004690675,0.004276336,0.00008623461,0.00006784037,0.00002039849,3.363153e-7,0.000004206855,0.001253469],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9827381,"threshold_uncertainty_score":0.3119335,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1495228235","doi":"10.1023/a:1020572931854","title":"Correspondence Results for Relational Proof Systems with Application to the Lambek Calculus","year":2002,"lang":"en","type":"article","venue":"Studia Logica","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Semantics (computer science); Computer science; Proof theory; Computational linguistics; Kripke semantics; Calculus (dental); Relational calculus; Relational theory; Algebra over a field; Mathematics; Programming language; Theoretical computer science; Relational database; Natural language processing; Relational model; Description logic; Pure mathematics; Mathematical proof; Information retrieval; Multimodal logic","authors":[{"name":"Wendy MacCaull","is_ca":true},{"name":"Ewa Orłlowska","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04126314672621861,"gpt":0.2548344349039577,"spread":0.2135712881777391,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005909194,0.0001269402,0.0001490579,0.00003897996,0.0003402667,0.0001277934,0.0005942817,0.0000518601,0.000002287613],"category_scores_gemma":[0.0001272933,0.00006858861,0.00003765199,0.0004472625,0.00004362071,0.0001203512,0.0001071095,0.00008259735,0.0002273735],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004704276,"about_ca_system_score_gemma":0.00003302451,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004075169,"about_ca_topic_score_gemma":0.00005379829,"domain_scores_codex":[0.9986075,0.00008258221,0.0002463631,0.0004490622,0.0003469823,0.0002674707],"domain_scores_gemma":[0.9987987,0.0002505642,0.000146797,0.0005321486,0.0001999192,0.00007191257],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00007266858,0.0001025755,0.0003531754,0.00002103324,0.00003078803,0.000006033716,0.002353562,0.002204119,0.00001969757,0.9552768,0.02993131,0.009628207],"study_design_scores_gemma":[0.001024424,0.001073097,0.003440932,0.00001258023,0.00001836419,0.00004989491,0.0002696874,0.08239961,0.00003653297,0.002702389,0.9086257,0.0003467646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0001750756,0.0003998434,0.973522,0.002632251,0.0003632858,0.002051742,0.000006271538,0.0001290766,0.02072045],"genre_scores_gemma":[0.9908687,0.000003789832,0.003391202,0.0001752512,0.0002022366,0.001081217,0.000005240156,0.000006319048,0.004266022],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9906936,"threshold_uncertainty_score":0.2922503,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2120203109","doi":"10.1023/a:1026744827863","title":"A Set Theory with Support for Partial Functions","year":2000,"lang":"en","type":"article","venue":"Studia Logica","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Computational linguistics; Mathematics; Linguistics; Philosophy","authors":[{"name":"William M. Farmer","is_ca":true},{"name":"Joshua D. Guttman","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03266808631290268,"gpt":0.2589154110501019,"spread":0.2262473247371992,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003454202,0.0001210061,0.0001600314,0.00002537405,0.0002665677,0.00009192157,0.0003364263,0.0000454542,0.0003174551],"category_scores_gemma":[0.00001514675,0.00007545255,0.00006740654,0.0001906913,0.00006650278,0.0001273784,0.0000474596,0.00006317673,0.0003601147],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001446834,"about_ca_system_score_gemma":0.00007523828,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001069492,"about_ca_topic_score_gemma":0.00001701826,"domain_scores_codex":[0.9989923,0.00006085422,0.0001412172,0.0003412777,0.0001485122,0.0003158257],"domain_scores_gemma":[0.9993916,0.00008966162,0.00004506599,0.0003469067,0.00005313552,0.00007361099],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00009361216,0.0001486946,0.001478088,0.00001525494,0.0001057551,0.00003092354,0.00216408,0.00004409176,0.00001097288,0.9128996,0.01443071,0.06857828],"study_design_scores_gemma":[0.0008375739,0.00150875,0.001714181,0.000001781363,0.00003206329,0.00004338247,0.0003052198,0.0001853294,0.00004272288,0.03644136,0.9586132,0.0002744982],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002967567,0.0001356038,0.837765,0.0004468295,0.0004858696,0.0008146385,0.000007803194,0.0004296033,0.1569471],"genre_scores_gemma":[0.9886197,0.000006517583,0.001763056,0.0002597417,0.0001894034,0.0002448371,0.000008412341,0.000006744574,0.008901576],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9856521,"threshold_uncertainty_score":0.4628667,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2034981868","doi":"10.1007/s11225-014-9564-1","title":"Gentzen and Jaśkowski Natural Deduction: Fundamentally Similar but Importantly Different","year":2014,"lang":"en","type":"article","venue":"Studia Logica","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Natural deduction; Normalization (sociology); Mathematics; Sequent calculus; Epistemology; Calculus (dental); Semantics (computer science); Meaning (existential); Linguistics; Philosophy; Algebra over a field; Discrete mathematics; Computer science; Pure mathematics; Programming language; Sociology","authors":[{"name":"Allen Hazen","is_ca":true},{"name":"Francis Jeffry Pelletier","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01875987037559582,"gpt":0.235310530650576,"spread":0.2165506602749802,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002493958,0.0002179688,0.0002778674,0.00004836494,0.000293226,0.000220634,0.0004527221,0.00006771255,0.00002194039],"category_scores_gemma":[0.00003464344,0.0001473254,0.00007759784,0.0001375676,0.00009730302,0.000173712,0.0003820989,0.000150625,0.00004717488],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003936553,"about_ca_system_score_gemma":0.0000226487,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003453776,"about_ca_topic_score_gemma":0.0000366641,"domain_scores_codex":[0.9984723,0.00009712432,0.000254486,0.0005203194,0.0002870919,0.0003687232],"domain_scores_gemma":[0.9992344,0.00005903196,0.0001243201,0.0003978215,0.00005403221,0.0001303621],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00002344405,0.0003623178,0.04864333,0.00007614194,0.0002108254,0.00006732275,0.001954783,0.000004848755,0.00191804,0.8704874,0.005075292,0.07117625],"study_design_scores_gemma":[0.003813625,0.002786487,0.4469827,0.00002616148,0.0001362902,0.0005382152,0.001569897,0.003703604,0.001963785,0.1545049,0.3816086,0.002365683],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7133363,0.009542588,0.1821705,0.005471109,0.01092445,0.001979013,0.000005599617,0.001435901,0.07513452],"genre_scores_gemma":[0.997358,0.00008149506,0.001229567,0.0003437691,0.0003215202,0.00003092773,0.00000391712,0.000008085819,0.0006227627],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7159825,"threshold_uncertainty_score":0.6007757,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2013296559","doi":"10.1007/s11225-011-9349-8","title":"Discrete Dualities for Double Stone Algebras","year":2011,"lang":"en","type":"article","venue":"Studia Logica","topic":"Rings, Modules, and Algebras","field":"Mathematics","cited_by":19,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Brock University","funders":"","keywords":"Class (philosophy); Algebra over a field; Mathematics; Pure mathematics; Computer science; Artificial intelligence","authors":[{"name":"Ivo Düntsch","is_ca":true},{"name":"Ewa Orłowska","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1431534309419472,"gpt":0.3225991252995613,"spread":0.1794456943576141,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003159893,0.0002092884,0.000355633,0.0000472726,0.0002245146,0.00002968718,0.0002411613,0.00007858416,0.0003598873],"category_scores_gemma":[0.0001401327,0.0001557174,0.0001499488,0.00008092939,0.0001366896,0.0001138984,0.0001202858,0.00009741329,0.00008704544],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002365811,"about_ca_system_score_gemma":0.00003157198,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004928411,"about_ca_topic_score_gemma":0.00005719936,"domain_scores_codex":[0.9987725,0.00002888114,0.000301611,0.0003148862,0.0001782612,0.0004038588],"domain_scores_gemma":[0.9991421,0.0002115234,0.0001244173,0.00036364,0.00007729859,0.00008106979],"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.0000963415,0.000154595,0.0005389049,0.0000924913,0.000109546,0.000006078082,0.004971729,1.056158e-7,0.00009019949,0.9796243,0.01402942,0.0002863259],"study_design_scores_gemma":[0.001397678,0.0002852362,0.00331176,0.00003192577,0.00009775767,0.000005270112,0.002684436,0.000002516273,0.003738448,0.9739308,0.01413671,0.0003774512],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7407462,0.0005927638,0.005257761,0.0004614116,0.000702967,0.001347926,0.00005982643,0.0004593972,0.2503718],"genre_scores_gemma":[0.9763028,0.0000543809,0.01686451,0.0001570166,0.0002850789,0.0002333613,0.00000789269,0.00003871488,0.006056269],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2443155,"threshold_uncertainty_score":0.6349972,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2049702075","doi":"10.1007/s11225-008-9100-2","title":"Resource-origins of Nonmonotonicity","year":2008,"lang":"en","type":"article","venue":"Studia Logica","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Defeasible estate; Computer science; Inference; Context (archaeology); Non-monotonic logic; Theoretical computer science; Deductive reasoning; Artificial intelligence; Resource (disambiguation); Cognitive science","authors":[{"name":"Dov M. Gabbay","is_ca":false},{"name":"John Woods","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03141366693341228,"gpt":0.2426115909630099,"spread":0.2111979240295977,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002003547,0.0001349958,0.0002637492,0.00005560858,0.0002226053,0.00001447259,0.0008178767,0.0000640888,0.00003137428],"category_scores_gemma":[0.00009320719,0.00009978775,0.0001099214,0.0003709454,0.0001579551,0.0001086505,0.0003820914,0.0001253622,0.0001354556],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006459748,"about_ca_system_score_gemma":0.0001037657,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004617057,"about_ca_topic_score_gemma":0.00001136052,"domain_scores_codex":[0.9988591,0.00006621506,0.0002088098,0.0003486115,0.000223343,0.0002938879],"domain_scores_gemma":[0.9990834,0.0001218186,0.0001072486,0.0005201874,0.00008186763,0.00008548904],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001682969,0.0005287162,0.03831613,0.00001749914,0.0000647459,0.0001348347,0.005932651,0.00004135384,0.0005427844,0.9368741,0.0125547,0.004975664],"study_design_scores_gemma":[0.001384256,0.0008920002,0.3231682,0.00002691801,0.00002251347,0.0001186075,0.0001718105,0.001303924,0.005436583,0.009703919,0.6570536,0.0007176564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.3758178,0.0009644335,0.03652551,0.0003904249,0.0003721656,0.0002777451,0.00000382856,0.0002993854,0.5853487],"genre_scores_gemma":[0.9932308,0.0001159682,0.005912983,0.000139228,0.0000846857,0.00001134721,7.705365e-7,0.000004654285,0.0004995983],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9271702,"threshold_uncertainty_score":0.4069226,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2140743943","doi":"10.1007/s11225-012-9395-x","title":"Actuality in Propositional Modal Logic","year":2012,"lang":"en","type":"article","venue":"Studia Logica","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Modal logic; Normal modal logic; Zeroth-order logic; Propositional variable; Modal μ-calculus; Intermediate logic; Kripke semantics; Mathematics; Modal; Operator (biology); Kripke structure; S5; Well-formed formula; Intuitionistic logic; Dynamic logic (digital electronics); Accessibility relation; Mathematical proof; Calculus (dental); Multimodal logic; Discrete mathematics; Propositional calculus; Computer science; Algorithm; Model checking; Theoretical computer science; Description logic; Physics","authors":[{"name":"Allen Hazen","is_ca":true},{"name":"Benjamin Rin","is_ca":false},{"name":"Kai F. Wehmeier","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03603683727267915,"gpt":0.2830724367028787,"spread":0.2470355994301995,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005125205,0.0001457703,0.0001912366,0.00005813535,0.0001367838,0.00004946201,0.00052739,0.00007861669,0.0000956018],"category_scores_gemma":[0.0001048382,0.0001031147,0.0000657596,0.0003201257,0.00007438779,0.0003792173,0.0003797019,0.0001656811,0.0003865603],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008209157,"about_ca_system_score_gemma":0.00006985756,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001600944,"about_ca_topic_score_gemma":0.00001540484,"domain_scores_codex":[0.9986532,0.0001341781,0.0001845322,0.0003048931,0.0002266584,0.0004965062],"domain_scores_gemma":[0.9993612,0.0001105976,0.00005866274,0.0002956209,0.00005296763,0.0001209953],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.000007286699,0.0006007858,0.06284819,0.000008156733,0.00001329772,0.00001499948,0.002093826,0.000007600382,0.0001332369,0.930357,0.00111677,0.002798877],"study_design_scores_gemma":[0.0005753268,0.0001724992,0.9193905,0.00001074414,0.000006328126,0.00002897673,0.0001118324,0.0003591279,0.00023659,0.07294692,0.005792942,0.0003682056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2781759,0.002756072,0.1069168,0.002764625,0.001899903,0.0008449342,0.000009534797,0.0005816743,0.6060506],"genre_scores_gemma":[0.9920362,0.00001818652,0.007027506,0.0004142502,0.0002288386,0.00004065794,0.000003049208,0.00000376533,0.0002275495],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8574101,"threshold_uncertainty_score":0.496858,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2243033668","doi":"10.1007/s11225-015-9641-0","title":"Congruence Lattices of Semilattices with Operators","year":2015,"lang":"en","type":"article","venue":"Studia Logica","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Semilattice; Mathematics; Congruence lattice problem; Congruence (geometry); Lattice (music); Pure mathematics; Duality (order theory); Distributive lattice; Algebraic number; Algebraic structure; Complete lattice; Discrete mathematics; Combinatorics; Algebra over a field; Distributive property; Mathematical analysis; Physics","authors":[{"name":"Jennifer Hyndman","is_ca":true},{"name":"J. B. Nation","is_ca":false},{"name":"Joy N. Nishida","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03580985468260145,"gpt":0.2692624297092427,"spread":0.2334525750266413,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001800518,0.0001195715,0.0002034514,0.00003584102,0.00006502962,0.00003802506,0.000645956,0.00003133965,0.000008624025],"category_scores_gemma":[0.00006787114,0.00007293294,0.00002237336,0.0003750825,0.0001395752,0.0004032654,0.0002065833,0.00007680723,0.00002923358],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001424578,"about_ca_system_score_gemma":0.0001091427,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001356743,"about_ca_topic_score_gemma":0.00001704731,"domain_scores_codex":[0.9990491,0.00004439097,0.0001518083,0.0002884692,0.0002581625,0.0002081145],"domain_scores_gemma":[0.9991778,0.00009456029,0.0001071921,0.0003385106,0.0001710269,0.0001109216],"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.00006152687,0.0003345347,0.07529037,0.00004575003,0.0001235541,0.0001723842,0.005753142,0.001747499,0.0009473893,0.9059897,0.00159664,0.007937511],"study_design_scores_gemma":[0.01422616,0.01918684,0.3567812,0.0006218711,0.0003280613,0.0003833801,0.01721498,0.009550191,0.03574576,0.4059708,0.1338184,0.006172395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8096556,0.002358505,0.08889605,0.001300029,0.0004805828,0.0004192455,0.000004997683,0.0003425986,0.09654239],"genre_scores_gemma":[0.9676793,0.00002338848,0.03191272,0.0002416143,0.00002676272,0.00001064254,4.377991e-7,0.000003767354,0.0001013486],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5000189,"threshold_uncertainty_score":0.2974119,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1529894088","doi":"10.1023/a:1012495106338","title":"A Kripke Semantics for the Logic of Gelfand Quantales","year":2001,"lang":"en","type":"article","venue":"Studia Logica","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Mathematics; Gödel's completeness theorem; Soundness; Completeness (order theory); Discrete mathematics; Axiom; Kripke semantics; Intermediate logic; Algebra over a field; Pure mathematics; Calculus (dental); Computer science; Description logic; Programming language","authors":[{"name":"Gerard Allwein","is_ca":false},{"name":"Wendy MacCaull","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04889535107170354,"gpt":0.298588028206924,"spread":0.2496926771352204,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001957197,0.0001186853,0.0001938141,0.00002890799,0.0002253562,0.00002843011,0.0007291597,0.00003985512,0.00001152545],"category_scores_gemma":[0.000101472,0.00006433651,0.00009845145,0.0002734775,0.0001274507,0.00009969428,0.000213602,0.00006966283,0.0000131311],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009763323,"about_ca_system_score_gemma":0.00002537135,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003864252,"about_ca_topic_score_gemma":0.00001524525,"domain_scores_codex":[0.9991246,0.0000282532,0.0001886498,0.0002514903,0.0001495823,0.000257422],"domain_scores_gemma":[0.998883,0.0004937537,0.0001074991,0.0004055217,0.00007627627,0.00003391691],"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.00001856398,0.0001262927,0.002019058,0.00001525807,0.00004157899,0.00001626881,0.0004502837,0.000242579,0.0004221632,0.9839071,0.0008046273,0.01193624],"study_design_scores_gemma":[0.001873884,0.001579314,0.05944368,0.00003857953,0.00008899763,0.0001147144,0.001301329,0.01065095,0.00112963,0.8136019,0.1094647,0.0007123187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02195998,0.002496542,0.9645724,0.003615692,0.0003488593,0.0005041253,0.000005299824,0.0001101152,0.006386985],"genre_scores_gemma":[0.9801644,0.0005368359,0.01854706,0.0004586679,0.00007121669,0.00004026134,8.507099e-7,0.000004468829,0.0001762469],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9582044,"threshold_uncertainty_score":0.2623567,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1763963671","doi":"10.1007/s11225-015-9626-z","title":"Progression and Verification of Situation Calculus Agents with Bounded Beliefs","year":2015,"lang":"en","type":"article","venue":"Studia Logica","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; Provincia autonoma di Bolzano - Alto Adige; European Commission","keywords":"Decidability; Situation calculus; Bounded function; Action (physics); Domain (mathematical analysis); Action theory (sociology); Computer science; Mathematics; Calculus (dental); Theoretical computer science; Artificial intelligence; Epistemology","authors":[{"name":"Giuseppe De Giacomo","is_ca":false},{"name":"Yves Lespérance","is_ca":true},{"name":"Fabio Patrizi","is_ca":false},{"name":"Stavros Vassos","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04576077388929656,"gpt":0.290040312828687,"spread":0.2442795389393904,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002562155,0.00008708964,0.00012688,0.00003526492,0.00009400764,0.00004459257,0.0002003426,0.00004184592,0.000002749927],"category_scores_gemma":[0.00007568154,0.00005578297,0.00001489916,0.0002159932,0.00007787514,0.0001708673,0.0001280255,0.00004689818,0.00001375467],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002934156,"about_ca_system_score_gemma":0.0000841962,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001136417,"about_ca_topic_score_gemma":0.00001468988,"domain_scores_codex":[0.999201,0.00005571447,0.0001215216,0.0002483815,0.0002414179,0.0001319665],"domain_scores_gemma":[0.9993798,0.00002454289,0.0001149134,0.000227093,0.0001724986,0.00008113422],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.0002410417,0.001725609,0.08038244,0.0001350003,0.0001765715,0.00005708075,0.05293955,0.00005876266,0.003248733,0.6304237,0.009486035,0.2211255],"study_design_scores_gemma":[0.005722639,0.00476848,0.9154153,0.0001979549,0.00008170098,0.00005298244,0.00112524,0.01750123,0.007552416,0.02982992,0.01681469,0.000937472],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6065632,0.002266648,0.2711275,0.0009849812,0.0005138118,0.001080771,0.00000287778,0.0003120601,0.1171482],"genre_scores_gemma":[0.9899786,0.00002978357,0.009817426,0.0000302706,0.00003179448,0.00002098626,0.000003572046,0.000003123474,0.00008450721],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8350328,"threshold_uncertainty_score":0.2274764,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2075300940","doi":"10.1007/s11225-013-9519-y","title":"Remarks on the Scott–Lindenbaum Theorem","year":2013,"lang":"en","type":"article","venue":"Studia Logica","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Generalization; Subject (documents); Order (exchange); Inference; Logical consequence; Epistemology; Computer science; Mathematical logic; Rule of inference; Mathematics; Mathematical economics; Calculus (dental); Algebra over a field; Philosophy; Artificial intelligence; Algorithm; Pure mathematics","authors":[{"name":"Gillman Payette","is_ca":true},{"name":"Peter Κ. Schotch","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02004094291187576,"gpt":0.2323315146845149,"spread":0.2122905717726392,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005110636,0.0001906491,0.0001886379,0.00003940869,0.0003976969,0.0002377224,0.001452263,0.00007920203,0.0004229816],"category_scores_gemma":[0.0002872585,0.00009322726,0.0001068874,0.0003095368,0.0001381292,0.0001624743,0.0005071572,0.0002537604,0.003394043],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003240875,"about_ca_system_score_gemma":0.00005280635,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000208852,"about_ca_topic_score_gemma":0.00001124131,"domain_scores_codex":[0.9985086,0.0001817819,0.0001800565,0.0004359914,0.0002811639,0.0004124623],"domain_scores_gemma":[0.9983538,0.0005024847,0.00008741673,0.0008494098,0.0001151489,0.00009178693],"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.000002531636,0.00008802205,0.000685295,0.000002259856,0.00002211987,0.000007851581,0.0008584519,0.000002875692,0.0000750372,0.9413832,0.04820098,0.008671332],"study_design_scores_gemma":[0.001079676,0.001236462,0.1664489,0.00008804709,0.00002907823,0.00003588012,0.0009840756,0.003047714,0.001371138,0.7172443,0.1072674,0.001167303],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.02128058,0.0004263779,0.01148781,0.007681669,0.0007966954,0.0005638523,8.392889e-7,0.0002797389,0.9574825],"genre_scores_gemma":[0.994293,0.00004993102,0.001243413,0.001901015,0.0002209269,0.00008316088,5.789919e-7,0.000007723673,0.002200282],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9730124,"threshold_uncertainty_score":0.9973819,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1999417206","doi":"10.1007/s11225-005-0291-5","title":"On relative universality and Q-universality","year":2004,"lang":"en","type":"article","venue":"Studia Logica","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Universality (dynamical systems); Mathematics; Computational linguistics; Discrete mathematics; Linguistics; Philosophy; Physics; Quantum mechanics","authors":[{"name":"Vácłav Koubek","is_ca":false},{"name":"J. Sichler","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01657044468127615,"gpt":0.2384107521854373,"spread":0.2218403075041612,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001138224,0.0001161504,0.0001386093,0.00003594853,0.0002138219,0.00002489394,0.0002872747,0.00004628686,0.000009989325],"category_scores_gemma":[0.00005928313,0.00009073133,0.00003611464,0.0002400751,0.0001293746,0.0003431206,0.000236532,0.0001453271,0.00004735388],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008515699,"about_ca_system_score_gemma":0.00004285764,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001895323,"about_ca_topic_score_gemma":0.000009141576,"domain_scores_codex":[0.9991452,0.00005709833,0.00008594055,0.0003804578,0.0001376933,0.0001935711],"domain_scores_gemma":[0.9994222,0.0001236027,0.00005214863,0.000288309,0.0000343219,0.00007941909],"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.000007295447,0.00005078353,0.0002129925,0.000001577291,0.00001117905,0.00004198294,0.0006043849,0.0001492878,0.00002053743,0.9974791,0.00003842121,0.001382444],"study_design_scores_gemma":[0.000759378,0.0003404605,0.0479055,0.000009799644,0.000006211695,0.000004821864,0.0002007548,0.0000320472,0.00008165022,0.9487878,0.001685674,0.0001858886],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2332862,0.0002299616,0.6009663,0.004800484,0.0002723649,0.000315631,0.00000583691,0.0004157849,0.1597074],"genre_scores_gemma":[0.9898731,0.00004036001,0.009483968,0.0004630211,0.00001568751,0.000001931422,6.307982e-7,0.000002587844,0.0001187397],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7565868,"threshold_uncertainty_score":0.3699916,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1743668334","doi":"10.1007/s11225-015-9625-0","title":"A Logical Theory of Localization","year":2015,"lang":"en","type":"article","venue":"Studia Logica","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Rotation formalisms in three dimensions; Probabilistic logic; Computer science; Logical framework; Artificial intelligence; Categorical variable; Representation (politics); Robotics; Robot; Domain (mathematical analysis); Task (project management); Logical conjunction; Theoretical computer science; Mathematics; Programming language; Machine learning; Engineering","authors":[{"name":"Vaishak Belle","is_ca":true},{"name":"Hector J. Levesque","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05663743995222333,"gpt":0.2683891055608521,"spread":0.2117516656086288,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006030982,0.0001062053,0.0001967067,0.00004308653,0.00006384186,0.00002891528,0.0005560572,0.00006779793,0.0000294879],"category_scores_gemma":[0.0003927058,0.00006988784,0.00005793456,0.0003486799,0.0001116222,0.0001211765,0.0003338683,0.00007023384,0.0001249441],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000269112,"about_ca_system_score_gemma":0.00009369069,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004192261,"about_ca_topic_score_gemma":0.000003150282,"domain_scores_codex":[0.9989626,0.0001678636,0.0001800023,0.0002659554,0.0002243786,0.0001991339],"domain_scores_gemma":[0.9991724,0.0001192968,0.00008750274,0.0003226139,0.0001889054,0.0001092281],"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.00001172861,0.000147355,0.003144136,0.000004968848,0.00001398844,0.00001157021,0.001640344,0.00006518992,0.00002569557,0.9850127,0.003686136,0.006236167],"study_design_scores_gemma":[0.001677442,0.001400622,0.02313598,0.00003028318,0.00003220635,0.000032576,0.0008794865,0.006103671,0.0009221794,0.9121795,0.05304671,0.0005593243],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003297626,0.0008300939,0.7437097,0.0001436242,0.000318067,0.0001255097,8.400201e-7,0.0001428233,0.2514317],"genre_scores_gemma":[0.9953346,0.00002412228,0.00399254,0.0002053723,0.0000734581,0.000009963293,0.000001404528,0.000003521448,0.0003550129],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.992037,"threshold_uncertainty_score":0.2849944,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2562611489","doi":"10.1007/s11225-017-9767-3","title":"The Category of Node-and-Choice Preforms for Extensive-Form Games","year":2017,"lang":"en","type":"article","venue":"Studia Logica","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Subcategory; Morphism; Mathematics; Tree (set theory); Node (physics); Functor; Combinatorics; Set (abstract data type); Discrete mathematics; Operator (biology); Computer science; Physics","authors":[{"name":"Peter A. Streufert","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04354272302779526,"gpt":0.2879487892578328,"spread":0.2444060662300376,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004654762,0.0001202127,0.0002121702,0.00001832422,0.0009432961,0.0002351659,0.001059166,0.00005482128,0.000001008722],"category_scores_gemma":[0.0003603612,0.00005870396,0.00008081604,0.00003841433,0.0002367627,0.0002199522,0.0004473715,0.00006868027,0.00000917574],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001331455,"about_ca_system_score_gemma":0.00004384277,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001801262,"about_ca_topic_score_gemma":0.000103702,"domain_scores_codex":[0.9990556,0.00002094991,0.0002022193,0.0002756834,0.0001597836,0.0002857153],"domain_scores_gemma":[0.9984301,0.0002412531,0.0002804396,0.0008092975,0.0001867844,0.00005207655],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00001494283,0.00005457168,0.009821053,0.00005763913,0.00008017083,0.000003517354,0.001473512,9.67905e-7,0.0001384449,0.8659835,0.001815122,0.1205566],"study_design_scores_gemma":[0.00140987,0.0008707864,0.3643671,0.00001251534,0.00004225593,0.0000208991,0.0007305236,0.0009376256,0.0008782406,0.3034314,0.3268243,0.0004744963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08119544,0.01672593,0.5397075,0.01421034,0.008703645,0.007194842,0.0000180829,0.0007857141,0.3314585],"genre_scores_gemma":[0.9976196,0.0001363632,0.00104917,0.00008299946,0.0001133688,0.00009486818,5.514573e-7,0.000005221019,0.0008978195],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9164242,"threshold_uncertainty_score":0.7255166,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2080872423","doi":"10.1007/s11225-013-9492-5","title":"Decidability of an Xstit Logic","year":2013,"lang":"en","type":"article","venue":"Studia Logica","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"Killam Trusts","keywords":"Decidability; Undecidable problem; Mathematics; Completeness (order theory); Fragment (logic); Discrete mathematics; Closure (psychology); Intermediate logic; Zeroth-order logic; Mathematical proof; Dynamic logic (digital electronics); Computer science; Algorithm; Description logic; Programming language; Multimodal logic","authors":[{"name":"Gillman Payette","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0231464633254877,"gpt":0.2570697660865448,"spread":0.2339233027610571,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003264478,0.0001479707,0.0002677579,0.00004357074,0.0001234455,0.00006815492,0.001023894,0.00007777053,0.0002887405],"category_scores_gemma":[0.0002545648,0.0001000855,0.00008512771,0.0003233537,0.0001437458,0.0003634421,0.0004187195,0.0001054534,0.0004312046],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003005708,"about_ca_system_score_gemma":0.00006912304,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000985493,"about_ca_topic_score_gemma":0.00003222312,"domain_scores_codex":[0.9986637,0.0001197301,0.0002459978,0.0004499312,0.0002065912,0.0003140565],"domain_scores_gemma":[0.9986471,0.0001541092,0.0001057579,0.0007372801,0.0002213813,0.0001343679],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.000009903263,0.001379618,0.04459504,0.00004322339,0.00005722785,0.00002313724,0.002393513,0.00003627557,0.001931238,0.8886303,0.004688737,0.05621182],"study_design_scores_gemma":[0.0005689414,0.001007375,0.7052867,0.00001129962,0.00001337544,0.00001230288,0.0001791395,0.002555564,0.001286344,0.2846088,0.004044729,0.0004254744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5469527,0.0005957338,0.05541431,0.0006003716,0.0006745365,0.000796745,0.000003129637,0.0004055424,0.394557],"genre_scores_gemma":[0.9789577,0.00001488421,0.02051632,0.0001849155,0.00006773774,0.00004763019,0.000001085763,0.000003930721,0.0002058084],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6606917,"threshold_uncertainty_score":0.5542406,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2043257491","doi":"10.1007/s11225-005-5057-6","title":"An application of a Theorem of Ash to finite covers","year":2004,"lang":"en","type":"article","venue":"Studia Logica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Semigroup; Inverse semigroup; Unary operation; Pure mathematics; Special classes of semigroups; Group (periodic table); Structured program theorem; Cancellative semigroup; Krohn–Rhodes theory; Subalgebra; Discrete mathematics; Algebra over a field","authors":[{"name":"Karl Auinger","is_ca":false},{"name":"Gracinda M. S. Gomes","is_ca":false},{"name":"Victoria Gould","is_ca":false},{"name":"Benjamin Steinberg","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01112871733523398,"gpt":0.2523809907091885,"spread":0.2412522733739545,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002173722,0.00006204668,0.000128427,0.00004346441,0.0000312935,0.00000990414,0.0005337832,0.00002470604,0.000005129747],"category_scores_gemma":[0.00003105503,0.00004853078,0.00003401171,0.0003016128,0.00004861171,0.00009203005,0.0001187141,0.00002974719,0.00002088747],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001347638,"about_ca_system_score_gemma":0.00003057635,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002851993,"about_ca_topic_score_gemma":0.000004283612,"domain_scores_codex":[0.999403,0.00002641713,0.0001412779,0.0001898376,0.0001344799,0.0001049806],"domain_scores_gemma":[0.9993252,0.00006987057,0.00008071484,0.0004337218,0.00004871062,0.00004180306],"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.000008821563,0.000155974,0.0003290287,0.000006146962,0.00001018875,0.000001193134,0.00152085,0.002991742,0.01868312,0.9601728,0.00003606368,0.01608404],"study_design_scores_gemma":[0.001699564,0.002282963,0.08471957,0.00007141485,0.00002651622,0.000005792359,0.001107074,0.004307574,0.09182014,0.8096621,0.003733729,0.0005635691],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2264235,0.00004619307,0.7664732,0.0003023277,0.00005336184,0.0001951668,0.000007338973,0.00006886903,0.006430048],"genre_scores_gemma":[0.9832416,0.000006285743,0.01645757,0.0002574149,0.00001481545,0.0000135104,0.000001328154,0.000002657273,0.000004819461],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7568181,"threshold_uncertainty_score":0.1979028,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1607885199","doi":"10.1023/a:1005238330484","title":"Completeness Theorems via the Double Dual Functor","year":2000,"lang":"en","type":"article","venue":"Studia Logica","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"Agencia Nacional de Promoción Científica y Tecnológica; Natural Sciences and Engineering Research Council of Canada; Universidad de Chile; Pontificia Universidad Católica de Chile; Université de Montréal","keywords":"Łukasiewicz logic; Propositional calculus; Mathematics; Completeness (order theory); Calculus (dental); Distributive property; Functor; Monoidal t-norm logic; Propositional variable; Algebra over a field; Zeroth-order logic; Many-valued logic; Discrete mathematics; Pure mathematics; Computer science; Intermediate logic; Substructural logic; Artificial intelligence","authors":[{"name":"Adriana Galli","is_ca":false},{"name":"Marta Sagastume","is_ca":false},{"name":"Gonzalo E. Reyes","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02707859638655251,"gpt":0.2436913765549251,"spread":0.2166127801683726,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002066897,0.0001673167,0.000187719,0.00001946127,0.0004591825,0.00009286169,0.0009056379,0.00004106,0.0006248831],"category_scores_gemma":[0.000007782217,0.00008760867,0.00007919678,0.0003525504,0.0001649709,0.000189554,0.0002278586,0.000150378,0.000752884],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001745452,"about_ca_system_score_gemma":0.00002637631,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000129854,"about_ca_topic_score_gemma":0.000008542876,"domain_scores_codex":[0.9987491,0.0000746684,0.0001732935,0.0003839937,0.0002444407,0.000374529],"domain_scores_gemma":[0.9990643,0.0001543533,0.00004828583,0.0006265721,0.00004085157,0.00006560043],"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.000047465,0.0001364847,0.000327415,0.000003645699,0.00003817132,0.00005398037,0.0008825215,0.0004717933,0.0003595037,0.8958626,0.001975331,0.09984107],"study_design_scores_gemma":[0.002371774,0.0006259786,0.0636529,0.00001379432,0.00002959417,0.0001300323,0.0002332173,0.002360163,0.0004449443,0.5268295,0.4023742,0.0009338161],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1781817,0.002053787,0.3446078,0.009626714,0.001698931,0.001230528,0.00001016323,0.001185072,0.4614053],"genre_scores_gemma":[0.9953114,0.00004330077,0.001906091,0.001459105,0.000185318,0.00004239479,0.000001954638,0.000006617498,0.001043768],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8171298,"threshold_uncertainty_score":0.9677052,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1998008572","doi":"10.1007/s11225-005-0496-7","title":"Gricean Belief Change","year":2005,"lang":"en","type":"article","venue":"Studia Logica","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computational linguistics; Linguistics; Natural language processing; Computer science; Mathematics; Philosophy","authors":[{"name":"James P. Delgrande","is_ca":true},{"name":"Abhaya Nayak","is_ca":false},{"name":"Maurice Pagnucco","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0446859907884477,"gpt":0.2604042263466005,"spread":0.2157182355581528,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002168638,0.0001577045,0.0001837649,0.00005533947,0.0002242269,0.00008066111,0.0008379434,0.00006372157,0.00009067196],"category_scores_gemma":[0.00004511646,0.0001137319,0.0000797285,0.0003371974,0.00004633247,0.0003087454,0.000465153,0.0001261334,0.001417095],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004508591,"about_ca_system_score_gemma":0.0000305227,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001383092,"about_ca_topic_score_gemma":0.0000535722,"domain_scores_codex":[0.9987951,0.00004897921,0.000149304,0.0004076585,0.0001983422,0.0004006487],"domain_scores_gemma":[0.9992511,0.00006519215,0.00006270265,0.0004400164,0.00006517272,0.0001158223],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000005712234,0.0005800689,0.007072048,0.00001381735,0.00005538084,0.00006257439,0.008172947,0.000007298755,0.0001133301,0.6840823,0.04010519,0.2597293],"study_design_scores_gemma":[0.0007132934,0.0003874464,0.1218929,0.00001548437,0.00001594255,0.0000276444,0.00009037204,0.001141725,0.0002324389,0.006322004,0.8685946,0.0005661249],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.01891814,0.006189879,0.02103132,0.008603462,0.001406015,0.0005919414,0.00000415492,0.001083087,0.942172],"genre_scores_gemma":[0.9877911,0.000185624,0.008068799,0.001524216,0.000967352,0.00004740506,0.000001086359,0.000006485968,0.001407998],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9688729,"threshold_uncertainty_score":0.9993604,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":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","authors":[{"name":"Yehuda Schwartz","is_ca":true},{"name":"George Tourlakis","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02698497281611857,"gpt":0.2651746369767692,"spread":0.2381896641606506,"validation_status":"score_only:v0-immature-baseline"},"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"},"labels":[],"label_agreement":null},{"id":"W2287742635","doi":"10.1007/s11225-015-9648-6","title":"Matching Topological and Frame Products of Modal Logics","year":2016,"lang":"en","type":"article","venue":"Studia Logica","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"","keywords":"Cartesian product; Product (mathematics); Combinatorics; Physics; Topology (electrical circuits); Mathematics; Geometry","authors":[{"name":"Philip Kremer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02234388495915967,"gpt":0.2438347671193651,"spread":0.2214908821602054,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003422115,0.0001657543,0.0002952916,0.00004480335,0.0001317625,0.00003850274,0.0005671856,0.0001038069,0.00002862183],"category_scores_gemma":[0.0002957123,0.0000843366,0.00004988989,0.0002089373,0.0002457131,0.0001847828,0.0006813188,0.0001068547,0.00004108832],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002095572,"about_ca_system_score_gemma":0.00005138137,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001075182,"about_ca_topic_score_gemma":0.000004384054,"domain_scores_codex":[0.9986494,0.00009167592,0.0002217622,0.0005104615,0.0001946275,0.0003321206],"domain_scores_gemma":[0.9990318,0.0002477869,0.0001126789,0.0004045911,0.0001176302,0.00008548516],"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.00001082124,0.0001509026,0.007626756,0.00001972982,0.00002400909,0.00002412589,0.001226578,0.000001632994,0.005102593,0.9719244,0.0004176533,0.0134708],"study_design_scores_gemma":[0.001335834,0.001325359,0.1704278,0.00008207392,0.000026419,0.0000859076,0.0002981785,0.00009554333,0.005533545,0.8109193,0.00913546,0.0007345313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7757457,0.001786864,0.1599047,0.005214626,0.0007118815,0.0004149467,0.000006446552,0.0003417787,0.05587304],"genre_scores_gemma":[0.984431,0.0001881444,0.01479608,0.0001449877,0.0001193429,0.00001097801,2.617014e-7,0.00000452252,0.0003047356],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2086852,"threshold_uncertainty_score":0.3439147,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W119121478","doi":"10.1007/s11225-007-9035-z","title":"John Woods, Paradox and Paraconsistency: Conflict Resolution in the Abstract Sciences","year":2007,"lang":"en","type":"article","venue":"Studia Logica","topic":"Philosophy and History of Science","field":"Arts and Humanities","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Paraconsistent logic; Computational linguistics; Resolution (logic); Epistemology; Philosophy; Computer science; Linguistics; Artificial intelligence","authors":[{"name":"Andrew David Irvine","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1416354825250943,"gpt":0.2909356647261973,"spread":0.1493001822011029,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001387499,0.00008363808,0.0001042386,0.0000764178,0.001056234,0.0001031472,0.0002162652,0.00002322971,0.000122846],"category_scores_gemma":[0.0000448389,0.00005019595,0.00002716373,0.0000739457,0.001929062,0.0001818178,0.00002668562,0.0001222184,0.00003021578],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001567284,"about_ca_system_score_gemma":0.00003083651,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000165071,"about_ca_topic_score_gemma":0.00151591,"domain_scores_codex":[0.9991468,0.0000287824,0.0001674566,0.0002085399,0.0002159918,0.0002323991],"domain_scores_gemma":[0.9995905,0.0001980145,0.00006217494,0.00009600321,0.00002216202,0.00003112762],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001419014,0.00007296035,0.000633841,0.000005041808,0.000003592493,0.00002159553,0.02944088,0.000001909076,0.0000401035,0.9668233,0.00169257,0.001249975],"study_design_scores_gemma":[0.0002651947,0.0003361539,0.1897226,0.00002479839,0.00001195186,0.00001119896,0.0169345,0.000007337576,0.000007094843,0.04735002,0.7451084,0.0002208313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2086071,0.002139851,0.000002142298,0.00202049,0.0002094348,0.0001300005,0.000004179943,0.0000211387,0.7868657],"genre_scores_gemma":[0.9985808,0.0001107286,0.00004185433,0.0008382813,0.0002113826,0.000006102225,5.711295e-7,0.000001658706,0.00020865],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9194733,"threshold_uncertainty_score":0.8123804,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2332702779","doi":"10.1007/s11225-016-9659-y","title":"Special Issue on Logical Aspects of Multi-Agent Systems","year":2016,"lang":"en","type":"article","venue":"Studia Logica","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Computer science; Computational linguistics; Theoretical computer science; Artificial intelligence; Programming language; Natural language processing; Cognitive science; Psychology","authors":[{"name":"Nils Bulling","is_ca":false},{"name":"Wiebe van der Hoek","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04162115099324765,"gpt":0.2700030614398125,"spread":0.2283819104465649,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003131219,0.0002158596,0.0003910036,0.00007258594,0.000126504,0.00004974334,0.000877584,0.0001086077,0.0002091674],"category_scores_gemma":[0.0002506519,0.0001116692,0.000126647,0.0002409765,0.00013053,0.0001045178,0.0003820383,0.00009980414,0.001395181],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008171877,"about_ca_system_score_gemma":0.00006507023,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001125463,"about_ca_topic_score_gemma":0.00001159898,"domain_scores_codex":[0.9982219,0.0001517416,0.0003101709,0.0005531438,0.0003593539,0.0004037314],"domain_scores_gemma":[0.9987564,0.0002656255,0.0001593843,0.000556127,0.0001246539,0.0001378152],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002730683,0.0008149287,0.001650739,0.00002451294,0.00006330389,0.0001412561,0.0008444805,0.00001719623,0.0008225885,0.9293838,0.03560065,0.03060925],"study_design_scores_gemma":[0.003950579,0.003225416,0.08877646,0.0002653619,0.00003728452,0.0000468794,0.0002487045,0.0005142125,0.003207508,0.008721446,0.8899131,0.001093092],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.006740383,0.0006439461,0.03833583,0.0008796541,0.00599465,0.0006197598,0.00001168835,0.0002921342,0.9464819],"genre_scores_gemma":[0.9918274,0.000095841,0.0009953884,0.00009796443,0.00420778,0.00002532326,4.616838e-7,0.000007623262,0.002742228],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.985087,"threshold_uncertainty_score":0.9993824,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4235403575","doi":"10.1023/a:1015158532251","title":"Bernard Linsky, Russell's Metaphysical Logic","year":2002,"lang":"en","type":"article","venue":"Studia Logica","topic":"Phenomenology and Existential Philosophy","field":"Psychology","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Computational linguistics; Computer science; Linguistics; Mathematics; Natural language processing; Philosophy","authors":[{"name":"Judy Pelham","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09650533790692871,"gpt":0.3114692618794279,"spread":0.2149639239724991,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0001227715,0.0002347428,0.0003869042,0.00007176059,0.0002314579,0.00001699523,0.0003769351,0.0001891031,0.00873725],"category_scores_gemma":[0.00003158618,0.000185778,0.0001978343,0.0002485398,0.0002908498,0.00005721909,0.0001343766,0.0003655179,0.01670486],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002201661,"about_ca_system_score_gemma":0.000004599131,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001498721,"about_ca_topic_score_gemma":0.000002710385,"domain_scores_codex":[0.9983759,0.0001695129,0.0002604661,0.0005218256,0.0001563172,0.0005159655],"domain_scores_gemma":[0.9991499,0.0001116579,0.00009194155,0.0004899852,0.0000363482,0.0001202057],"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.00007030708,0.001827391,0.001401124,0.000007319867,0.0007767034,0.0003190933,0.002117963,0.00000575384,0.0002765889,0.914694,0.07262372,0.005880008],"study_design_scores_gemma":[0.003071499,0.002115795,0.04806421,0.00001169884,0.0004151061,0.00009037762,0.0007628737,0.00002179342,0.00005825104,0.5607235,0.3834831,0.001181851],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.05454529,0.002474989,0.00007759665,0.006592075,0.001274134,0.0002238509,0.0000144248,0.0002301927,0.9345675],"genre_scores_gemma":[0.9922146,0.0001321068,0.0001751478,0.002047982,0.0007618504,0.00007012491,0.000006948109,0.00001913846,0.004572148],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9376693,"threshold_uncertainty_score":0.9921689,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1984195282","doi":"10.1007/s11225-005-4649-5","title":"Frames and MV-algebras","year":2005,"lang":"en","type":"article","venue":"Studia Logica","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Embedding; Topological space; Algebra over a field; Pure mathematics; Class (philosophy); Generalization; Lattice (music); Discrete mathematics; Physics; Mathematical analysis; Computer science","authors":[{"name":"L. P. Belluce","is_ca":true},{"name":"Antonio Di Nola","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01460012702041924,"gpt":0.2458044305026107,"spread":0.2312043034821915,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008478612,0.000111948,0.00013605,0.00003344337,0.0001546903,0.00006043552,0.0003498525,0.00004271561,0.00003959294],"category_scores_gemma":[0.00004275479,0.00008151354,0.00002962934,0.000168679,0.00006854241,0.0002695553,0.0003014281,0.0001045812,0.0001507041],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001276903,"about_ca_system_score_gemma":0.00001656745,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001475294,"about_ca_topic_score_gemma":0.000005064942,"domain_scores_codex":[0.9991768,0.00002556665,0.0001131488,0.0003224755,0.0001237129,0.0002383152],"domain_scores_gemma":[0.9995122,0.00008239953,0.0000378383,0.0002677772,0.00002349496,0.00007630352],"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.000002180961,0.00006039378,0.001799845,0.000003297847,0.00001309057,0.00001686388,0.0005796122,0.00003076245,0.0001604171,0.8742778,0.002501574,0.1205542],"study_design_scores_gemma":[0.001051846,0.0005026232,0.1445056,0.0000178425,0.00001649881,0.00007029118,0.0002420406,0.00167486,0.001009048,0.4746072,0.3754374,0.0008647201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3051394,0.01041843,0.4858613,0.019916,0.0006464422,0.0005377459,0.000003704883,0.001212309,0.1762646],"genre_scores_gemma":[0.9442387,0.0001602162,0.05349673,0.001672907,0.0001270038,0.00001092963,3.347649e-7,0.000003590162,0.0002896417],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6390992,"threshold_uncertainty_score":0.3324026,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2773658508","doi":"10.1007/s11225-017-9775-3","title":"Topological-Frame Products of Modal Logics","year":2017,"lang":"en","type":"article","venue":"Studia Logica","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"","keywords":"Star product; Product (mathematics); Mathematics; Product topology; Combinatorics; Discrete mathematics; Topology (electrical circuits); Geometry","authors":[{"name":"Philip Kremer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04643960969552468,"gpt":0.2881895101291418,"spread":0.2417499004336172,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004446901,0.0002134001,0.0004039144,0.00004458639,0.0005942712,0.0001735092,0.002511887,0.0001386634,0.00004563164],"category_scores_gemma":[0.001330534,0.0001412838,0.0001116579,0.0001503237,0.0004390633,0.00029379,0.001428843,0.0002040481,0.0001360619],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002657375,"about_ca_system_score_gemma":0.0001026355,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003017162,"about_ca_topic_score_gemma":0.00001042639,"domain_scores_codex":[0.9983013,0.0000803973,0.0002741559,0.0006228257,0.0002810518,0.0004402246],"domain_scores_gemma":[0.9975863,0.0001075259,0.0003367341,0.001609857,0.0002579992,0.0001015934],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00001288399,0.0003905646,0.01370892,0.00002870376,0.0000439501,0.00005902804,0.0008165285,0.00001009296,0.0009819922,0.9714975,0.002975319,0.009474489],"study_design_scores_gemma":[0.00165574,0.001894315,0.5907181,0.00005538161,0.00005123745,0.00005585556,0.0001973862,0.001003969,0.008149086,0.3458782,0.0491714,0.001169338],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1705137,0.001764915,0.03888986,0.007114208,0.002615433,0.0008112223,0.000009975189,0.0005040942,0.7777765],"genre_scores_gemma":[0.9845346,0.0001252914,0.0137929,0.0001564946,0.0002256166,0.00001963546,9.949371e-7,0.000005778017,0.001138642],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8140209,"threshold_uncertainty_score":0.5761387,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4400659579","doi":"10.1007/s11225-024-10124-2","title":"A Version of Predicate Logic with Two Variables That has an Incompleteness Property","year":2024,"lang":"en","type":"article","venue":"Studia Logica","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Prince Edward Island","funders":"İstanbul Medipol Üniversitesi","keywords":"Predicate logic; Predicate (mathematical logic); Computational linguistics; Property (philosophy); Predicate variable; Computer science; Programming language; Mathematics; Theoretical computer science; Natural language processing; Discrete mathematics; Multimodal logic; Description logic; Zeroth-order logic; Philosophy; Epistemology","authors":[{"name":"Mohamed Khaled","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05533991504132307,"gpt":0.2630611017842904,"spread":0.2077211867429673,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004337472,0.0002133657,0.0003077638,0.00009561913,0.0002399173,0.0002185444,0.0009432125,0.00006410058,0.00005633033],"category_scores_gemma":[0.00003470302,0.0001015499,0.00006352753,0.0005615963,0.0002344841,0.0004350721,0.0005112051,0.000156716,0.0000730188],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004321928,"about_ca_system_score_gemma":0.0002585669,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001122699,"about_ca_topic_score_gemma":0.00004708552,"domain_scores_codex":[0.9983599,0.0001378655,0.0001822632,0.0006367638,0.0003465359,0.0003366788],"domain_scores_gemma":[0.9990401,0.0001194275,0.00007844544,0.0005305608,0.0001184005,0.0001131097],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002784515,0.001877154,0.02758234,0.0007580992,0.0005823765,0.0008572734,0.01320274,0.0006375342,0.005051188,0.8857675,0.01372041,0.04968491],"study_design_scores_gemma":[0.009695968,0.01883329,0.1260572,0.002557642,0.0007055493,0.0007699596,0.002389682,0.1787426,0.01108529,0.2376673,0.4066517,0.004843754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09598331,0.00643306,0.572491,0.003544048,0.002301214,0.001866792,0.00004895341,0.002459667,0.314872],"genre_scores_gemma":[0.9888155,0.00006163849,0.01051529,0.0001000316,0.0000930664,0.00003664909,0.000006706294,0.00001092305,0.0003601665],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8928322,"threshold_uncertainty_score":0.4141083,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}