scientific article; zbMATH DE number 4114622
From MaRDI portal
Publication:4729781
zbMath0681.03039MaRDI QIDQ4729781
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15) Cut-elimination and normal-form theorems (03F05) Relative consistency and interpretations (03F25)
Related Items (7)
Exact functors, local connectedness and measurable cardinals ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Harrington's conservation theorem redone ⋮ On partial and paraconsistent logics ⋮ Unnamed Item ⋮ On some formalized conservation results in arithmetic
This page was built for publication: