{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":18,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":18,"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":"a893618bd9ea","filters":{"venue":"The Review of Symbolic Logic"}},"results":[{"id":"W2171830434","doi":"10.1017/s1755020309990311","title":"PASCH’S PHILOSOPHY OF MATHEMATICS","year":2010,"lang":"en","type":"article","venue":"The Review of Symbolic Logic","topic":"History and Theory of Mathematics","field":"Mathematics","cited_by":35,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Empiricism; Epistemology; Philosophy of mathematics; Philosophy; Mathematics; Calculus (dental); Medicine","authors":[{"name":"Dirk Schlimm","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05850898310340925,"gpt":0.3173999444220414,"spread":0.2588909613186322,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002529657,0.0002095407,0.0008882617,0.00005294233,0.00007459724,0.000003530757,0.0007505235,0.00009162683,0.001041562],"category_scores_gemma":[0.001595465,0.0001196281,0.0003193257,0.0002212982,0.0004451534,0.00004862095,0.00009555649,0.0003168924,0.00009997931],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000935238,"about_ca_system_score_gemma":0.00004900935,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000154609,"about_ca_topic_score_gemma":0.000001245923,"domain_scores_codex":[0.9982233,0.0001368683,0.0009392392,0.0001392331,0.0003726528,0.0001887105],"domain_scores_gemma":[0.9968245,0.0009578852,0.0008239918,0.001175944,0.0001596724,0.00005801799],"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.000002089111,0.0002978276,0.000003062276,0.02675971,0.0000462229,0.000001069234,0.0007591804,7.184482e-8,0.001287548,0.968571,0.001234521,0.001037706],"study_design_scores_gemma":[0.000142057,0.00004815172,0.000007252013,0.004785704,0.0002179471,0.00004682932,0.00007475824,0.00001150515,0.001141918,0.9864951,0.006891803,0.0001369422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2751939,0.07171641,0.002941237,0.006890101,0.001414802,0.004897974,0.00008096047,0.0003779716,0.6364866],"genre_scores_gemma":[0.8762112,0.0298848,0.08920231,0.001791184,0.0005876392,0.0001400619,0.00000834309,0.0001550329,0.002019414],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6344672,"threshold_uncertainty_score":0.9998716,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2161181571","doi":"10.1017/s175502031300018x","title":"STRUCTURAL EQUATIONS AND BEYOND","year":2013,"lang":"en","type":"article","venue":"The Review of Symbolic Logic","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Counterfactual thinking; Causation; Element (criminal law); Modalities; Causal model; Similarity (geometry); Counterfactual conditional; Ranking (information retrieval); Modality (human–computer interaction); Normality; Mathematical economics; Mathematics; Computer science; Epistemology; Artificial intelligence; Philosophy; Image (mathematics); Statistics; Sociology; Law","authors":[{"name":"Franz Huber","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03580201131816115,"gpt":0.2812095219799628,"spread":0.2454075106618016,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002403942,0.0000691873,0.0001592046,0.00001571681,0.00006619098,0.0000359245,0.0004686758,0.0000178958,0.00006531302],"category_scores_gemma":[0.00006062403,0.00003645934,0.00003402699,0.0001579876,0.00006948005,0.0001521451,0.0001248968,0.00006811687,0.00005951886],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004146239,"about_ca_system_score_gemma":0.00002230538,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003145114,"about_ca_topic_score_gemma":3.027206e-7,"domain_scores_codex":[0.9994101,0.00006792733,0.0001839218,0.0001186204,0.0001099449,0.0001094966],"domain_scores_gemma":[0.999365,0.00008992665,0.00007792645,0.0003559562,0.00007360718,0.00003762967],"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":[9.093063e-8,0.000005006902,0.00001841839,0.0004780289,0.000007540167,1.978537e-7,0.0002187777,0.000005603727,0.0001491585,0.8237891,0.0007754864,0.1745527],"study_design_scores_gemma":[0.000136309,0.00009208485,0.003867355,0.001675095,0.00004290104,0.00005460145,0.0000328513,0.08754799,0.0001355145,0.905439,0.0006966999,0.0002795545],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02042156,0.3117821,0.5873774,0.05872061,0.0002981402,0.001250806,0.000003659227,0.0001846088,0.01996116],"genre_scores_gemma":[0.9741349,0.01555494,0.006391094,0.003795285,0.00003248098,0.00002405376,8.603494e-7,0.000002722284,0.00006363332],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9537134,"threshold_uncertainty_score":0.1486769,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2142696533","doi":"10.1017/s1755020313000087","title":"STRONG COMPLETENESS OF S4 FOR ANY DENSE-IN-ITSELF METRIC SPACE","year":2013,"lang":"en","type":"article","venue":"The Review of Symbolic Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Completeness (order theory); Real line; Metric space; Mathematics; Space (punctuation); Metric (unit); Pure mathematics; Discrete mathematics; Mathematical analysis; Computer science","authors":[{"name":"Philip Kremer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03361757587215217,"gpt":0.2871383618909682,"spread":0.253520786018816,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001217676,0.0001874291,0.0007731751,0.0001313187,0.00006103583,0.00002547099,0.001492255,0.00005236896,0.00006094484],"category_scores_gemma":[0.0003834036,0.0001069901,0.0002252334,0.001095632,0.0001123175,0.0001684711,0.0002548795,0.0001060047,0.00006513482],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003476791,"about_ca_system_score_gemma":0.00007710767,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001018785,"about_ca_topic_score_gemma":0.000006690937,"domain_scores_codex":[0.998327,0.000212276,0.0005626407,0.0002882985,0.0002429752,0.0003667899],"domain_scores_gemma":[0.9979143,0.0005236989,0.0004011378,0.0007992875,0.0002949413,0.00006669361],"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.00000462354,0.0002651254,0.001934955,0.009649805,0.00007292467,0.000002453037,0.0007514281,0.0000285188,0.0005521053,0.9116104,0.00298882,0.07213881],"study_design_scores_gemma":[0.008148315,0.003501705,0.3208154,0.04151319,0.001081468,0.0004220326,0.001005694,0.06324159,0.01204761,0.458898,0.08490536,0.00441963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"review","genre_gemma":"empirical","genre_scores_codex":[0.04546193,0.7175482,0.1836225,0.006527205,0.0008703002,0.00668136,0.00001591809,0.0002004154,0.03907218],"genre_scores_gemma":[0.9698887,0.02249255,0.006731173,0.000480079,0.00006734139,0.0001426638,0.000002193186,0.00001195008,0.0001833784],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9244267,"threshold_uncertainty_score":0.4362929,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2997587333","doi":"10.1017/s1755020320000015","title":"CUT ELIMINATION AND NORMALIZATION FOR GENERALIZED SINGLE AND MULTI-CONCLUSION SEQUENT AND NATURAL DEDUCTION CALCULI","year":2020,"lang":"en","type":"article","venue":"The Review of Symbolic Logic","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Natural deduction; Sequent; Sequent calculus; Cut-elimination theorem; Mathematics; Curry–Howard correspondence; Normalization (sociology); Calculus (dental); Mathematical proof; Discrete mathematics; Proof calculus","authors":[{"name":"Richard Zach","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04934596361689004,"gpt":0.2914881138129571,"spread":0.2421421501960671,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004045575,0.0001004809,0.0002283689,0.00002133571,0.0001279177,0.00004579558,0.0001305315,0.00003550289,0.000001167842],"category_scores_gemma":[0.0001110568,0.00006042947,0.00003452251,0.0001425731,0.00006512229,0.0001731432,0.0001343061,0.00004302058,8.156588e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001575256,"about_ca_system_score_gemma":0.00001383445,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002502699,"about_ca_topic_score_gemma":0.000003568965,"domain_scores_codex":[0.9992208,0.0001137353,0.000237001,0.0002115657,0.0001092917,0.0001076433],"domain_scores_gemma":[0.9995174,0.00003885938,0.0001754053,0.0001227037,0.0000975601,0.00004810354],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002410315,0.00009293215,0.0002663264,0.01383334,0.00005493782,0.000002249774,0.006336958,0.0000151312,0.01564351,0.4640324,0.000357192,0.4993409],"study_design_scores_gemma":[0.01040021,0.00373948,0.01021319,0.003732596,0.001234312,0.001171156,0.0009892751,0.7746158,0.02965439,0.05611265,0.1055732,0.002563687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03787073,0.3374748,0.6074495,0.0139823,0.0004310248,0.002556633,0.000002205368,0.0001241413,0.0001086198],"genre_scores_gemma":[0.9680675,0.02586516,0.004695439,0.001219939,0.00008374164,0.00003157573,0.000009861261,0.000005282548,0.00002152243],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9301968,"threshold_uncertainty_score":0.2464242,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2331774924","doi":"10.1017/s1755020312000147","title":"CATEGORICAL FOUNDATIONS OF MATHEMATICS OR HOW TO PROVIDE FOUNDATIONS FOR<i>ABSTRACT</i>MATHEMATICS","year":2012,"lang":"en","type":"article","venue":"The Review of Symbolic Logic","topic":"History and Theory of Mathematics","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Argument (complex analysis); Context (archaeology); Categorical variable; Epistemology; Mathematics; Philosophy; Biology; Statistics","authors":[{"name":"Jean‐Pierre Marquis","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1516410242589306,"gpt":0.3798600361578378,"spread":0.2282190118989072,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003660414,0.0003545599,0.001224652,0.0001233994,0.0002538036,0.0000241569,0.0007936836,0.0001165268,0.0004237578],"category_scores_gemma":[0.007752966,0.0002077818,0.0004221157,0.0005299826,0.0002674227,0.0002341127,0.000131254,0.0001912625,0.00009322554],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009733796,"about_ca_system_score_gemma":0.0001792556,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003048198,"about_ca_topic_score_gemma":0.000006686681,"domain_scores_codex":[0.9972617,0.0001308548,0.001390827,0.0002034854,0.0005272452,0.0004858995],"domain_scores_gemma":[0.9928603,0.004136355,0.001200151,0.001194459,0.0004193685,0.0001893486],"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.000009519004,0.00123664,0.000003340937,0.03717081,0.0001301461,4.132962e-7,0.005281094,0.000001348512,0.0003515044,0.9471277,0.0068981,0.001789386],"study_design_scores_gemma":[0.0004663049,0.000256307,0.00001742608,0.006197663,0.001282242,0.0001239099,0.002202715,0.000105415,0.0009437143,0.9119144,0.07597096,0.0005189058],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05538504,0.03512101,0.7757422,0.02557257,0.002197248,0.0322544,0.0004714924,0.0008069079,0.07244908],"genre_scores_gemma":[0.3737127,0.006464866,0.6084,0.001376726,0.0007628814,0.001731829,0.00006160117,0.0002533206,0.007235972],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3183277,"threshold_uncertainty_score":0.9281585,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2024618947","doi":"10.1017/s1755020309090145","title":"RELEVANCE LOGICS AND RELATION ALGEBRAS","year":2009,"lang":"en","type":"article","venue":"The Review of Symbolic Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Soundness; Relevance (law); Relation (database); Mathematics; Completeness (order theory); Semantics (computer science); Fragment (logic); Algebra over a field; Discrete mathematics; Computer science; Pure mathematics; Algorithm; Programming language; Data mining","authors":[{"name":"Katalin Bimbó","is_ca":true},{"name":"J. Michael Dunn","is_ca":false},{"name":"Roger D. Maddux","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01816040036287025,"gpt":0.2665663432064008,"spread":0.2484059428435305,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007045098,0.0001351735,0.0003244416,0.0000283133,0.000103092,0.00002691047,0.0006655969,0.00005152675,0.00001482372],"category_scores_gemma":[0.0003612744,0.00007410804,0.00008055115,0.0003750249,0.00008513744,0.000184053,0.0001134801,0.0001353897,0.00006006842],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001702166,"about_ca_system_score_gemma":0.00003134821,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002363036,"about_ca_topic_score_gemma":3.696483e-7,"domain_scores_codex":[0.9989184,0.0001506078,0.0003097773,0.0002460596,0.0001824095,0.0001928071],"domain_scores_gemma":[0.998888,0.0001688613,0.0002185756,0.0005887169,0.00008448905,0.00005141828],"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.000001057528,0.00002794719,0.00009235702,0.0003690478,0.000005298849,0.000002581952,0.00023052,0.000001377876,0.00007900404,0.8635775,0.0007217639,0.1348915],"study_design_scores_gemma":[0.0004623554,0.0005563544,0.05102218,0.003929095,0.00009534344,0.0003096276,0.00001894283,0.002402883,0.0003447619,0.8909509,0.04938417,0.0005234423],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"review","genre_gemma":"empirical","genre_scores_codex":[0.006392378,0.82627,0.04797911,0.01653359,0.0002923371,0.0008841691,0.000001135468,0.0002436016,0.1014037],"genre_scores_gemma":[0.702321,0.2879952,0.004869755,0.004406856,0.00009215696,0.000008331831,0.000001622829,0.000004883814,0.0003001493],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.6959286,"threshold_uncertainty_score":0.3022038,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3043284895","doi":"10.1017/s1755020321000216","title":"QUANTIFIED MODAL RELEVANT LOGICS","year":2021,"lang":"en","type":"article","venue":"The Review of Symbolic Logic","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Modal; Normal modal logic; Semantics (computer science); Converse; Accessibility relation; Modal logic; Kripke semantics; Computer science; S5; Algorithm; Calculus (dental); Mathematics; Theoretical computer science; Pure mathematics; Description logic; Multimodal logic; Programming language; Medicine; Geometry; Chemistry","authors":[{"name":"Nicholas Ferenz","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04842376448480241,"gpt":0.2930851429104004,"spread":0.244661378425598,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00132885,0.0001727695,0.00054146,0.00002740951,0.000110023,0.0000610827,0.001211152,0.00006608152,0.00006417665],"category_scores_gemma":[0.0002860626,0.00009392593,0.0002341822,0.0006239942,0.0001003522,0.0001076794,0.0003731739,0.0001678475,0.0002400217],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002171586,"about_ca_system_score_gemma":0.0001386386,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002538167,"about_ca_topic_score_gemma":0.000003280745,"domain_scores_codex":[0.9980379,0.0003888221,0.0005356506,0.0003582685,0.0003701673,0.0003092291],"domain_scores_gemma":[0.9979909,0.0001573665,0.0002862439,0.001272692,0.0002256514,0.00006715522],"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":[7.82458e-7,0.00005879133,0.00003744768,0.001779467,0.00002556869,0.00003108676,0.0001673257,0.000002814074,0.0002267663,0.9635051,0.001118512,0.03304633],"study_design_scores_gemma":[0.0006445191,0.0003154352,0.001249406,0.002133872,0.0001852321,0.0009689304,0.0001740747,0.001969654,0.003938611,0.6131833,0.3743523,0.0008846335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"review","genre_gemma":"empirical","genre_scores_codex":[0.0009835624,0.6765035,0.2497145,0.01359807,0.001647973,0.001170038,0.000002521222,0.0003467247,0.05603312],"genre_scores_gemma":[0.8789881,0.1120717,0.003485159,0.004084915,0.0001894343,0.0000448473,0.000007921638,0.00001415336,0.001113676],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8780046,"threshold_uncertainty_score":0.3830189,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2331073395","doi":"10.1017/s1755020314000021","title":"QUANTIFIED MODAL LOGIC ON THE RATIONAL LINE","year":2014,"lang":"en","type":"article","venue":"The Review of Symbolic Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Modal logic; Mathematics; Multimodal logic; Linear subspace; Normal modal logic; Class (philosophy); Real line; Line (geometry); Topological space; S5; Dynamic logic (digital electronics); Topology (electrical circuits); Modal; Pure mathematics; Discrete mathematics; Computer science; Theoretical computer science; Artificial intelligence; Combinatorics; Physics; Description logic","authors":[{"name":"Philip Kremer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04627299118960957,"gpt":0.288253351698684,"spread":0.2419803605090745,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002422391,0.0001924196,0.0004067207,0.0000337188,0.0002133059,0.00004956776,0.001792186,0.00005293975,0.0001509941],"category_scores_gemma":[0.0007379641,0.00007938755,0.0002035461,0.0003959245,0.0001660479,0.00008198831,0.0002445055,0.0002098178,0.0005497147],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001879421,"about_ca_system_score_gemma":0.0000635509,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007551049,"about_ca_topic_score_gemma":0.000001921595,"domain_scores_codex":[0.9980991,0.0005651357,0.0004039461,0.0003032093,0.0003679482,0.0002606353],"domain_scores_gemma":[0.997661,0.0007860676,0.0002690211,0.001083837,0.0001463878,0.00005369475],"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.000002066984,0.00005583369,0.00001083903,0.0002452404,0.00001222218,6.010263e-7,0.0001120833,0.00002115465,0.00007532251,0.9855184,0.00261683,0.01132941],"study_design_scores_gemma":[0.0007523308,0.0009380959,0.004061495,0.004407081,0.0001337743,0.0001079193,0.00003730239,0.04228498,0.001741641,0.8347201,0.1100096,0.0008056223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.009402801,0.1663828,0.2959356,0.1405775,0.002157347,0.003324199,0.00001090695,0.0005521416,0.3816566],"genre_scores_gemma":[0.9654227,0.01668079,0.001106618,0.01557948,0.0004059499,0.00006433621,0.000005578342,0.00001072591,0.0007238278],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9560199,"threshold_uncertainty_score":0.7065653,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2893109491","doi":"10.1017/s1755020318000229","title":"COMPLETENESS OF SECOND-ORDER PROPOSITIONAL S4 AND H IN TOPOLOGICAL SEMANTICS","year":2018,"lang":"en","type":"article","venue":"The Review of Symbolic Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Propositional variable; Axiom; Intermediate logic; Intuitionistic logic; Well-formed formula; Modal logic; Propositional calculus; Mathematics; S5; Autoepistemic logic; Zeroth-order logic; Semantics (computer science); Discrete mathematics; Dynamic logic (digital electronics); T-norm fuzzy logics; Normal modal logic; Modal; Multimodal logic; Computer science; Theoretical computer science; Description logic; Artificial intelligence; Programming language; Fuzzy logic","authors":[{"name":"Philip Kremer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02565975656490084,"gpt":0.2890374436040479,"spread":0.263377687039147,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007736663,0.0001156221,0.0004394136,0.00004020385,0.00005994636,0.00001193164,0.0006258109,0.00004833571,0.0001649591],"category_scores_gemma":[0.0001199727,0.0000616914,0.00005908898,0.0003841433,0.0004922644,0.00007555421,0.0003015518,0.00009702515,0.00001984665],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001398185,"about_ca_system_score_gemma":0.00007902194,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000777576,"about_ca_topic_score_gemma":0.00001113416,"domain_scores_codex":[0.9988766,0.0001957764,0.0003755209,0.0002066425,0.0001645951,0.0001808911],"domain_scores_gemma":[0.9990752,0.0001453744,0.0001815589,0.0003638234,0.000197914,0.00003614423],"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.000009533384,0.000220157,0.002989182,0.003747869,0.00002801676,0.000006825027,0.0009023654,9.001876e-7,0.0008091387,0.9798916,0.0004497145,0.01094471],"study_design_scores_gemma":[0.002085839,0.001953336,0.3455562,0.01337345,0.0001641568,0.0008696846,0.0001693439,0.006344531,0.005131932,0.6060305,0.01711153,0.001209441],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5710834,0.2782871,0.03817682,0.01438402,0.0008388015,0.002702991,0.00002268995,0.0001628413,0.09434137],"genre_scores_gemma":[0.9878972,0.00732458,0.003509941,0.001089593,0.00007098736,0.00001176007,0.000001663201,0.000003534061,0.00009077069],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4168138,"threshold_uncertainty_score":0.2515702,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3040569033","doi":"10.1017/s1755020319000522","title":"KNOWLEDGE, JUSTIFICATION, AND ADEQUATE REASONS","year":2020,"lang":"en","type":"article","venue":"The Review of Symbolic Logic","topic":"Epistemology, Ethics, and Metaphysics","field":"Arts and Humanities","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"Agence Nationale de la Recherche","keywords":"Internalism and externalism; Externalism; Axiom; Epistemology; Argument (complex analysis); Possession (linguistics); Axiomatic system; Philosophy; Mathematics; Linguistics","authors":[{"name":"Paul Égré","is_ca":false},{"name":"Paul Marty","is_ca":false},{"name":"Bryan Renne","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1531479900520385,"gpt":0.3214384787004625,"spread":0.168290488648424,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004820112,0.00009959401,0.0003230519,0.0000113901,0.0001476048,0.00001635613,0.0001975664,0.00002650586,0.0003887697],"category_scores_gemma":[0.0002093743,0.00005718777,0.00008150539,0.00005188728,0.0005552953,0.00004412488,0.0000484569,0.0001452588,0.0001890604],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003965451,"about_ca_system_score_gemma":0.00003185608,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002030733,"about_ca_topic_score_gemma":0.00001057375,"domain_scores_codex":[0.9992236,0.000176552,0.0002697152,0.0001417184,0.00007573018,0.0001127129],"domain_scores_gemma":[0.9992466,0.0001651587,0.0001558584,0.0002344082,0.0001444191,0.00005356325],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000001611327,0.00002208737,0.000008051634,0.003826077,0.00002903655,3.233728e-7,0.01701126,6.31288e-8,0.00001221337,0.9599593,0.009264932,0.009865092],"study_design_scores_gemma":[0.0001089686,0.00007502933,0.0002480037,0.001508028,0.0003084715,0.000004413959,0.001805517,0.00001393658,0.00002666373,0.02445605,0.9712977,0.0001471721],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"review","genre_gemma":"empirical","genre_scores_codex":[0.002580946,0.6912811,0.00006268574,0.05681127,0.0003677433,0.0005933043,0.00002684269,0.00007304038,0.248203],"genre_scores_gemma":[0.7056264,0.2731086,0.00007182923,0.01449323,0.001213888,0.00005945189,0.00001985096,0.00002376054,0.005383079],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.9620328,"threshold_uncertainty_score":0.4256756,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3043920080","doi":"10.1017/s1755020320000180","title":"CUT-FREE COMPLETENESS FOR MODULAR HYPERSEQUENT CALCULI FOR MODAL LOGICS K, T, AND D","year":2020,"lang":"en","type":"article","venue":"The Review of Symbolic Logic","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Modal; Completeness (order theory); Mathematical proof; Accessibility relation; Interpretation (philosophy); Normal modal logic; Modular design; Mathematics; Algebra over a field; Relation (database); Calculus (dental); Pure mathematics; Modal logic; Computer science; Discrete mathematics; Mathematical analysis; Data mining; Geometry; Programming language","authors":[{"name":"Samara Burns","is_ca":false},{"name":"Richard Zach","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08285298046001914,"gpt":0.2929221384889657,"spread":0.2100691580289465,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008023762,0.0001914995,0.000618481,0.00001923847,0.00014136,0.00004721431,0.001365051,0.00005767626,0.000003933817],"category_scores_gemma":[0.0003043803,0.0001090034,0.0002214649,0.0002123287,0.0001263298,0.00009300892,0.0003462207,0.00007586338,0.000006973634],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000177435,"about_ca_system_score_gemma":0.00004880331,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002154049,"about_ca_topic_score_gemma":0.000001568594,"domain_scores_codex":[0.998586,0.0001101076,0.0004306732,0.0003700323,0.0002047775,0.0002983894],"domain_scores_gemma":[0.998616,0.000179909,0.0002401676,0.0006885828,0.0001659606,0.000109323],"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.000008044585,0.00003436063,0.00002070217,0.007507795,0.00004754638,0.000002133042,0.0003881896,0.00002347639,0.0002537909,0.9695019,0.001393604,0.02081849],"study_design_scores_gemma":[0.002532613,0.001693074,0.0002617643,0.0008028841,0.0003565864,0.0001464651,0.0001947929,0.06976685,0.0006717339,0.5309229,0.3917128,0.0009375284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0005301028,0.0979133,0.8810802,0.01626373,0.0002566143,0.003102761,0.00002014414,0.0001154804,0.0007177417],"genre_scores_gemma":[0.9494339,0.01752145,0.02037106,0.01156887,0.0004297492,0.0005669445,0.00002036738,0.000028669,0.0000590432],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9489037,"threshold_uncertainty_score":0.4445029,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2483635500","doi":"10.1017/s1755020316000204","title":"ADDENDA ET CORRIGENDA TO “THE ARITHMETIC OF THE EVEN AND THE ODD”","year":2016,"lang":"en","type":"article","venue":"The Review of Symbolic Logic","topic":"History and Theory of Mathematics","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Arithmetic; Irrational number; Mathematics; Integer (computer science); Axiom; Square root; Square (algebra); Arithmetic function; Discrete mathematics; Computer science; Geometry","authors":[{"name":"Stephen Menn","is_ca":true},{"name":"Victor Pambuccian","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0486117278775962,"gpt":0.3171623745932021,"spread":0.2685506467156059,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005341223,0.0001838488,0.0006199231,0.00002127178,0.0001839806,0.000007598535,0.001041616,0.0000429631,0.0002955771],"category_scores_gemma":[0.002646609,0.00005012966,0.0002443926,0.0002171894,0.0007511722,0.00003229826,0.000260056,0.0001554961,0.00008704899],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002187887,"about_ca_system_score_gemma":0.00005932614,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006641045,"about_ca_topic_score_gemma":0.00001096077,"domain_scores_codex":[0.9976062,0.001103581,0.00060353,0.00014643,0.0003530685,0.0001872539],"domain_scores_gemma":[0.9955008,0.002646071,0.0004957559,0.001219511,0.00009590072,0.00004198494],"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.00002061208,0.00006043097,0.00000635212,0.002909814,0.00007733684,4.717884e-7,0.003291818,3.544762e-7,0.0001087282,0.9719498,0.01146126,0.01011304],"study_design_scores_gemma":[0.0005489239,0.00006676024,0.0001194137,0.00843574,0.0004782081,0.00008024123,0.0002394792,0.0000075293,0.0003504094,0.8723018,0.1172123,0.0001591363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"review","genre_gemma":"empirical","genre_scores_codex":[0.1435472,0.3947318,0.01152741,0.2887882,0.002519202,0.01854897,0.0003164459,0.0002436534,0.1397771],"genre_scores_gemma":[0.9205402,0.05332813,0.001671551,0.01169431,0.0002357995,0.0002663741,9.301596e-7,0.00007800139,0.01218475],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7769929,"threshold_uncertainty_score":0.3236362,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2899830276","doi":"10.1017/s1755020317000302","title":"TWO SYLLOGISMS IN THE<i>MOZI</i>: CHINESE LOGIC AND LANGUAGE","year":2018,"lang":"en","type":"article","venue":"The Review of Symbolic Logic","topic":"Syntax, Semantics, Linguistic Variation","field":"Arts and Humanities","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Plural; Syllogism; Argument (complex analysis); Linguistics; Ambiguity; Distributive property; Philosophy; Mohism; Predicate (mathematical logic); Epistemology; Mathematics; Computer science; Pure mathematics","authors":[{"name":"Byeong-uk Yi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03190468723867299,"gpt":0.3020528265774806,"spread":0.2701481393388077,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001386528,0.0001524623,0.0003593623,0.0000446435,0.0001446732,0.00004660826,0.0003721401,0.00002498033,0.0005896235],"category_scores_gemma":[0.0007209508,0.00006861318,0.00006981732,0.00009178834,0.0004647432,0.00004633826,0.00007295237,0.0001234747,0.0001061345],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000108533,"about_ca_system_score_gemma":0.00001621036,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009386608,"about_ca_topic_score_gemma":0.0007464428,"domain_scores_codex":[0.9988338,0.0002538842,0.0003770578,0.000160662,0.0001906593,0.0001838722],"domain_scores_gemma":[0.9989737,0.0002864129,0.0002079574,0.0004181516,0.00009398285,0.00001974264],"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.000004405769,0.00005207866,0.0002788068,0.000983328,0.00001862653,0.000005780086,0.04074741,2.47327e-7,0.00004345385,0.9529248,0.0001637033,0.00477732],"study_design_scores_gemma":[0.000857752,0.000341207,0.01123713,0.004379762,0.0003195788,0.00008978346,0.01304221,0.0001437692,0.00002754035,0.953141,0.01592181,0.0004984887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4346327,0.1628922,0.00006454531,0.08592635,0.001656342,0.002474261,0.00004500967,0.0001443113,0.3121643],"genre_scores_gemma":[0.9843568,0.008267626,0.00008407998,0.005850134,0.001192082,0.00002344089,0.000007362225,0.00001029389,0.0002082176],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5497241,"threshold_uncertainty_score":0.6455963,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4411634444","doi":"10.1017/s1755020325100713","title":"FAILURE OF BETH’S THEOREM IN RELEVANCE LOGICS","year":2025,"lang":"en","type":"article","venue":"The Review of Symbolic Logic","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 Toronto","funders":"","keywords":"Relevance (law); Mathematics; Calculus (dental); Mathematical economics; Discrete mathematics; Political science; Medicine; Law","authors":[{"name":"Alasdair Urquhart","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01288777634799244,"gpt":0.2777501249042412,"spread":0.2648623485562488,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001576326,0.0001664215,0.0006286648,0.00008500393,0.00004568551,0.00001280621,0.0018203,0.00007377927,0.00002926429],"category_scores_gemma":[0.0006741518,0.0000913289,0.0001706333,0.001167659,0.0002030474,0.0001018526,0.0004038332,0.0002099253,0.00002710478],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003282222,"about_ca_system_score_gemma":0.0001265737,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001638474,"about_ca_topic_score_gemma":0.00001212196,"domain_scores_codex":[0.9983814,0.000321634,0.0005655619,0.0002795585,0.0002008917,0.0002509385],"domain_scores_gemma":[0.9980903,0.0004588108,0.000292245,0.0009845592,0.0001446845,0.00002941179],"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.000001926025,0.00006151669,0.0003306719,0.00247167,0.0000135673,0.000002299404,0.0003068226,0.000005994485,0.00009538325,0.9517128,0.001138714,0.04385856],"study_design_scores_gemma":[0.000682843,0.0002032893,0.008833257,0.0203182,0.00009725146,0.0000290849,0.0001236509,0.0009919254,0.002886404,0.9091682,0.05621461,0.0004513052],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"review","genre_gemma":"empirical","genre_scores_codex":[0.006500938,0.734053,0.04259675,0.01429628,0.0005785761,0.001537677,0.00000525867,0.0001505,0.2002811],"genre_scores_gemma":[0.8510509,0.1415087,0.004342016,0.002464558,0.00004113402,0.0000357807,0.000001591181,0.000007077194,0.0005481848],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.84455,"threshold_uncertainty_score":0.3724284,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2935729958","doi":"10.1017/s1755020319000170","title":"QUANTIFIED INTUITIONISTIC LOGIC OVER METRIZABLE SPACES","year":2019,"lang":"en","type":"article","venue":"The Review of Symbolic Logic","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":"The Scarborough Hospital; University of Toronto","funders":"","keywords":"Metrization theorem; Mathematics; Separable space; Countable set; Cardinality (data modeling); Constant (computer programming); Space (punctuation); Domain (mathematical analysis); Zero (linguistics); Real line; Zero-dimensional space; Discrete mathematics; Pure mathematics; Topological space; Topological vector space; Mathematical analysis; Computer science","authors":[{"name":"Philip Kremer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02507924901628359,"gpt":0.2841647421312685,"spread":0.2590854931149849,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001436749,0.0002332074,0.0006790199,0.00008881521,0.0001301836,0.000102347,0.001678942,0.00007402162,0.0006825555],"category_scores_gemma":[0.0003651365,0.000127352,0.0002422741,0.0009971041,0.0001332633,0.0002207575,0.0004025044,0.0001919841,0.001614502],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004139241,"about_ca_system_score_gemma":0.00009747753,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003981483,"about_ca_topic_score_gemma":0.000002134177,"domain_scores_codex":[0.9980617,0.0002922801,0.0004705482,0.0004193958,0.0003780184,0.0003780277],"domain_scores_gemma":[0.99779,0.0003829684,0.0003634563,0.001229759,0.0001558433,0.00007795927],"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.000002466164,0.00007991985,0.0002525809,0.002342472,0.00003481493,0.000003441023,0.000157872,0.000006880548,0.0002669106,0.988587,0.002829048,0.005436608],"study_design_scores_gemma":[0.002142392,0.001421647,0.0129046,0.01650541,0.0005154486,0.0003024189,0.0001786945,0.00978043,0.002624213,0.7321737,0.2192489,0.002202066],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"review","genre_gemma":"empirical","genre_scores_codex":[0.0133934,0.5636765,0.06132075,0.006501306,0.002432382,0.002985413,0.00001173136,0.0005297772,0.3491487],"genre_scores_gemma":[0.9247501,0.06655452,0.002172793,0.003667964,0.0001383356,0.00004485308,0.000007720226,0.00001719552,0.002646534],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9113567,"threshold_uncertainty_score":0.9991629,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4392052380","doi":"10.1017/s1755020324000029","title":"CONCEPTUAL DISTANCE AND ALGEBRAS OF CONCEPTS","year":2024,"lang":"en","type":"article","venue":"The Review of Symbolic Logic","topic":"Advanced Algebra and Logic","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":"National Research, Development and Innovation Office; Nemzeti Kutatási Fejlesztési és Innovációs Hivatal","keywords":"Computer science; Epistemology; Philosophy","authors":[{"name":"Mohamed Khaled","is_ca":true},{"name":"Gergely Székely","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0198412161129098,"gpt":0.3032918123619987,"spread":0.2834505962490889,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004106115,0.0001249366,0.0003827596,0.00002461597,0.00003814512,0.00001623934,0.0006324598,0.00002791172,0.00004838586],"category_scores_gemma":[0.00008065023,0.00006744998,0.00009325927,0.0004019817,0.0005096754,0.0001668132,0.000186798,0.0001091423,0.00001965907],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009421572,"about_ca_system_score_gemma":0.00004591996,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002573819,"about_ca_topic_score_gemma":3.712093e-7,"domain_scores_codex":[0.998954,0.0001103744,0.0003446519,0.0002415019,0.0001894862,0.0001600095],"domain_scores_gemma":[0.9990608,0.0002761107,0.0001209102,0.0004510318,0.00004982989,0.00004133032],"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":[6.175296e-7,0.000008418692,0.0000160856,0.001530687,0.00001281876,0.000004039968,0.000388783,0.000001703541,0.0001359623,0.9595339,0.0002802764,0.03808668],"study_design_scores_gemma":[0.0004733323,0.0005158185,0.00171788,0.02414237,0.0001801958,0.0002487122,0.0003384796,0.002154213,0.003214691,0.8067886,0.1595016,0.0007241575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"review","genre_gemma":"empirical","genre_scores_codex":[0.00395214,0.899111,0.089687,0.002403606,0.0002120694,0.0003507433,0.000006658433,0.00008860614,0.004188189],"genre_scores_gemma":[0.883595,0.1132335,0.001811015,0.001185906,0.00004197368,0.000014494,0.00000113344,0.000005786253,0.0001111868],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.8796429,"threshold_uncertainty_score":0.275053,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2011932408","doi":"10.1017/s1755020308080131","title":"MATHEMATICAL METHODS IN PHILOSOPHY EDITORS’ INTRODUCTION","year":2008,"lang":"en","type":"article","venue":"The Review of Symbolic Logic","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 Calgary; University of Toronto","funders":"","keywords":"Philosophy of mathematics; Epistemology; Philosophy of logic; Philosophy of computer science; Mathematical practice; Mathematical logic; Dedekind cut; Philosophical logic; Foundations of mathematics; Philosophy; Philosophy of language; Modal logic; Computer science; Mathematics; Modal; Western philosophy; Pure mathematics; Algorithm; Metaphysics","authors":[{"name":"Aldo Antonelli","is_ca":false},{"name":"Alasdair Urquhart","is_ca":true},{"name":"Richard Zach","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04543032424849617,"gpt":0.3364406164002181,"spread":0.2910102921517219,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002015449,0.0001510873,0.0005198997,0.00006950946,0.00007920881,0.000009921507,0.0009771498,0.00005694742,0.00009295994],"category_scores_gemma":[0.0005632088,0.00008284463,0.0001495986,0.0006804715,0.0001747447,0.0001528182,0.000224169,0.0001987957,0.0001758896],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003517836,"about_ca_system_score_gemma":0.00005557762,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003653828,"about_ca_topic_score_gemma":1.493871e-7,"domain_scores_codex":[0.9982508,0.00052712,0.0004811871,0.0002795087,0.0002343946,0.0002270248],"domain_scores_gemma":[0.9986281,0.0002510462,0.0001881702,0.0007937944,0.00008764258,0.00005128773],"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.000002327253,0.000228734,0.00005933621,0.00266875,0.00002129572,0.000009990773,0.001158571,0.000003166997,0.0002002969,0.9387268,0.02469096,0.03222973],"study_design_scores_gemma":[0.0004222722,0.0002172885,0.001348227,0.003160052,0.00005878771,0.0006986446,0.00002085501,0.001558652,0.001291706,0.8541802,0.136563,0.000480392],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001175644,0.3410607,0.4675445,0.04817638,0.006800525,0.002038265,0.000001537196,0.0003884376,0.132814],"genre_scores_gemma":[0.1173178,0.3908484,0.4499833,0.00759979,0.03268987,0.00035705,0.000008887746,0.00006812129,0.001126775],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1316873,"threshold_uncertainty_score":0.3378306,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2914643333","doi":"10.1017/s1755020319000054","title":"BUNDER’S PARADOX","year":2019,"lang":"en","type":"article","venue":"The Review of Symbolic Logic","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 Toronto","funders":"","keywords":"Prima facie; Class (philosophy); Resolution (logic); Logical consequence; Consistency (knowledge bases); Calculus (dental); Mathematics; Non-classical logic; Mathematical economics; Computer science; Discrete mathematics; Philosophy; Epistemology; Programming language","authors":[{"name":"Michael Caie","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01684499666056861,"gpt":0.2631201973523586,"spread":0.24627520069179,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009089388,0.000153385,0.000455806,0.00003112818,0.00005865927,0.00002830559,0.001689231,0.0000439351,0.0002499292],"category_scores_gemma":[0.00009362475,0.00007919376,0.0001912586,0.0004116829,0.00007070492,0.0001333065,0.000319178,0.0001332925,0.001793624],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000213448,"about_ca_system_score_gemma":0.00006987333,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001082788,"about_ca_topic_score_gemma":7.563671e-7,"domain_scores_codex":[0.9987046,0.0001773455,0.0003261727,0.0002723724,0.0002499743,0.0002695031],"domain_scores_gemma":[0.9983503,0.0001646565,0.0002055365,0.001139122,0.00008236542,0.0000579718],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000001151288,0.00006300748,0.0004030899,0.002282673,0.00002544939,0.000002540204,0.0003257167,0.000002202442,0.00009392315,0.9558403,0.004033731,0.03692622],"study_design_scores_gemma":[0.001472326,0.0008780716,0.01839971,0.01560248,0.0002289618,0.0004716246,0.0001177705,0.003525683,0.001443985,0.4209845,0.5352708,0.001604083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"review","genre_gemma":"empirical","genre_scores_codex":[0.00646938,0.5639865,0.01563193,0.00790266,0.001118396,0.00153993,0.000001895337,0.0002728735,0.4030764],"genre_scores_gemma":[0.8682072,0.1209859,0.001837926,0.00622916,0.0001495248,0.00003503981,0.000002171942,0.00001362255,0.002539425],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8617378,"threshold_uncertainty_score":0.9989836,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}