A Generalization of ACP Using Belnap's Logic
From MaRDI portal
Publication:5262974
DOI10.1016/j.entcs.2005.12.102zbMath1316.68104OpenAlexW2126831319MaRDI QIDQ5262974
Alban Ponse, Mark B. van der Zwaag
Publication date: 10 July 2015
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2005.12.102
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Many-valued logic (03B50)
Related Items
The B4-valued propositional Belnap-Dunn logic1, The \(\mathbf{B}_4\)-valued propositional logic with unary logical connectives \(\sim_1/\sim_2/\neg\), A Generalization of ACP Using Belnap's Logic
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Kleene's three-valued logic and process algebra
- Process algebra for synchronous communication
- Process algebra with four-valued logic
- A propositional logic with 4 values: true, false, divergent and meaningless
- A Generalization of ACP Using Belnap's Logic
- On notation for ordinal numbers