Permutations, substitutions and finite axiomatizability
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866915692148686848 |
|---|---|
| author | Andréka, Hajnal Gyenis, Zalán Németi, István |
| author_facet | Andréka, Hajnal Gyenis, Zalán Németi, István |
| contents | Algebras of relations form an algebraic framework for the study of logical systems, extending the correspondence between Boolean algebras and propositional logic. Tarski's representable cylindric algebras $RCA_α$, and Halmos' representable polyadic algebras $RPA_α$ both provide algebraic counterparts to first-order logic. In this paper, we show that the usual finite set of polyadic axioms axiomatize $RPA_α$ over $RDf_α$, the diagonal-free subreducts of elements in $RCA_α$. In short: $RPA_α = PA_α + RDf_α$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_12446 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Permutations, substitutions and finite axiomatizability Andréka, Hajnal Gyenis, Zalán Németi, István Logic Algebras of relations form an algebraic framework for the study of logical systems, extending the correspondence between Boolean algebras and propositional logic. Tarski's representable cylindric algebras $RCA_α$, and Halmos' representable polyadic algebras $RPA_α$ both provide algebraic counterparts to first-order logic. In this paper, we show that the usual finite set of polyadic axioms axiomatize $RPA_α$ over $RDf_α$, the diagonal-free subreducts of elements in $RCA_α$. In short: $RPA_α = PA_α + RDf_α$. |
| title | Permutations, substitutions and finite axiomatizability |
| topic | Logic |
| url | https://arxiv.org/abs/2512.12446 |