Proof-Theoretic Semantics and Feasibility
From MaRDI portal
Publication:5250217
DOI10.1007/978-94-017-9217-2_5zbMath1355.03045OpenAlexW338462332MaRDI QIDQ5250217
Publication date: 19 May 2015
Published in: Logic, Epistemology, and the Unity of Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-94-017-9217-2_5
Philosophical and critical aspects of logic and foundations (03A05) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Proof theory in general (including proof-theoretic semantics) (03F03)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Light affine lambda calculus and polynomial time strong normalization
- Light types for polynomial time computation in lambda calculus
- Linear logic by levels and bounded time complexity
- Strict finitism
- Constructivism in mathematics. An introduction. Volume II
- A new recursion-theoretic characterization of the polytime functions
- Light linear logic
- Linear types and non-size-increasing polynomial time computation.
- Safe recursion with higher types and BCK-algebra
- An arithmetic for non-size-increasing polynomial-time computation
- On an interpretation of safe recursion in light affine logic
- Light affine set theory: A naive set theory of polynomial time
- Cambridge summer school in mathematical logic, held in Cambridge/England, August 1-21, 1971
- A judgmental reconstruction of modal logic
- ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES
- Polynomial size proofs of the propositional pigeonhole principle
- Logique, effectivité et faisabilité
- A new “feasible” arithmetic
- Intuitionistic Light Affine Logic
