Timeline for Decidability of the Hilbert lattice and quantum logic
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 26, 2018 at 13:27 | vote | accept | Iian Smythe | ||
| Mar 26, 2018 at 2:47 | history | edited | Bjørn Kjos-Hanssen | CC BY-SA 3.0 |
added 1395 characters in body
|
| Mar 26, 2018 at 2:02 | comment | added | user44143 | The obvious algorithm would be taking sentences $E_1 \ldots E_k$ about subspaces $P_1 \ldots P_n$, and seeing whether they have a non-trivial solution in a Hilbert space of dimension at most $2^n$. This paper says that algorithm must fail -- do you understand the paper well enough to provide an example of such sentences whose only non-trivial solutions are in dimension higher than $2^n$? | |
| Mar 25, 2018 at 19:35 | history | answered | Bjørn Kjos-Hanssen | CC BY-SA 3.0 |