Certified Undecidability of Intuitionistic Linear Logic via Binary Stack Machines and Minsky Machines

Yannick Forster, Dominique Larchey-Wendling

Open source

DOI
10.1145/3293880.3294096
Published
2019-01-14
Container
Not recorded
Publisher
ACM Press
Open access
yes

Credibility signals

uncertain Score 51/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.1145/3293880.3294096,
  title = {Certified Undecidability of Intuitionistic Linear Logic via Binary Stack Machines and Minsky Machines},
  author = {Yannick Forster and Dominique Larchey-Wendling},
  year = {2019},
  doi = {10.1145/3293880.3294096},
  url = {https://doi.org/10.1145/3293880.3294096}
}

RIS

TY  - JOUR
TI  - Certified Undecidability of Intuitionistic Linear Logic via Binary Stack Machines and Minsky Machines
AU  - Yannick Forster
AU  - Dominique Larchey-Wendling
PY  - 2019
DO  - 10.1145/3293880.3294096
UR  - https://doi.org/10.1145/3293880.3294096
ER  - 

APA

Forster, Y., & Larchey-Wendling, D. (2019). Certified Undecidability of Intuitionistic Linear Logic via Binary Stack Machines and Minsky Machines. https://doi.org/10.1145/3293880.3294096

Source records