Timeline for BL Algebras that allow for Compactness to hold
Current License: CC BY-SA 3.0
7 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Apr 13, 2017 at 12:58 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
Jun 4, 2015 at 0:19 | comment | added | boumol | The details about how to "model using many-sorted classical first-order logic" are straightforward, but very tedious. They can be found, for instance, in Section 5.2 of the paper dx.doi.org/10.1016/j.apal.2009.01.012 | |
Jun 4, 2015 at 0:18 | comment | added | boumol | Let me point out a quite "trivial" statement: for every class K of BL chains which is first-order definable (in the setting of classical model theory) it holds that the "many-valued first-order logic given by using safe models over algebras in K" satifies compactness. [In particular, this says that the so called general semantics has compactness] The reason why this is trivial is the fact that such semantics can be modelled using many-sorted classical first-order logic (one sort for the elements of the model and other sort for the truth values), which has compactness. | |
S Jun 3, 2015 at 16:34 | history | suggested | Primo Petri |
Just cancelled the tag model-theory which was not appropriate.
|
|
Jun 3, 2015 at 16:05 | review | Suggested edits | |||
S Jun 3, 2015 at 16:34 | |||||
Jun 3, 2015 at 15:53 | history | edited | UserB1234 | CC BY-SA 3.0 |
added 242 characters in body
|
Jun 3, 2015 at 15:42 | history | asked | UserB1234 | CC BY-SA 3.0 |