Timeline for A finitely based consequence relation on 3-valued logic whose algebraic counterpart is not finitely based, and vice versa
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 8, 2021 at 13:08 | review | Close votes | |||
| Sep 23, 2021 at 3:07 | |||||
| Jun 29, 2021 at 16:33 | comment | added | user107952 | @JoelDavidHamkins I mean, an algebraic structure is finitely based, when the universally quantified equations that are valid in that structure can be generated from a finite set. And a consequence relation is finitely based when there are a finite number of rules that, when the rules are closed under substitution, give the whole consequence relation. | |
| Jun 29, 2021 at 8:41 | comment | added | Joel David Hamkins | And could you also say precisely what it means for the consequence relation to be finitely based? | |
| Jun 29, 2021 at 8:35 | comment | added | Joel David Hamkins | Can you explain what it means, exactly, for an algebraic structure to have a finite basis of identities? Do you mean that it can be finitely presented? That is, there is a finite list of generators and identities so that if I form all words and quotient by those identities I get the given structure? | |
| Jun 28, 2021 at 18:48 | history | asked | user107952 | CC BY-SA 4.0 |