Timeline for Is there a theory in a finite language that is computably axiomatizable but not by a finite number of axiom schemas?
Current License: CC BY-SA 4.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 20, 2020 at 0:38 | vote | accept | user107952 | ||
| Jun 20, 2020 at 0:00 | comment | added | Fedor Pakhomov | Any set of $n$-tuples from a finite model $\mathfrak{M}$ is definable by some formula with parameters. Hence a schemata $S(P_1,\ldots,P_n)$ holds in a finite model $\mathfrak{M}$ iff it holds in $\mathfrak{M}$ under all possible interpretations of $P_i$'s as predicates of appropriate arities. This clearly leads to a $\mathtt{co}\text{-}\mathtt{NP}$ check of whether a finite models satisfy a given scheme. | |
| Jun 19, 2020 at 23:35 | history | answered | Fedor Pakhomov | CC BY-SA 4.0 |