{"id":"W2057923867","doi":"10.1016/j.tcs.2005.06.030","title":"A representation theorem for Boolean contact algebras","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":109,"is_retracted":false,"has_abstract":false,"ca_institutions":"Brock University","funders":"","keywords":"Representation theorem; Stone's representation theorem for Boolean algebras; Mathematics; Axiom; Connection (principal bundle); Discrete mathematics; Representation (politics); Transitive relation; Free Boolean algebra; Automated theorem proving; Complete Boolean algebra; Class (philosophy); Boolean algebras canonically defined; Algebra over a field; Pure mathematics; Combinatorics; Computer science; Two-element Boolean algebra; Algorithm; Artificial intelligence; Algebra representation","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.001263539,0.0005860534,0.0009283441,0.001955203,0.002000272,0.004375838,0.001482399,0.001659062,0.01598196],"category_scores_gemma":[0.003441152,0.0003985404,0.001946463,0.002559104,0.002173325,0.008472851,0.002333747,0.003557431,0.001998098],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001595095,"about_ca_system_score_gemma":0.000838376,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00124704,"about_ca_topic_score_gemma":0.0005973376,"domain_scores_codex":[0.9991731,0.0001486184,0.00006115457,0.0002059032,0.0002740593,0.0001371356],"domain_scores_gemma":[0.9988606,0.0005065912,0.000102809,0.0001903099,0.0002313337,0.0001083806],"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.000006376733,0.000007770522,0.00001922874,0.00001401681,0.000003930473,0.00001451182,0.00008013619,0.0002069255,0.0001789712,0.9955884,0.0008832742,0.002996591],"study_design_scores_gemma":[0.000008638747,0.0000075406,0.00002837056,0.000008005444,0.000007274076,0.00004779164,0.00003447687,0.00326558,0.0001851133,0.993359,0.003040988,0.000007100755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05076929,0.001229287,0.830099,0.003232746,0.0005269955,0.0001381254,0.0009017467,0.000670363,0.1124323],"genre_scores_gemma":[0.7957326,0.001695311,0.1505889,0.001923342,0.001211353,0.0003866304,0.001504932,0.0003279719,0.04662907],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01598196,"threshold_uncertainty_score":0.05346495,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01831742266785005,"score_gpt":0.2810696077821045,"score_spread":0.2627521851142545,"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."}}