Sign In

Login

Password

Forgot Password ? Sign Up

Linear logic (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Linear logic" in English language version.

refsWebsite
Global rank English rank
8doi.org
2nd place
2nd place
2worldcat.org
5th place
5th place
1cnrs.fr
2,402nd place
5,549th place
1handle.net
102nd place
76th place
1ucr.edu
1,553rd place
1,008th place
1dagstuhl.de
low place
low place
1dicosmo.org
low place
low place
1illinois.edu
1,349th place
866th place
1psu.edu
207th place
136th place

cnrs.fr

girard.perso.math.cnrs.fr

  • Girard, Jean-Yves (1987). "Linear logic" (PDF). Theoretical Computer Science. 50 (1): 1–102. doi:10.1016/0304-3975(87)90045-4. hdl:10338.dmlcz/120513.

dagstuhl.de

dicosmo.org

doi.org

  • Girard, Jean-Yves (1987). "Linear logic" (PDF). Theoretical Computer Science. 50 (1): 1–102. doi:10.1016/0304-3975(87)90045-4. hdl:10338.dmlcz/120513.
  • de Paiva, V.; van Genabith, J.; Ritter, E. (1999). "Dagstuhl Seminar 99341 on Linear Logic and Applications" (PDF). Drops-Idn/V2/Document/10.4230/Dagsemrep.248. Schloss Dagstuhl – Leibniz-Zentrum für Informatik: 1–21. doi:10.4230/DagSemRep.248.
  • For this result and discussion of some of the fragments below, see: Lincoln, Patrick; Mitchell, John; Scedrov, Andre; Shankar, Natarajan (1992). "Decision Problems for Propositional Linear Logic". Annals of Pure and Applied Logic. 56 (1–3): 239–311. doi:10.1016/0168-0072(92)90075-B.
  • Kanovich, Max I. (1992-06-22). "Horn programming in linear logic is NP-complete". Seventh Annual IEEE Symposium on Logic in Computer Science, 1992. LICS '92. Proceedings. Seventh Annual IEEE Symposium on Logic in Computer Science, 1992. LICS '92. Proceedings. pp. 200–210. doi:10.1109/LICS.1992.185533. ISBN 0-8186-2735-2.
  • Lincoln, Patrick; Winkler, Timothy (1994). "Constant-only multiplicative linear logic is NP-complete". Theoretical Computer Science. 135: 155–169. doi:10.1016/0304-3975(94)00108-1.
  • Bimbó, Katalin (2015-09-13). "The decidability of the intensional fragment of classical linear logic". Theoretical Computer Science. 597: 1–17. doi:10.1016/j.tcs.2015.06.019. ISSN 0304-3975.
  • Straßburger, Lutz (2019-05-10). "On the decision problem for MELL". Theoretical Computer Science. 768: 91–98. doi:10.1016/j.tcs.2019.02.022. ISSN 0304-3975.
  • Kopylov, A. P. (1995-06-01). "Decidability of linear affine logic". Tenth Annual IEEE Symposium on Logic in Computer Science, 1995. LICS '95. Proceedings. Tenth Annual IEEE Symposium on Logic in Computer Science, 1995. LICS '95. Proceedings. pp. 496–504. CiteSeerX 10.1.1.23.9226. doi:10.1109/LICS.1995.523283. ISBN 0-8186-7050-9.

handle.net

hdl.handle.net

  • Girard, Jean-Yves (1987). "Linear logic" (PDF). Theoretical Computer Science. 50 (1): 1–102. doi:10.1016/0304-3975(87)90045-4. hdl:10338.dmlcz/120513.

illinois.edu

seclab.illinois.edu

  • Gunter, C. A.; Gehlot, V. (1989). Nets as Tensor Theories (PDF) (Technical report). University of Pennsylvania. MS-CIS-89-68.

psu.edu

citeseerx.ist.psu.edu

  • Kopylov, A. P. (1995-06-01). "Decidability of linear affine logic". Tenth Annual IEEE Symposium on Logic in Computer Science, 1995. LICS '95. Proceedings. Tenth Annual IEEE Symposium on Logic in Computer Science, 1995. LICS '95. Proceedings. pp. 496–504. CiteSeerX 10.1.1.23.9226. doi:10.1109/LICS.1995.523283. ISBN 0-8186-7050-9.

ucr.edu

math.ucr.edu

worldcat.org

search.worldcat.org