Timeline for Semantic definition of sentence
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 30, 2011 at 17:14 | comment | added | François G. Dorais | When working with a finite relational signature, the fixed length $n$ EF games define equivalence classes of types which form the basic open sets. This idea extends to general signatures, but there is a fair amount of fiddling to do... | |
| Jun 30, 2011 at 16:51 | comment | added | Andreas Blass | Could you add a word about how to define the topology on the space of types? The reason I ask is that, as far as I know, in some other contexts (certain abstract elementary classes), one can have notions of types for which it's non-trivial to produce an associated notion of formula. I suspect this is related to the lack of compactness in AEC's and therefore won't be a problem in first-order logic, but at the moment I don't see the details. | |
| Jun 30, 2011 at 16:19 | history | edited | Emil Jeřábek | CC BY-SA 3.0 |
fix typo
|
| Jun 30, 2011 at 16:03 | history | edited | François G. Dorais | CC BY-SA 3.0 |
typo
|
| Jun 30, 2011 at 15:55 | vote | accept | David Harris | ||
| Jun 30, 2011 at 15:41 | history | answered | François G. Dorais | CC BY-SA 3.0 |