Citations of work:

Samson Abramsky, Dov M. Gabbay & Thomas S. E. Maibaum (1992). Handbook of Logic in Computer Science.

6 found
Are we missing citations?

PhilPapers citations & references are currently in beta testing. We expect to add many more in the future.

Meanwhile, you can use our bibliography tool to import references for this or another work.

Or you can directly add citations for the above work:

Search for work by author name and title
Add directly by record ID

  1.  13
    Coalgebras, Chu Spaces, and Representations of Physical Systems.Samson Abramsky - 2013 - Journal of Philosophical Logic 42 (3):551-574.
    We investigate the use of coalgebra to represent quantum systems, thus providing a basis for the use of coalgebraic methods in quantum information and computation. Coalgebras allow the dynamics of repeated measurement to be captured, and provide mathematical tools such as final coalgebras, bisimulation and coalgebraic logic. However, the standard coalgebraic framework does not accommodate contravariance, and is too rigid to allow physical symmetries to be represented. We introduce a fibrational structure on coalgebras in which contravariance is represented by indexing. (...)
    Direct download (5 more)  
    Export citation  
    Bookmark   2 citations  
  2.  23
    A Domain of Unital Channels.Johnny Feng - 2012 - Foundations of Physics 42 (7):959-975.
    In this paper we prove the space of unital qubit channels is a Scott domain. In the process we provide a simple protocol to achieve Holevo capacity for these channels.
    Direct download (4 more)  
    Export citation  
  3. An Abstract Characterization of the Determinate/Determinable Distinction.Kit Fine - 2011 - Philosophical Perspectives 25 (1):161-187.
  4.  6
    A Term-Graph Clausal Logic: Completeness and Incompleteness Results★.Ricardo Caferra, Rachid Echahed & Nicolas Peltier - 2008 - Journal of Applied Non-Classical Logics 18 (4):373-411.
  5.  47
    Beyond the Universal Turing Machine.B. Jack Copeland & Richard Sylvan - 1999 - Australasian Journal of Philosophy 77 (1):46-66.
  6. Beyond the Universal Turing Machine.Jack Copeland - 1999 - Australasian Journal of Philosophy 77 (1):46-67.
    We describe an emerging field, that of nonclassical computability and nonclassical computing machinery. According to the nonclassicist, the set of well-defined computations is not exhausted by the computations that can be carried out by a Turing machine. We provide an overview of the field and a philosophical defence of its foundations.
    Direct download (7 more)  
    Export citation  
    Bookmark   6 citations