Light affine set theory: A naive set theory of polynomial time
From MaRDI portal
Publication:1876088
DOI10.1023/B:STUD.0000034183.33333.6fzbMath1048.03041OpenAlexW2146119967MaRDI QIDQ1876088
Publication date: 16 August 2004
Published in: Studia Logica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:stud.0000034183.33333.6f
Nonclassical and second-order set theories (03E70) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Proof-theoretic aspects of linear logic and other substructural logics (03F52)
Related Items (14)
On arithmetic in the Cantor-Łukasiewicz fuzzy set theory ⋮ Stability and paradox in algorithmic logic ⋮ Light affine lambda calculus and polynomial time strong normalization ⋮ Unifying sets and programs via dependent types ⋮ Soft linear set theory ⋮ Type inference for light affine logic via constraints on words ⋮ Routes to triviality ⋮ Variations on a theme of Curry ⋮ Unifying Sets and Programs via Dependent Types ⋮ Light types for polynomial time computation in lambda calculus ⋮ MODAL LOGIC WITHOUT CONTRACTION IN A METATHEORY WITHOUT CONTRACTION ⋮ Linear logic by levels and bounded time complexity ⋮ Proof-Theoretic Semantics and Feasibility ⋮ Implicit computation complexity in higher-order programming languages
This page was built for publication: Light affine set theory: A naive set theory of polynomial time
