Logical reduction of relations: from relational databases to Peirce's reduction thesis
Fuente:
arXiv
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866917699667361792 |
|---|---|
| author | Koshkin, Sergiy |
| author_facet | Koshkin, Sergiy |
| contents | We study logical reduction (factorization) of relations into relations of lower arity by Boolean or relative products that come from applying conjunctions and existential quantifiers to predicates, i.e. by primitive positive formulas of predicate calculus. Our algebraic framework unifies natural joins and data dependencies of database theory and relational algebra of clone theory with the bond algebra of C.S. Peirce. We also offer new constructions of reductions, systematically study irreducible relations and reductions to them, and introduce a new characteristic of relations, ternarity, that measures their `complexity of relating' and allows to refine reduction results. In particular, we refine Peirce's controversial reduction thesis, and show that reducibility behavior is dramatically different on finite and infinite domains. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_14094 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Logical reduction of relations: from relational databases to Peirce's reduction thesis Koshkin, Sergiy Logic Databases Logic in Computer Science Rings and Algebras 03G15 68P15 03B10 03E20 03A05 08A40 08A70 03B70 03-03 We study logical reduction (factorization) of relations into relations of lower arity by Boolean or relative products that come from applying conjunctions and existential quantifiers to predicates, i.e. by primitive positive formulas of predicate calculus. Our algebraic framework unifies natural joins and data dependencies of database theory and relational algebra of clone theory with the bond algebra of C.S. Peirce. We also offer new constructions of reductions, systematically study irreducible relations and reductions to them, and introduce a new characteristic of relations, ternarity, that measures their `complexity of relating' and allows to refine reduction results. In particular, we refine Peirce's controversial reduction thesis, and show that reducibility behavior is dramatically different on finite and infinite domains. |
| title | Logical reduction of relations: from relational databases to Peirce's reduction thesis |
| topic | Logic Databases Logic in Computer Science Rings and Algebras 03G15 68P15 03B10 03E20 03A05 08A40 08A70 03B70 03-03 |
| url | https://arxiv.org/abs/2406.14094 |