Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2509.13063 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909791333384192 |
|---|---|
| author | Costa, Simone Dalai, Marco Della Fiore, Stefano Pasotti, Anita |
| author_facet | Costa, Simone Dalai, Marco Della Fiore, Stefano Pasotti, Anita |
| contents | We consider the exprissibility in monadic second order logic of certain relations of importance in computer science. For integers $n\geq 1$ and $k\leq b$, a $k$-tuple of sequences in $\{0,1,\ldots, b-1\}^n$ are said to be $k$-hashed if there is a coordinate where they all differ. A set $\mathcal{C}$ of sequences is said to be a $k$-hash code if any $k$ distinct elements are $k$-hashed. Testing whether a code is $k$-hashing and determining the largest size of $k$-hash codes is an important problem in computer science. The use of general purpose solvers for this problem leads to question what minimal logic is needed to represent the problem.
In this paper, we prove that the $k$-hashing relation on $k$-tuples is not definable in Monadic Second Order Logic (MSO), highlighting its limitations for this problem. Instead, the property can be expressed in extensions of the MSO that add the equi-cardinality relation. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_13063 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Definability of some $k$-ary Relations Over Second Order kinds of Logics Costa, Simone Dalai, Marco Della Fiore, Stefano Pasotti, Anita Logic We consider the exprissibility in monadic second order logic of certain relations of importance in computer science. For integers $n\geq 1$ and $k\leq b$, a $k$-tuple of sequences in $\{0,1,\ldots, b-1\}^n$ are said to be $k$-hashed if there is a coordinate where they all differ. A set $\mathcal{C}$ of sequences is said to be a $k$-hash code if any $k$ distinct elements are $k$-hashed. Testing whether a code is $k$-hashing and determining the largest size of $k$-hash codes is an important problem in computer science. The use of general purpose solvers for this problem leads to question what minimal logic is needed to represent the problem. In this paper, we prove that the $k$-hashing relation on $k$-tuples is not definable in Monadic Second Order Logic (MSO), highlighting its limitations for this problem. Instead, the property can be expressed in extensions of the MSO that add the equi-cardinality relation. |
| title | Definability of some $k$-ary Relations Over Second Order kinds of Logics |
| topic | Logic |
| url | https://arxiv.org/abs/2509.13063 |