Axiom Directed Focusing
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1082077 (Why is no real title available?)
- scientific article; zbMATH DE number 3074068 (Why is no real title available?)
- A Proof-Theoretic Approach to Logic Programming
- A Simple Proof That Super-Consistency Implies Cut Elimination
- Automated Reasoning
- Cut Elimination in Deduction Modulo by Abstract Completion
- Cut Elimination in the Presence of Axioms
- Cut-elimination for a logic with definitions and induction
- Embedding Pure Type Systems in the Lambda-Pi-Calculus Modulo
- Focussing and proof construction
- From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic
- HOL-\(\lambda\sigma\): An intentional first-order expression of higher-order logic
- Logic Programming with Focusing Proofs in Linear Logic
- On the meaning of logical rules. II: Multiplicatives and additives
- Proof normalization modulo
- Superdeduction at Work
- Theorem proving modulo
- Truth Values Algebras and Proof Normalization
- Typed Lambda Calculi and Applications
- Unbounded Proof-Length Speed-Up in Deduction Modulo
Cited in
(5)
This page was built for publication: Axiom Directed Focusing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3638252)