Timeline for Can we re-write every effective first order theory using finitely many primitives?
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 1, 2020 at 8:53 | vote | accept | Zuhair Al-Johar | ||
| Dec 31, 2019 at 22:34 | history | became hot network question | |||
| Dec 31, 2019 at 19:42 | answer | added | James E Hanson | timeline score: 7 | |
| Dec 31, 2019 at 19:09 | comment | added | Zuhair Al-Johar | @James Hanson can you post this theory as an answer with some details. | |
| Dec 31, 2019 at 19:02 | comment | added | James E Hanson | The random hyper-graph (allowing arbitrarily large arity edges, so we have an edge relation for each $n$) has a decidable theory and is almost certainly not bi-interpretable with a theory in a finite language/signature/vocabulary. | |
| Dec 31, 2019 at 18:57 | comment | added | Zuhair Al-Johar | @MattF. what are the examples of such a kind of theories.? | |
| Dec 31, 2019 at 17:51 | comment | added | user44143 | I think the answer is no, e.g. if the theory has relations of aribtrarily large arity. | |
| Dec 31, 2019 at 12:24 | history | asked | Zuhair Al-Johar | CC BY-SA 4.0 |