Cut and pay
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3504935 (Why is no real title available?)
- scientific article; zbMATH DE number 1493054 (Why is no real title available?)
- scientific article; zbMATH DE number 1749196 (Why is no real title available?)
- scientific article; zbMATH DE number 1907195 (Why is no real title available?)
- scientific article; zbMATH DE number 3274715 (Why is no real title available?)
- Advances in Artificial Intelligence – SBIA 2004
- Approximate and Limited Reasoning: Semantics, Proof Theory, Expressivity and Control
- Are tableaux an improvement on truth-tables? Cut-free proofs and bivalence
- Don't eliminate cut
- Linear logic
- Logics in Artificial Intelligence
- The Taming of the Cut. Classical Refutations with Analytic Cut
- Tractable reasoning via approximation
Cited in
(9)- Approximations of modal logics: K and beyond
- Don't eliminate cut
- Informational semantics, non-deterministic matrices and feasible deduction
- Abduction as deductive saturation: a proof-theoretic inquiry
- Semantics and proof-theory of depth bounded Boolean logics
- The enduring scandal of deduction. Is propositional logic really uninformative?
- A modal view on resource-bounded propositional logics
- An informational view of classical logic
- A curious dialogical logic and its composition problem
This page was built for publication: Cut and pay
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q851192)