The undecidability theorem for the Horn-like fragment of linear logic (Revisited) (Q5741577): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Decision problems for propositional linear logic / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Recursive unsolvability of Post's problem of ''Tag'' und other topics in theory of Turing machines / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Algorithm for the General Petri Net Reachability Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Linear logic / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1017/s0960129516000049 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2346730081 / rank | |||
Normal rank | |||
Latest revision as of 08:42, 30 July 2024
scientific article; zbMATH DE number 6607292
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The undecidability theorem for the Horn-like fragment of linear logic (Revisited) |
scientific article; zbMATH DE number 6607292 |
Statements
The undecidability theorem for the Horn-like fragment of linear logic (Revisited) (English)
0 references
28 July 2016
0 references
0 references
