System NEL is Undecidable (Q4924537)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 6171452

Language	Label	Description	Also known as
English	System NEL is Undecidable	scientific article; zbMATH DE number 6171452

Statements

scholarly article

0 references

System NEL is Undecidable (English)

0 references

Lutz Straßburger

0 references

Electronic Notes in Theoretical Computer Science

0 references

publication date

6 June 2013

0 references

MaRDI profile type

MaRDI publication profile

0 references

Games and full completeness for multiplicative linear logic

0 references

A Local System for Classical Logic

0 references

0 references

0 references

0 references

A system of interaction and structure

0 references

0 references

0 references

The complexity of Horn fragments of linear logic

0 references

0 references

Linear logic as a logic of computations

0 references

The undecidability of second order linear logic without exponentials

0 references

The undecidability of second order multiplicative linear logic

0 references

How to Program an Infinite Abacus

0 references

Decision problems for propositional linear logic

0 references

0 references

Recursive unsolvability of Post's problem of ''Tag'' und other topics in theory of Turing machines

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/S1571-0661(04)80853-3

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4924537

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4924537&oldid=35335147"