Enhancing induction in a contraction free logic with unrestricted abstraction: from \(\mathbf{Z}\) to \(\mathbf{Z}_2\)

DOI10.1007/s00153-022-00824-8OpenAlexW4220957446MaRDI QIDQ2085577

Uwe Petersen

Publication date: 18 October 2022

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00153-022-00824-8

zbMATH Keywords

intuitionistic higher order logicunrestricted abstractionintuitionistic contraction free logicnested double induction

Mathematics Subject Classification ID

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)

Cites Work

• Unnamed Item
• Proof theory. 2nd ed
• Light linear logic
• \(\mathbf L^i \mathbf D^Z_\lambda\) as a basis for PRA
• Logic without contraction as based on inclusion and unrestricted abstraction

This page was built for publication: Enhancing induction in a contraction free logic with unrestricted abstraction: from \(\mathbf{Z}\) to \(\mathbf{Z}_2\)