Timeline for Self-modelling structures
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 21, 2013 at 9:09 | review | Close votes | |||
| Aug 22, 2013 at 2:14 | |||||
| Aug 21, 2013 at 8:35 | history | edited | Hans-Peter Stricker | CC BY-SA 3.0 |
deleted 4 characters in body
|
| Jun 20, 2013 at 11:24 | comment | added | Ramiro de la Vega | I think I´m as confused as Noah. Can´t you just glue $E_{out}$ and $E_{in}$ into a single set construction (with some labeling to distinguish which is which)? Then follow Joel´s comment. Maybe you could explain a bit what the point of being "self-modelling" is. | |
| Jun 20, 2013 at 7:18 | comment | added | Hans-Peter Stricker | A "set construction" is supposed to be a way to systematically relate a set to every vertex $v$ of a graph. A family of graphs is "self-modelling" when there is a set construction and a relation between sets such that... see above. | |
| Jun 20, 2013 at 4:59 | comment | added | Noah Schweber | I'm confused: what, exactly, does it mean for a structure to be "self-modelling?" For that matter, what is a "set construction?" | |
| Jun 20, 2013 at 0:33 | comment | added | Hans-Peter Stricker | I assume things will get arbitrary when we allow several set constructions. So I'd like to insist on one set construction - at least in the short run. | |
| Jun 20, 2013 at 0:26 | comment | added | Hans-Peter Stricker | Maybe, but two set constructions would be involved: $E_{in}$ and $E_{out}$. On the other side: why not? | |
| Jun 20, 2013 at 0:23 | comment | added | Joel David Hamkins | Wouldn't the directed analogue of $(\ast)$ be the fact that $v\to w$ iff $E_{out}(v)\cap E_{in}(w)\neq\emptyset$ in any directed graph? | |
| Jun 20, 2013 at 0:18 | comment | added | Joel David Hamkins | For $(\ast)$, you seem to need $v\neq w$. | |
| Jun 20, 2013 at 0:13 | history | asked | Hans-Peter Stricker | CC BY-SA 3.0 |