Login / Signup
Certified undecidability of intuitionistic linear logic via binary stack machines and minsky machines.
Yannick Forster
Dominique Larchey-Wendling
Published in:
CPP (2019)
Keyphrases
</>
linear logic
logical framework
cut elimination
query language
high level
pairwise
fixed point
proof theoretic
intuitionistic logic