{"paper":{"title":"On sets of first-order formulas axiomatizing representable relation algebras","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.RA"],"primary_cat":"math.LO","authors_text":"Jeremy F. Alm","submitted_at":"2016-04-27T20:22:30Z","abstract_excerpt":"This is the author's 2004 Master's thesis at Iowa State University, done under the supervision of Roger D. Maddux. It provides a background in relation algebras. Three results from the literature are demonstrated in full: (i.) RRA is a variety. (ii.) RRA is not finitely based. (iii.) Any equational basis for RRA has infinitely many variables. We also give an elementary proof of Birkoff's variety theorem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.08227","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}