The undecidability of second order linear logic without exponentials (Q4894725): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2006177255 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Linear logic / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: How to Program an Infinite Abacus / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some Syntactical Observations on 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: Decision problems for propositional linear logic / rank | |||
Normal rank |
Latest revision as of 13:41, 24 May 2024
scientific article; zbMATH DE number 932350
Language | Label | Description | Also known as |
---|---|---|---|
English | The undecidability of second order linear logic without exponentials |
scientific article; zbMATH DE number 932350 |
Statements
The undecidability of second order linear logic without exponentials (English)
0 references
7 October 1996
0 references
undecidability
0 references
multiplicative-additive fragment of second order classical linear logic
0 references
encoding of two-counter machines
0 references
phase semantics
0 references
0 references