Certified Undecidability of Intuitionistic Linear Logic via Binary Stack Machines and Minsky Machines
- 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
- cautionDOI registered: No matching Crossref record was present in this response.
- cautionDOI resolves: No matching Crossref record was present in this response.
- not scoredDirectory of Open Access Journals: No matching DOAJ record was present in this response. No allow-list match; this is not evidence of low credibility.
- not scoredMEDLINE indexed: Not checked or no result supplied; no credibility inference made.
- not scoredOpenAlex core source: Not checked or no result supplied; no credibility inference made.
- not scoredKnown publisher allow-list: Not checked or no result supplied; no credibility inference made.
- not scoredROR affiliation: Not checked or no result supplied; no credibility inference made.
- not scoredRetraction Watch retraction: No retraction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredRetraction Watch expression of concern: No expression of concern notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredRetraction Watch correction: No correction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredRetraction Watch reinstatement: No reinstatement notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- supportingOpen access status: Normalized open-access status: open.
- not scoredPublication license: Not checked or no result supplied; no credibility inference made.
- not scoredPublication version: A publication version was supplied but is not scored.
- supportingMetadata completeness: All 6 scored descriptive metadata groups are present.
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
- hal · retrieved 2026-09-26T11:23:07.345Z