J. Gate
The expressibility of fragments of Hybrid Graph Logic on finite digraphs
Gate, J.; Stewart, I.A.
Citation
Gate, J., & Stewart, I. (2013). The expressibility of fragments of Hybrid Graph Logic on finite digraphs. Journal of applied logic, 11(3), 272-288. https://doi.org/10.1016/j.jal.2013.05.002
| Journal Article Type | Article |
|---|---|
| Publication Date | 2013 |
| Deposit Date | Jun 27, 2013 |
| Journal | Journal of Applied Logic |
| Print ISSN | 1570-8683 |
| Electronic ISSN | 1570-8691 |
| Publisher | Elsevier |
| Peer Reviewed | Peer Reviewed |
| Volume | 11 |
| Issue | 3 |
| Pages | 272-288 |
| DOI | https://doi.org/10.1016/j.jal.2013.05.002 |
| Public URL | https://durham-repository.worktribe.com/output/1450434 |
You might also like
The stellar transformation: from interconnection networks to datacenter networks
(2016)
Journal Article
The influence of datacenter usage on symmetry in datacenter network design
(2017)
Journal Article
Edge-pancyclicity and edge-bipancyclicity of faulty folded hypercubes
(2016)
Journal Article
On the computational complexity of routing in faulty k-ary n-cubes and hypercubes.
(2012)
Journal Article
Downloadable Citations
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search