{"id":"W1501739553","doi":"10.1007/3-540-39205-x_26","title":"Upper and Lower Recursion Schemes in Abstract Approximation Spaces","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Recursion (computer science); Scheme (mathematics); Mathematics; Space (punctuation); Order (exchange); Type (biology); Calculus (dental); Discrete mathematics; Pure mathematics; Algebra over a field; Computer science; Algorithm; Mathematical analysis","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006510056,0.0008107148,0.001519417,0.002531432,0.001799501,0.006243273,0.002833269,0.001999075,0.007731627],"category_scores_gemma":[0.01525355,0.0009109483,0.002204327,0.004321431,0.005075505,0.01319061,0.005421647,0.00799725,0.001354053],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003854515,"about_ca_system_score_gemma":0.001538274,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001766434,"about_ca_topic_score_gemma":0.001385817,"domain_scores_codex":[0.9956534,0.001425899,0.0003789216,0.0005270236,0.001569018,0.0004456875],"domain_scores_gemma":[0.9929167,0.00414401,0.0003336619,0.001509057,0.0007300603,0.0003665012],"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.00001569451,0.000007757264,0.00004661715,0.00002212329,0.000003333399,0.000007563777,0.0001122673,0.001586195,0.000185356,0.9870622,0.0003982158,0.01055268],"study_design_scores_gemma":[0.000007776288,0.00001816044,0.0000633191,0.00002245837,0.00001084815,0.00002848441,0.00002992289,0.02241986,0.0003648027,0.973043,0.003978975,0.00001224813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02215847,0.002438977,0.946652,0.001057875,0.0002516257,0.00005178959,0.0001267635,0.0003171568,0.02694537],"genre_scores_gemma":[0.4472669,0.003863897,0.5023751,0.0006015253,0.0006430004,0.0002419271,0.000441215,0.0004162891,0.04415014],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007731627,"threshold_uncertainty_score":0.03442883,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02285723902441531,"score_gpt":0.2577222957993439,"score_spread":0.2348650567749286,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}