Proof-theoretic semantics and feasibility

DOI10.1007/978-94-017-9217-2_5MaRDI QIDQ5250217zbMATH OpenOpenAlexFDO

Authors Jean Fichot

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

zbMATH Keywords

feasible arithmeticfeasible logicidealisationlight affine logicproof-theoretical semantics

Mathematics Subject Classification ID

Philosophical and critical aspects of logic and foundations (03A05) Proof theory in general (including proof-theoretic semantics) (03F03) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Recommendations

• Proof-theoretic semantics for classical mathematics
• Radical anti-realism, Wittgenstein and the length of proofs
• scientific article; zbMATH DE number 1783013
• Constructivism and Metamathematics
• scientific article; zbMATH DE number 1301805

Cites work

• A judgmental reconstruction of modal logic
• A new recursion-theoretic characterization of the polytime functions
• A new “feasible” arithmetic
• An arithmetic for non-size-increasing polynomial-time computation
• Cambridge summer school in mathematical logic, held in Cambridge/England, August 1-21, 1971
• Constructivism in mathematics. An introduction. Volume II
• scientific article; zbMATH DE number 3891353 (Why is no real title available?)
• scientific article; zbMATH DE number 3910392 (Why is no real title available?)
• scientific article; zbMATH DE number 1392281 (Why is no real title available?)
• scientific article; zbMATH DE number 3275554 (Why is no real title available?)
• scientific article; zbMATH DE number 3280068 (Why is no real title available?)
• scientific article; zbMATH DE number 3291139 (Why is no real title available?)
• scientific article; zbMATH DE number 3305097 (Why is no real title available?)
• scientific article; zbMATH DE number 3054273 (Why is no real title available?)
• Intuitionistic light affine logic
• Light affine lambda calculus and polynomial time strong normalization
• Light affine set theory: A naive set theory of polynomial time
• Light linear logic
• Light types for polynomial time computation in lambda calculus
• Linear logic by levels and bounded time complexity
• Linear types and non-size-increasing polynomial time computation.
• Logique, effectivité et faisabilité
• On an interpretation of safe recursion in light affine logic
• Polynomial size proofs of the propositional pigeonhole principle
• Safe recursion with higher types and BCK-algebra
• Strict finitism
• ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES

Cited in

(7)

• A proof-theoretic semantics for exclusion
• Explicit provability and constructive semantics
• Proof Theory, Semantics and Algebra for Normative Systems
• Advances in proof-theoretic semantics
• scientific article; zbMATH DE number 7307096 (Why is no real title available?)
• scientific article; zbMATH DE number 7109521 (Why is no real title available?)
• scientific article; zbMATH DE number 3269880 (Why is no real title available?)

This page was built for publication: Proof-theoretic semantics and feasibility

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5250217)