An Algorithmic Interpretation of a Deep Inference System

DOI10.1007/978-3-540-89439-1_34zbMATH Open1182.03104OpenAlexW1551908220MaRDI QIDQ5505576FDOQ5505576

Authors Kai Brünnler, Richard McKinley 

Publication date 27 January 2009

Published in Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL https://boris.unibe.ch/37187/1/bm08.pdf

Mathematics Subject Classification ID

Subsystems of classical logic (including intuitionistic logic) (03B20) Structure of proofs (03F07)

Recommendations

• Interpretability in Deep Learning
• Logical Approaches to Computational Barriers
• A System of Interaction and Structure II: The Need for Deep Inference
• Algorithmic learning and deep neural networks
• On the proof complexity of deep inference
• Deep neural networks for estimation and inference
• A formal proof of the expressiveness of deep learning
• A formal proof of the expressiveness of deep learning

Cited In (9)

• Type similarity for the Lambek-Grishin calculus revisited
• A deep inference system with a self-dual binder which is complete for linear lambda calculus
• Cut elimination inside a deep inference system for classical predicate logic
• Contextual Natural Deduction
• Maude as a platform for designing and implementing deep inference systems
• True concurrency of deep inference proofs
• Implementation and evaluation of contextual natural deduction for minimal logic
• Linear lambda calculus and deep inference
• Spinal atomic \(\lambda\)-calculus

This page was built for publication: An Algorithmic Interpretation of a Deep Inference System

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