First-Order Linear Logic without Modalities is NEXPTIME-Hard - researchr publication bibtex

researchr

You are not signed in
Sign in
Sign up

Patrick Lincoln, Andre Scedrov. First-Order Linear Logic without Modalities is NEXPTIME-Hard. Theoretical Computer Science, 135(1):139-153, 1994.

@article{LincolnS94:0,
  title = {First-Order Linear Logic without Modalities is NEXPTIME-Hard},
  author = {Patrick Lincoln and Andre Scedrov},
  year = {1994},
  tags = {modal logic, logic},
  researchr = {https://researchr.org/publication/LincolnS94%3A0},
  cites = {0},
  citedby = {0},
  journal = {Theoretical Computer Science},
  volume = {135},
  number = {1},
  pages = {139-153},
}

runs on WebDSL