Switch to: References

Add citations

You must login to add citations.
  1. Decidability of the Equational Theory of the Continuous Geometry CG(\Bbb {F}).John Harding - 2013 - Journal of Philosophical Logic 42 (3):461-465.
    For $\Bbb {F}$ the field of real or complex numbers, let $CG(\Bbb {F})$ be the continuous geometry constructed by von Neumann as a limit of finite dimensional projective geometries over $\Bbb {F}$ . Our purpose here is to show the equational theory of $CG(\Bbb {F})$ is decidable.
    Download  
     
    Export citation  
     
    Bookmark  
  • Quantum logic is undecidable.Tobias Fritz - 2020 - Archive for Mathematical Logic 60 (3):329-341.
    We investigate the first-order theory of closed subspaces of complex Hilbert spaces in the signature \\), where ‘\’ is the orthogonality relation. Our main result is that already its quasi-identities are undecidable: there is no algorithm to decide whether an implication between equations and orthogonality relations implies another equation. This is a corollary of a recent result of Slofstra in combinatorial group theory. It follows upon reinterpreting that result in terms of the hypergraph approach to quantum contextuality, for which it (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation