Counting proofs in propositional logic
✍ Scribed by René David; Marek Zaionc
- Publisher
- Springer
- Year
- 2009
- Tongue
- English
- Weight
- 196 KB
- Volume
- 48
- Category
- Article
- ISSN
- 0933-5846
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
A general framework of uncertainty reasoning based on Dempster-Shafer's theory is proposed in the context of logic calculus. Under this framework, any inference can be conducted without much computational complexity. Furthermore, it avoids the problems of considering conflicting information and comm
## Abstract Isomorphism between formulae is defined with respect to categories formalizing equality of deductions in classical propositional logic and in the multiplicative fragment of classical linear propositional logic caught by proof nets. This equality is motivated by generality of deductions.