Linear Time Proof Verification on N-Graphs: A Graph Theoretic Approach (Q2849421): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-642-39992-3_7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W102956799 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 00:28, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linear Time Proof Verification on N-Graphs: A Graph Theoretic Approach |
scientific article |
Statements
Linear Time Proof Verification on N-Graphs: A Graph Theoretic Approach (English)
0 references
17 September 2013
0 references
automatic proof-checking
0 references
natural deduction
0 references
classical logic
0 references
linear logic
0 references
\(\mathrm{MLL}^{ - }\)
0 references
N-graphs
0 references
graph theory
0 references
DFS
0 references
