{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005652686,0.0009459452,0.001425222,0.002483279,0.00359788,0.0102557,0.002523483,0.003138739,0.008535618],"category_scores_gemma":[0.01199853,0.000987481,0.002636734,0.002340032,0.01496247,0.03143404,0.005475817,0.007215521,0.0007990165],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002251085,"about_ca_system_score_gemma":0.001871657,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005411348,"about_ca_topic_score_gemma":0.002691613,"domain_scores_codex":[0.9954206,0.001991262,0.0004261378,0.0007255494,0.000777946,0.0006584333],"domain_scores_gemma":[0.9901475,0.00738747,0.0004098125,0.00101191,0.0004530431,0.0005902187],"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.00001361751,0.00001354596,0.0001357214,0.00001966783,0.000009898156,0.00005013131,0.0005233359,0.000704658,0.00005878936,0.9961345,0.0002026312,0.002133477],"study_design_scores_gemma":[0.000006730367,0.000002836931,0.00005640225,0.000005968117,0.000009516372,0.00002292526,0.00007969527,0.001267478,0.00005716384,0.9976181,0.000866053,0.000007072771],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1775055,0.004629767,0.5387732,0.01604089,0.0003871749,0.0001854282,0.0005663186,0.000672354,0.2612393],"genre_scores_gemma":[0.9441593,0.001421321,0.04477506,0.0003991975,0.0002614989,0.0001103781,0.0003218178,0.00007239629,0.008478992],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0102557,"threshold_uncertainty_score":0.02989459,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01326992,0.0007869795,0.001351625,0.003014941,0.002689472,0.007643653,0.004618985,0.004221635,0.008022711],"category_scores_gemma":[0.05523615,0.001341417,0.002985068,0.001794257,0.01114443,0.02400012,0.005834031,0.00642485,0.0006432965],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001931116,"about_ca_system_score_gemma":0.00159664,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001950004,"about_ca_topic_score_gemma":0.001305208,"domain_scores_codex":[0.9918184,0.00466218,0.0005517582,0.001078426,0.001427073,0.0004621024],"domain_scores_gemma":[0.9566405,0.03485827,0.002302237,0.003728246,0.001918062,0.0005527274],"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.00008016674,0.00004065741,0.000528581,0.0001507023,0.00006072247,0.0002125485,0.001737549,0.002164871,0.0006553732,0.9745176,0.00159955,0.01825155],"study_design_scores_gemma":[0.00001424969,0.000003910832,0.0001081143,0.00001338213,0.000009306539,0.00004249865,0.0001280562,0.002242779,0.0001253075,0.9964737,0.0008310217,0.000007639553],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1791793,0.01108899,0.715662,0.03014258,0.000519686,0.0001404362,0.0003768273,0.0007158909,0.06217432],"genre_scores_gemma":[0.9265168,0.001467977,0.068113,0.000683049,0.0003296476,0.00004936636,0.0002735913,0.0001035989,0.002462952],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01326992,"threshold_uncertainty_score":0.07017887,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003132098,0.0007053145,0.001172759,0.002628443,0.002504486,0.006741256,0.001509009,0.001981886,0.005098376],"category_scores_gemma":[0.007947222,0.0006713149,0.0009061672,0.002652908,0.007569088,0.01699749,0.002366722,0.004985235,0.0004620864],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002994053,"about_ca_system_score_gemma":0.000853103,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001544932,"about_ca_topic_score_gemma":0.001121838,"domain_scores_codex":[0.9984493,0.0005311447,0.00009504145,0.0002696769,0.0004984657,0.0001562117],"domain_scores_gemma":[0.9938477,0.004797566,0.0003302226,0.000470605,0.0003257476,0.0002282241],"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.000008214294,0.000007356437,0.0001232362,0.00001632522,0.000004339093,0.00001933628,0.00007869671,0.0003592922,0.00006263463,0.9964777,0.0005154706,0.002327391],"study_design_scores_gemma":[0.000002775717,8.390734e-7,0.00005997474,0.000004280096,0.000002357566,0.000009480292,0.00001004102,0.0004482792,0.00002278413,0.9987221,0.0007145781,0.000002371328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.3031495,0.04105149,0.2514063,0.03338679,0.0009277054,0.0000544441,0.0006093084,0.0004132949,0.3690012],"genre_scores_gemma":[0.9540058,0.007448572,0.01981705,0.0007719884,0.001048877,0.00006078347,0.0002132465,0.0000709169,0.01656278],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006741256,"threshold_uncertainty_score":0.02172345,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001326913,0.0006509415,0.0009329119,0.001834285,0.001764823,0.005188088,0.001384857,0.001007864,0.01073624],"category_scores_gemma":[0.002077128,0.0005034351,0.001115126,0.001846322,0.001940395,0.007446526,0.001895053,0.002615082,0.001461175],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001617813,"about_ca_system_score_gemma":0.0006827078,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001262258,"about_ca_topic_score_gemma":0.001444591,"domain_scores_codex":[0.9991193,0.0002315402,0.00006739766,0.0001425128,0.0002568162,0.0001824023],"domain_scores_gemma":[0.9990851,0.0002318783,0.000131997,0.0001551651,0.0002073357,0.0001885544],"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.00001534592,0.000007648548,0.00003941101,0.00001183672,0.000004053789,0.00001375534,0.0001071715,0.0001760074,0.000259344,0.9967673,0.00040513,0.002193049],"study_design_scores_gemma":[0.00001150531,0.000008120899,0.00006462088,0.000009437332,0.000006991325,0.00003489221,0.00006920139,0.001533097,0.0002189556,0.9940892,0.003945854,0.000008147352],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2531763,0.004443298,0.5165558,0.003540866,0.001206452,0.0001189719,0.001304959,0.001475182,0.2181782],"genre_scores_gemma":[0.9134445,0.001287034,0.04149625,0.0004481866,0.0007445297,0.00009496542,0.0008965497,0.000202123,0.04138593],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01073624,"threshold_uncertainty_score":0.03591627,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001621389,0.000459595,0.0005715174,0.001736911,0.004985911,0.006163428,0.001519629,0.002523559,0.02133842],"category_scores_gemma":[0.004689893,0.0005178603,0.001092877,0.001622771,0.01376259,0.008475929,0.003844797,0.004369797,0.003304452],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002447403,"about_ca_system_score_gemma":0.001461272,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006030683,"about_ca_topic_score_gemma":0.007039829,"domain_scores_codex":[0.9988072,0.0005557552,0.00004636546,0.0001797553,0.0002330162,0.0001779366],"domain_scores_gemma":[0.9983711,0.0005912695,0.00004450872,0.0004559614,0.0002506306,0.0002865982],"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.0000333094,0.00001819369,0.0002091563,0.00002502594,0.000008852709,0.00008625739,0.001811466,0.0003963417,0.0003731061,0.9796642,0.008077513,0.009296438],"study_design_scores_gemma":[0.00002069164,0.00001723881,0.0002359642,0.00004416966,0.00001030044,0.0001157139,0.001417456,0.0007431705,0.0002673241,0.8791009,0.1179995,0.00002762117],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.07006717,0.008296274,0.2481083,0.1031976,0.002720074,0.0002768336,0.0009411221,0.001985709,0.5644069],"genre_scores_gemma":[0.573314,0.004361901,0.1505791,0.01126825,0.0007402627,0.0003398588,0.0009148838,0.001079586,0.2574023],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02133842,"threshold_uncertainty_score":0.07138419,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007015844,0.001064015,0.002526067,0.004477787,0.005050901,0.00804748,0.00330314,0.003598014,0.0173301],"category_scores_gemma":[0.01988252,0.001499369,0.003345995,0.005931677,0.004993869,0.02395373,0.007132452,0.009652004,0.002966046],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003943891,"about_ca_system_score_gemma":0.002516795,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001739306,"about_ca_topic_score_gemma":0.001061573,"domain_scores_codex":[0.9937033,0.002233031,0.0004371481,0.001076571,0.001898188,0.0006517968],"domain_scores_gemma":[0.9838451,0.01139333,0.0006700112,0.001540862,0.001932502,0.0006181593],"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.00003321977,0.00004052815,0.0001258343,0.00007295742,0.00001696574,0.000072215,0.0002288165,0.0007072136,0.0003352289,0.990678,0.001447445,0.006241695],"study_design_scores_gemma":[0.00002552088,0.00001276559,0.0001119516,0.0000186284,0.00003020093,0.00006082288,0.00005973459,0.004941038,0.0006852635,0.9890153,0.005021905,0.00001689483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03456444,0.004920817,0.8465782,0.004898665,0.0007535519,0.0001957368,0.0003977267,0.001216585,0.1064743],"genre_scores_gemma":[0.6772385,0.00725218,0.2575746,0.002378505,0.002904705,0.0005559506,0.001025918,0.001399169,0.04967052],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0173301,"threshold_uncertainty_score":0.05797499,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002282589,0.0006451089,0.001247674,0.002280265,0.002474082,0.006249282,0.001955131,0.002182889,0.007462363],"category_scores_gemma":[0.00373632,0.0007200763,0.002291705,0.003015712,0.004775354,0.01186707,0.003135495,0.004372799,0.001105876],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001733913,"about_ca_system_score_gemma":0.001188386,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007950072,"about_ca_topic_score_gemma":0.0008858796,"domain_scores_codex":[0.9985078,0.0004184052,0.0001261711,0.0003463455,0.0004476699,0.0001536083],"domain_scores_gemma":[0.9970952,0.001561037,0.0001752759,0.0005181896,0.0003837574,0.0002664642],"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.00001143666,0.000006599066,0.00008118171,0.00001964024,0.000006586328,0.00002183939,0.00005433778,0.0003556002,0.0001891202,0.9960224,0.0006066849,0.002624493],"study_design_scores_gemma":[0.00001673902,0.00001202926,0.00005566486,0.00001492242,0.00001430181,0.00007477222,0.00004162566,0.003262065,0.0001737296,0.9917755,0.004550471,0.000008123538],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07667619,0.003884393,0.8262851,0.008144674,0.0008539173,0.00007047236,0.00126156,0.0006051272,0.08221859],"genre_scores_gemma":[0.7710561,0.002292253,0.2038762,0.001365427,0.001266708,0.0001392319,0.001058789,0.0001604972,0.01878483],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007462363,"threshold_uncertainty_score":0.02496403,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003703706,0.0006348402,0.001372744,0.002172079,0.002439197,0.006285293,0.002006652,0.002063529,0.004206175],"category_scores_gemma":[0.01068697,0.0008985085,0.001780289,0.002425395,0.01203185,0.01769237,0.005431055,0.006481477,0.001156631],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002722471,"about_ca_system_score_gemma":0.001875043,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002548642,"about_ca_topic_score_gemma":0.002602835,"domain_scores_codex":[0.9967189,0.001373988,0.0001975859,0.0006193955,0.0008347807,0.0002552262],"domain_scores_gemma":[0.9958854,0.002058589,0.0001587273,0.001162956,0.0005188876,0.0002153479],"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.00001357953,0.000009745392,0.00009735837,0.00002509304,0.000008607686,0.00001235476,0.0002174205,0.0001701359,0.00008490607,0.9953819,0.000841097,0.003137812],"study_design_scores_gemma":[0.00000615296,0.000003744665,0.0001138624,0.000008532637,0.000008960593,0.00002342609,0.0000501012,0.0005032716,0.0001044408,0.9952799,0.003891017,0.00000661834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.111967,0.01947002,0.6128904,0.04800564,0.002168098,0.0001627045,0.000697123,0.000718148,0.2039209],"genre_scores_gemma":[0.7950282,0.007107703,0.1573426,0.006321827,0.001434117,0.000174122,0.0007372228,0.0005676307,0.0312866],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006285293,"threshold_uncertainty_score":0.01975298,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00173166,0.000562225,0.0008360389,0.002085139,0.001953328,0.004468094,0.0006765031,0.0008028934,0.005820523],"category_scores_gemma":[0.00191029,0.0004033819,0.0008514877,0.001022047,0.004285434,0.008462515,0.002637622,0.003576508,0.0004743677],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001651933,"about_ca_system_score_gemma":0.0005999071,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006484295,"about_ca_topic_score_gemma":0.0006694551,"domain_scores_codex":[0.9992542,0.0002332023,0.00005434249,0.0001287966,0.0002185504,0.0001109169],"domain_scores_gemma":[0.9988698,0.0004240536,0.0001442605,0.0001060137,0.0001980378,0.000257773],"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.000007812925,0.000007807168,0.00005743481,0.000008713413,0.000002514834,0.00001075969,0.00008644423,0.0000549256,0.0001287799,0.998787,0.0001799955,0.0006678386],"study_design_scores_gemma":[0.00001329485,0.000007265113,0.00009314255,0.000005623137,0.000004408309,0.00003072919,0.0000785076,0.0004924967,0.0001458504,0.9974982,0.00162595,0.000004546348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5555204,0.007832703,0.1619095,0.007030765,0.0007929885,0.00007576172,0.0004549763,0.0002132998,0.2661695],"genre_scores_gemma":[0.960067,0.001464763,0.01308213,0.0004014484,0.000513985,0.000056918,0.0002114571,0.00003621114,0.02416596],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005820523,"threshold_uncertainty_score":0.01947153,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006257443,0.0003874497,0.0009717252,0.001998801,0.002217477,0.007270005,0.002177702,0.002407246,0.01131618],"category_scores_gemma":[0.02125869,0.001059461,0.001088309,0.001732037,0.01055809,0.01774141,0.003200128,0.003903241,0.001123185],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004037966,"about_ca_system_score_gemma":0.001772392,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003444855,"about_ca_topic_score_gemma":0.002810962,"domain_scores_codex":[0.9962294,0.001257936,0.0002614285,0.001218497,0.0006893643,0.0003433592],"domain_scores_gemma":[0.9709827,0.01962363,0.001136065,0.005703911,0.002048941,0.0005047446],"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.00002391519,0.00001446585,0.0003648509,0.00003291197,0.00001098697,0.00008743526,0.0004498441,0.0003912635,0.0001922036,0.9930228,0.0006745599,0.004734748],"study_design_scores_gemma":[0.00001076299,0.000003801911,0.0003418002,0.0000169678,0.000009492671,0.00007087859,0.00008562825,0.001357389,0.0002204879,0.9923453,0.005529646,0.0000079911],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1857345,0.01047649,0.2869652,0.03175868,0.0004849517,0.0001453696,0.0008924374,0.0007516786,0.4827908],"genre_scores_gemma":[0.9611249,0.001535241,0.02400971,0.0008080244,0.0002811695,0.00007076623,0.0002337653,0.0002337094,0.01170269],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01131618,"threshold_uncertainty_score":0.0378564,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00618017,0.0006659044,0.001074984,0.002344477,0.002773171,0.007678926,0.002004433,0.002172929,0.00551356],"category_scores_gemma":[0.01484211,0.001238361,0.001287992,0.002712499,0.01136897,0.02272148,0.003244234,0.007753057,0.0005249362],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002942231,"about_ca_system_score_gemma":0.001196915,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002391715,"about_ca_topic_score_gemma":0.001466765,"domain_scores_codex":[0.9953394,0.002301599,0.0003132773,0.0006445109,0.001047122,0.0003541774],"domain_scores_gemma":[0.9834816,0.01360214,0.0005200562,0.001033392,0.0009949259,0.0003679257],"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.0000143556,0.00001522269,0.0001748395,0.00003375273,0.000007843448,0.00003543185,0.0002770775,0.0005387785,0.00005639344,0.9957981,0.0004749386,0.002573414],"study_design_scores_gemma":[0.000004811407,0.000002488832,0.00004859849,0.000007582699,0.000004842626,0.0000160457,0.00004048843,0.001190576,0.00002884909,0.997713,0.0009395272,0.000003210071],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1689397,0.01982872,0.6359277,0.02663877,0.0007071495,0.0001006617,0.0005435327,0.0005302766,0.1467835],"genre_scores_gemma":[0.9387885,0.004009961,0.04819149,0.0007019371,0.0008174127,0.00008978679,0.0004329167,0.0000890449,0.006879063],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007678926,"threshold_uncertainty_score":0.03268427,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005528156,0.001274656,0.001672039,0.003388917,0.004414409,0.009869426,0.001751593,0.001494321,0.007221084],"category_scores_gemma":[0.00813459,0.001654819,0.002620301,0.002811427,0.007722183,0.01196711,0.004437416,0.004718902,0.001551463],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002505493,"about_ca_system_score_gemma":0.00214147,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001673755,"about_ca_topic_score_gemma":0.00161462,"domain_scores_codex":[0.9932903,0.002260509,0.0006333212,0.0009029587,0.002202302,0.000710479],"domain_scores_gemma":[0.9895601,0.005358088,0.0008810175,0.0007619192,0.001567515,0.001871379],"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.00008597266,0.00004016455,0.0001644945,0.00003317941,0.0000111105,0.00006407245,0.0003914431,0.000349119,0.001159467,0.9946154,0.0006502924,0.002435314],"study_design_scores_gemma":[0.00005234777,0.00002205546,0.000134417,0.00001161287,0.000007775157,0.00007918031,0.0001787873,0.00237376,0.0007639875,0.9936147,0.002745294,0.0000161616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2748363,0.002652155,0.58278,0.004187263,0.001115688,0.0002815166,0.001316575,0.00101527,0.1318152],"genre_scores_gemma":[0.799356,0.001437843,0.1668126,0.0006962215,0.001460107,0.0004401345,0.001621047,0.0004192869,0.02775667],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009869426,"threshold_uncertainty_score":0.02923602,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003003286,0.0009536821,0.001425934,0.002784651,0.00307711,0.007002317,0.002069385,0.002207709,0.006172919],"category_scores_gemma":[0.003684641,0.0009736894,0.002392311,0.002177755,0.006618323,0.01403761,0.004031894,0.005447531,0.001349988],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002893934,"about_ca_system_score_gemma":0.001473507,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001776667,"about_ca_topic_score_gemma":0.001436143,"domain_scores_codex":[0.9982658,0.0005448415,0.0001618442,0.0003272107,0.0004859253,0.000214411],"domain_scores_gemma":[0.9982333,0.000762565,0.0001384067,0.0003075654,0.0003496735,0.0002085453],"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.000007187225,0.000005462879,0.00002061907,0.00001549117,0.000003685341,0.00001939047,0.00008961574,0.0003242275,0.0001472878,0.9979908,0.0002639369,0.001112203],"study_design_scores_gemma":[0.00000940974,0.000005445883,0.00002421234,0.000009869058,0.000004468678,0.00002967545,0.00003248003,0.001288531,0.0001167383,0.995933,0.002535946,0.00001016139],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06167876,0.004271344,0.8261126,0.00668962,0.0006652623,0.0001473859,0.0007912582,0.0008540806,0.09878966],"genre_scores_gemma":[0.8012026,0.002491825,0.1753943,0.001366852,0.0007143893,0.0002311027,0.0004409279,0.0002797931,0.0178781],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007002317,"threshold_uncertainty_score":0.02099711,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009139575,0.001100169,0.001081609,0.002250607,0.00175745,0.003974334,0.003091412,0.001603558,0.003236123],"category_scores_gemma":[0.0374341,0.000993422,0.003143257,0.001250999,0.006040424,0.009147213,0.004672834,0.004026777,0.0004459203],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003643123,"about_ca_system_score_gemma":0.004434508,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01364704,"about_ca_topic_score_gemma":0.00763325,"domain_scores_codex":[0.9901231,0.002766004,0.0006806112,0.001701192,0.003363327,0.001365822],"domain_scores_gemma":[0.9720091,0.02003498,0.002344357,0.002426935,0.002367933,0.0008166345],"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.0004626922,0.000197315,0.004120662,0.0002632932,0.0001975372,0.001603745,0.003103711,0.1422998,0.01037306,0.8089967,0.0007087696,0.0276728],"study_design_scores_gemma":[0.000109851,0.000105033,0.0004024073,0.00006487004,0.00009591843,0.0001258429,0.0002317554,0.4684871,0.009198273,0.5188406,0.002276532,0.0000617423],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1565201,0.0002514038,0.8342321,0.001012994,0.00004528435,0.0001988823,0.0003264876,0.001946203,0.005466656],"genre_scores_gemma":[0.8372851,0.0002286406,0.1587651,0.0001679891,0.00005835532,0.0002143746,0.0005810161,0.0001526634,0.00254668],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01364704,"threshold_uncertainty_score":0.04833531,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008138843,0.000983865,0.001244642,0.00201575,0.003567587,0.003364719,0.002572765,0.003929957,0.03097934],"category_scores_gemma":[0.01816419,0.0005158414,0.00165404,0.001381834,0.008906685,0.01350204,0.003755804,0.005948514,0.004351372],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002136829,"about_ca_system_score_gemma":0.0007544449,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002493637,"about_ca_topic_score_gemma":0.001565509,"domain_scores_codex":[0.9965956,0.00108805,0.0002148562,0.0008568491,0.0009553343,0.000289372],"domain_scores_gemma":[0.9838778,0.01196379,0.0004900597,0.001331852,0.001876428,0.0004600128],"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.00006548904,0.00002463726,0.0002088369,0.00007442653,0.00002281883,0.0001392914,0.0002500855,0.0003167878,0.0001914459,0.9707126,0.02327166,0.004721887],"study_design_scores_gemma":[0.00002118287,0.00001081891,0.0003151242,0.00002541331,0.00001085087,0.00006080747,0.00006430062,0.000387388,0.0001380943,0.9768631,0.0220896,0.00001330258],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"commentary","genre_gemma":"empirical","genre_scores_codex":[0.02394764,0.01041677,0.115611,0.453196,0.01359003,0.00006492666,0.001246509,0.0008459812,0.3810812],"genre_scores_gemma":[0.6803157,0.009879201,0.06884359,0.09574758,0.03947209,0.000376071,0.001097315,0.0006169979,0.1036515],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03097934,"threshold_uncertainty_score":0.1036362,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006512366,0.001130788,0.002050833,0.00447993,0.003853119,0.004126805,0.002064569,0.002551191,0.008668369],"category_scores_gemma":[0.01022107,0.001274843,0.002424043,0.005949225,0.01934192,0.03849744,0.007479317,0.007764173,0.0008903472],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003315368,"about_ca_system_score_gemma":0.0009085992,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001829625,"about_ca_topic_score_gemma":0.001010385,"domain_scores_codex":[0.9970078,0.001035237,0.0002175365,0.0008237662,0.0004932174,0.0004224671],"domain_scores_gemma":[0.9907224,0.006361348,0.0004833527,0.001135328,0.0008072829,0.0004903345],"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.00000968214,0.000005847294,0.00007176847,0.00002119504,0.000005696375,0.00001549202,0.0001579696,0.00009090286,0.00008019579,0.9977865,0.0003273419,0.001427468],"study_design_scores_gemma":[0.000003724831,0.000003894442,0.00006435382,0.000007769103,0.000005659554,0.00001569492,0.00003189256,0.0001383767,0.00004346602,0.9984023,0.001278703,0.000004122065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2299704,0.03436917,0.3923278,0.03905058,0.002552777,0.0001235174,0.0007267074,0.0005597306,0.3003193],"genre_scores_gemma":[0.9516027,0.006137139,0.02053738,0.002920324,0.002504123,0.0001088226,0.0003235564,0.000177575,0.01568848],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008668369,"threshold_uncertainty_score":0.03444105,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003122654,0.0007297251,0.0009472201,0.003296908,0.003339371,0.006886105,0.001879318,0.00243922,0.01228414],"category_scores_gemma":[0.006006897,0.0007682102,0.001619689,0.002584357,0.01430626,0.02013977,0.004142892,0.005079941,0.002030852],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002890917,"about_ca_system_score_gemma":0.001528918,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001987852,"about_ca_topic_score_gemma":0.00137283,"domain_scores_codex":[0.9980409,0.0008967897,0.0001170185,0.0004371185,0.0003474039,0.0001607946],"domain_scores_gemma":[0.9966348,0.001807855,0.0001985026,0.0006162088,0.000552522,0.0001901134],"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.000001934185,0.000002235859,0.00002429986,0.000007809601,0.000001941906,0.000008820462,0.00006823915,0.000080358,0.00002946827,0.9980413,0.0006441779,0.001089421],"study_design_scores_gemma":[0.000005063258,0.000002419694,0.00002868567,0.000007823445,0.000003303692,0.00002109451,0.00004358339,0.0004435406,0.00004111,0.9943343,0.005066504,0.000002643044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01650587,0.007307502,0.7202633,0.02364466,0.0006269849,0.00005659695,0.0005326909,0.0006006983,0.2304617],"genre_scores_gemma":[0.7878792,0.004695557,0.1610604,0.004415607,0.001951116,0.0002958069,0.0008770013,0.0002821939,0.03854321],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01228414,"threshold_uncertainty_score":0.04109448,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002117745,0.0006138828,0.0006081252,0.001607186,0.001462215,0.003289152,0.001248101,0.001338684,0.007296455],"category_scores_gemma":[0.003475528,0.0003663703,0.001290312,0.001329032,0.004076657,0.009263404,0.002429473,0.002519646,0.0006933817],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002648748,"about_ca_system_score_gemma":0.001246459,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004605194,"about_ca_topic_score_gemma":0.002204068,"domain_scores_codex":[0.9976733,0.0006532133,0.0001534105,0.0004896451,0.0006741674,0.0003561475],"domain_scores_gemma":[0.9979191,0.0009010367,0.0001434112,0.0002775732,0.0004309721,0.0003277522],"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.000006037518,0.000008903365,0.00009853928,0.00001186504,0.000003394796,0.00002887638,0.0002247311,0.0005526133,0.0001877534,0.9958568,0.000293841,0.002726652],"study_design_scores_gemma":[0.000006483789,0.00001405033,0.0002430517,0.000009736151,0.000005398043,0.00004678918,0.00008922861,0.0053236,0.0002169502,0.9889443,0.005090842,0.000009655844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1620343,0.001064955,0.72637,0.002249567,0.0002043679,0.0001820309,0.001006088,0.0008346679,0.1060541],"genre_scores_gemma":[0.9021135,0.000701936,0.07080927,0.0007036941,0.0001750947,0.0003377098,0.0009249698,0.0001674512,0.02406644],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007296455,"threshold_uncertainty_score":0.02440906,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003960615,0.0006753915,0.00100479,0.001833867,0.003444149,0.006983542,0.003107928,0.002279561,0.009542574],"category_scores_gemma":[0.01008934,0.00119101,0.003921376,0.00182456,0.004848388,0.01265627,0.003537851,0.006721123,0.0009616357],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00371712,"about_ca_system_score_gemma":0.002527162,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005959975,"about_ca_topic_score_gemma":0.005590818,"domain_scores_codex":[0.9964159,0.0008849505,0.0003216107,0.0007846929,0.001116387,0.0004764021],"domain_scores_gemma":[0.991013,0.006756329,0.0003520392,0.0007089477,0.0008436487,0.0003260649],"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.00007376903,0.0000664014,0.0004932618,0.00009432746,0.00003684277,0.0001365975,0.0004057193,0.001865055,0.0006736097,0.9855943,0.002905118,0.007654974],"study_design_scores_gemma":[0.00005163902,0.0000156473,0.0002259821,0.00002697739,0.00005211049,0.00009976814,0.0001072541,0.01395106,0.001439711,0.9782653,0.005748075,0.00001651748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2349539,0.0031939,0.530058,0.0150618,0.0008316818,0.0003092081,0.00287374,0.002541462,0.2101763],"genre_scores_gemma":[0.8691458,0.001218149,0.08785669,0.002042752,0.0007283866,0.000206143,0.003718403,0.0002989006,0.03478481],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009542574,"threshold_uncertainty_score":0.03192312,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001582921,0.0009694152,0.001527627,0.003615269,0.003070437,0.003351279,0.001628504,0.001914651,0.01091267],"category_scores_gemma":[0.006268019,0.0008584355,0.003162652,0.003245336,0.004936856,0.01250053,0.007708545,0.005253456,0.001100372],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002033766,"about_ca_system_score_gemma":0.0006900221,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001584552,"about_ca_topic_score_gemma":0.001161015,"domain_scores_codex":[0.9988235,0.0002618224,0.00006980455,0.0003413004,0.0003518045,0.000151806],"domain_scores_gemma":[0.9965658,0.002259207,0.0001104061,0.000413718,0.0004106368,0.0002402521],"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.00002058407,0.00001413022,0.0001808092,0.00006274162,0.00001873254,0.00008425346,0.0002451269,0.0005722863,0.0006121167,0.9866297,0.002400402,0.009159165],"study_design_scores_gemma":[0.000008931071,0.00001357778,0.0002030044,0.00001400699,0.00002244821,0.0001334502,0.00005171799,0.002590797,0.0004188169,0.9855227,0.01101149,0.000009011752],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0658718,0.007228128,0.6937968,0.01587539,0.003820971,0.0001128061,0.0006070919,0.0007975543,0.2118895],"genre_scores_gemma":[0.7605252,0.008275992,0.139125,0.00551226,0.006744983,0.0003500594,0.0007598773,0.000723973,0.07798274],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01091267,"threshold_uncertainty_score":0.03650647,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004308639,0.0008917612,0.001433035,0.002928352,0.002826614,0.004380778,0.001424667,0.00166846,0.007047413],"category_scores_gemma":[0.005066484,0.001166299,0.002096316,0.00188891,0.0058434,0.01881251,0.005326758,0.008733471,0.001141365],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001634047,"about_ca_system_score_gemma":0.001224289,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009413451,"about_ca_topic_score_gemma":0.001006892,"domain_scores_codex":[0.9978886,0.00065801,0.0001243044,0.0004655535,0.00061018,0.000253395],"domain_scores_gemma":[0.9938153,0.003839932,0.0002023419,0.0007605579,0.001005208,0.0003766483],"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.00002658904,0.00002643928,0.0001350696,0.00004667257,0.00001323139,0.00002072458,0.0001338564,0.0002454035,0.000256828,0.9936944,0.001552022,0.003848813],"study_design_scores_gemma":[0.00001712072,0.000005559396,0.00008504408,0.000008672594,0.000008674273,0.00003536429,0.00003056511,0.001003794,0.0002525684,0.9960809,0.00246565,0.000006018954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1422457,0.00602067,0.5012046,0.01342988,0.0009730472,0.0001334086,0.001636197,0.0008708267,0.3334857],"genre_scores_gemma":[0.8643344,0.003239912,0.09119862,0.002384723,0.00146752,0.0002653212,0.001649269,0.0004704804,0.03498968],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007047413,"threshold_uncertainty_score":0.02357596,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005939461,0.0007166353,0.0009639316,0.001963248,0.002501744,0.004474092,0.00168225,0.003047644,0.01371171],"category_scores_gemma":[0.02899784,0.0005136291,0.001407635,0.001296994,0.008611471,0.01005257,0.003097084,0.008009921,0.001847284],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00406148,"about_ca_system_score_gemma":0.001562374,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002532677,"about_ca_topic_score_gemma":0.001931579,"domain_scores_codex":[0.9953527,0.001949965,0.0001901307,0.001118687,0.001029896,0.0003585906],"domain_scores_gemma":[0.9868025,0.007479594,0.0006809725,0.002371007,0.002195426,0.0004704579],"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.00002947044,0.00001637538,0.0001751023,0.00002052897,0.00001817561,0.00003602483,0.0002401716,0.0003292297,0.00007228301,0.9919836,0.001320334,0.005758806],"study_design_scores_gemma":[0.00001084231,0.000005068618,0.00009558319,0.000007602318,0.000008820331,0.00003737078,0.000043069,0.001127542,0.00007909961,0.9958645,0.002716434,0.000003985482],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05590477,0.006250118,0.4575361,0.06222343,0.001135292,0.0001737883,0.0006957349,0.0004059103,0.4156749],"genre_scores_gemma":[0.9066115,0.001905792,0.04886669,0.003287834,0.0006908955,0.0002022618,0.000406429,0.0001028529,0.03792567],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01371171,"threshold_uncertainty_score":0.0458703,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004572568,0.001091857,0.00133631,0.002593032,0.002954087,0.006976961,0.0032752,0.003090716,0.009175087],"category_scores_gemma":[0.009333911,0.0009801997,0.002490384,0.002121367,0.008924989,0.01378684,0.004778886,0.006765421,0.001063097],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002995831,"about_ca_system_score_gemma":0.001629806,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001669705,"about_ca_topic_score_gemma":0.001642573,"domain_scores_codex":[0.9965953,0.001529647,0.0001822157,0.0003349337,0.0008299889,0.0005278335],"domain_scores_gemma":[0.9935399,0.004218464,0.0002800944,0.000842815,0.0006719104,0.0004468842],"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.00001673804,0.00001226862,0.00003092005,0.00001855443,0.000004373481,0.00002244283,0.00014823,0.0002726866,0.0001197981,0.9977302,0.0003570161,0.001266691],"study_design_scores_gemma":[0.00002342171,0.00000831663,0.00004304569,0.00001402417,0.000007264992,0.00002574752,0.00005318506,0.001741355,0.0001903032,0.9955761,0.002308913,0.000008404351],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05955892,0.004400657,0.7709972,0.008650854,0.001346524,0.0002016345,0.0004735567,0.0008603903,0.1535103],"genre_scores_gemma":[0.7973654,0.001576608,0.1740051,0.00153838,0.0007135362,0.0002262913,0.0005181106,0.0003128168,0.02374367],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009175087,"threshold_uncertainty_score":0.03069377,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003333252,0.0005705055,0.0009130529,0.002892039,0.001876746,0.006623639,0.001950824,0.001789685,0.01184747],"category_scores_gemma":[0.01393228,0.0007673209,0.001270459,0.003222129,0.00285162,0.01642618,0.003434518,0.001913929,0.0009694392],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002232982,"about_ca_system_score_gemma":0.001078534,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002297511,"about_ca_topic_score_gemma":0.001938699,"domain_scores_codex":[0.997475,0.0007808014,0.000215553,0.0005082165,0.0006497588,0.000370733],"domain_scores_gemma":[0.9934682,0.003189118,0.0007994521,0.001094056,0.0009845272,0.0004646684],"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.0001112638,0.00003200836,0.0003217736,0.00003249324,0.00001287633,0.00004136766,0.000242745,0.001289062,0.0006346157,0.9876381,0.0005234823,0.009120218],"study_design_scores_gemma":[0.00002191362,0.0000303386,0.0001716281,0.00001435552,0.00002347835,0.00004707438,0.0001793858,0.007254689,0.001090756,0.9884484,0.002705681,0.00001232586],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3019122,0.001051306,0.6463995,0.001496037,0.0001870927,0.0001292264,0.0007901059,0.0007920829,0.04724247],"genre_scores_gemma":[0.9007405,0.0005623306,0.08600013,0.000225448,0.000152172,0.0001176435,0.001061575,0.0002289708,0.01091118],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01184747,"threshold_uncertainty_score":0.03963375,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004872282,0.0005634102,0.0008321239,0.001289001,0.004982411,0.006810773,0.001792836,0.007960255,0.007274228],"category_scores_gemma":[0.01821047,0.0006238858,0.0006158118,0.002545598,0.01726326,0.01777873,0.002567946,0.006685767,0.0007058007],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002682021,"about_ca_system_score_gemma":0.002527643,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009006854,"about_ca_topic_score_gemma":0.01249239,"domain_scores_codex":[0.9977893,0.001349492,0.0000917404,0.0002932919,0.0003489215,0.0001273457],"domain_scores_gemma":[0.9878981,0.0105263,0.0003885713,0.0003995498,0.00056865,0.0002187992],"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.00002549655,0.00001281692,0.00009362716,0.00005657067,0.00001300577,0.00006279551,0.0008488251,0.0004495771,0.00005355206,0.9778453,0.01711052,0.003427872],"study_design_scores_gemma":[0.00001725596,0.000002339776,0.00007558917,0.00003546109,0.000006669674,0.00001976557,0.000338069,0.0004019703,0.00004761629,0.9857786,0.01326969,0.000007046837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"commentary","genre_gemma":"empirical","genre_scores_codex":[0.03128698,0.1257465,0.0791721,0.5100406,0.003870947,0.00006962045,0.0003297577,0.0001093405,0.2493743],"genre_scores_gemma":[0.8398728,0.04538507,0.03717064,0.03436817,0.005874713,0.0002030205,0.0001170793,0.0001507003,0.0368579],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009006854,"threshold_uncertainty_score":0.02576739,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003154999,0.001625643,0.001815659,0.002902606,0.002159395,0.008200889,0.002035388,0.003519869,0.08914344],"category_scores_gemma":[0.007736248,0.000632045,0.001948795,0.002143599,0.001882116,0.006243661,0.002968973,0.006215617,0.02154983],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003308381,"about_ca_system_score_gemma":0.002929569,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009527485,"about_ca_topic_score_gemma":0.001131154,"domain_scores_codex":[0.996383,0.0007601976,0.0003521267,0.0006408295,0.001576809,0.0002870388],"domain_scores_gemma":[0.9939023,0.00289148,0.0003234851,0.0006223107,0.001491038,0.0007694485],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00003668756,0.00005599534,0.0001584361,0.0007080759,0.00004699554,0.0001869217,0.0001650206,0.0003668849,0.0003976612,0.04493166,0.9122027,0.04074297],"study_design_scores_gemma":[0.000009565188,0.00002451069,0.0002196861,0.0002673966,0.00001401678,0.0002061871,0.00004212815,0.0003005277,0.00009147483,0.01770219,0.9811133,0.000009058021],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"editorial","genre_scores_codex":[0.001436623,0.1179469,0.01687671,0.05712335,0.6355832,0.0002527636,0.001042577,0.0006621864,0.1690757],"genre_scores_gemma":[0.01543349,0.08012757,0.006524354,0.01395816,0.6683714,0.0003227442,0.002116883,0.001138496,0.2120068],"genre_candidate":"editorial","genre_consensus":"editorial","teacher_disagreement_score":0.08914344,"threshold_uncertainty_score":0.2982145,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00348287,0.0006973426,0.0008771151,0.002197884,0.003375762,0.006684186,0.001083076,0.004883952,0.004684005],"category_scores_gemma":[0.0081381,0.0008195146,0.0005727242,0.002315006,0.01123466,0.01424434,0.001871191,0.007793402,0.001563207],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003658892,"about_ca_system_score_gemma":0.001742785,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00539012,"about_ca_topic_score_gemma":0.0066585,"domain_scores_codex":[0.9984086,0.00085161,0.00008011275,0.0002396453,0.0003435119,0.00007653909],"domain_scores_gemma":[0.9978451,0.001447605,0.0001141625,0.0001809526,0.0003380218,0.00007407423],"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.00002107686,0.000009903883,0.00005849042,0.00005201967,0.000007671199,0.00001648194,0.0005417314,0.0001357885,0.00006567667,0.9674521,0.0262762,0.005362818],"study_design_scores_gemma":[0.00001527274,0.000004752557,0.0001144776,0.00007614468,0.000005135443,0.00003126173,0.0002230861,0.0001411718,0.00007283474,0.9451433,0.05416316,0.000009543667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"review","genre_gemma":"empirical","genre_scores_codex":[0.007145574,0.5169696,0.05347874,0.225323,0.004190693,0.00005263399,0.0005702297,0.0003457053,0.1919238],"genre_scores_gemma":[0.5747783,0.1835835,0.04394228,0.04082755,0.01285463,0.0002310238,0.0004013297,0.0005422636,0.1428391],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006684186,"threshold_uncertainty_score":0.02654725,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001169364,0.0009719423,0.001205614,0.002528641,0.002850555,0.005350399,0.001083991,0.001790421,0.01090362],"category_scores_gemma":[0.001893032,0.0006841404,0.0009958361,0.003221901,0.004163076,0.01125641,0.00184741,0.003623751,0.00135256],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002459787,"about_ca_system_score_gemma":0.0008018513,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002703618,"about_ca_topic_score_gemma":0.002053091,"domain_scores_codex":[0.999238,0.000251602,0.00005100386,0.0001759392,0.0001824462,0.0001010054],"domain_scores_gemma":[0.999352,0.000257511,0.00008393906,0.00008328107,0.0001289842,0.00009420886],"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.000005707223,0.000004258904,0.00002839731,0.000007993583,0.000003248914,0.000008912818,0.00007202401,0.00007404247,0.00006130118,0.9980425,0.0005088203,0.001182759],"study_design_scores_gemma":[0.0000041802,0.000002541549,0.000037349,0.000004738834,0.000004198623,0.000011685,0.0000301301,0.0001986494,0.00002767682,0.9963708,0.003305283,0.000002947821],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1736608,0.04477477,0.2472303,0.01870257,0.002352094,0.00009190765,0.001322179,0.0005564524,0.5113091],"genre_scores_gemma":[0.9002643,0.009526243,0.02147822,0.001187704,0.002354692,0.0001052292,0.0009780583,0.0001289713,0.06397657],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01090362,"threshold_uncertainty_score":0.03647625,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002418089,0.0008435457,0.001042859,0.003279594,0.001935313,0.006169802,0.001463015,0.00131813,0.01098234],"category_scores_gemma":[0.004240534,0.0007016904,0.001477351,0.002880663,0.003670972,0.01346423,0.002856101,0.002735666,0.0009609533],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002368306,"about_ca_system_score_gemma":0.0007930645,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001520783,"about_ca_topic_score_gemma":0.001728585,"domain_scores_codex":[0.9985909,0.000479153,0.0001027863,0.0002860845,0.0003756403,0.0001653862],"domain_scores_gemma":[0.9971209,0.001457872,0.0003140413,0.000335344,0.0004606372,0.0003111781],"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.00001756777,0.000008140586,0.00004759785,0.00001422622,0.000005493381,0.00001477779,0.00008407968,0.0002851571,0.0001180819,0.9970409,0.000264176,0.002099796],"study_design_scores_gemma":[0.00001015054,0.000009260818,0.00005574888,0.000007446501,0.00001009987,0.00002038479,0.00005175487,0.002095912,0.0001890109,0.9954469,0.002097677,0.000005666313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1251503,0.004017882,0.770256,0.002569989,0.0003349721,0.00008241979,0.0007228766,0.0005705392,0.09629495],"genre_scores_gemma":[0.8486773,0.002156459,0.1266613,0.0004308039,0.0005250342,0.0001663738,0.0008838372,0.0002444273,0.02025441],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01098234,"threshold_uncertainty_score":0.03673959,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003306147,0.000476778,0.0008617489,0.0009568836,0.001551139,0.004737347,0.002004384,0.001374606,0.003617845],"category_scores_gemma":[0.003993308,0.0005297874,0.001592232,0.001367822,0.005539389,0.008340206,0.002716644,0.003466224,0.0003264691],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002329445,"about_ca_system_score_gemma":0.001716205,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003484623,"about_ca_topic_score_gemma":0.002899733,"domain_scores_codex":[0.9974952,0.0005555591,0.0001723116,0.000517217,0.0007466964,0.0005131783],"domain_scores_gemma":[0.9959472,0.001478233,0.0003845469,0.001227726,0.0005904959,0.0003717969],"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.00007305637,0.00004079588,0.000284503,0.00004127055,0.00002377325,0.0002597923,0.0001862877,0.00513537,0.002032217,0.9892949,0.0005566702,0.002071241],"study_design_scores_gemma":[0.0001673213,0.0000895335,0.0004946332,0.00002035147,0.00007548967,0.0002790888,0.0001425978,0.04649161,0.004803111,0.9353398,0.01203956,0.0000569311],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.376365,0.0005067161,0.5431035,0.00307971,0.0004070328,0.0002475354,0.001063049,0.001393595,0.07383399],"genre_scores_gemma":[0.9419135,0.0001378306,0.05169553,0.0005154936,0.0001930337,0.00007043244,0.0003939755,0.0000698068,0.005010466],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004737347,"threshold_uncertainty_score":0.01748478,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}