Orthogonality and Boolean Algebras for Deduction Modulo
From MaRDI portal
Publication:3007658
DOI10.1007/978-3-642-21691-6_9zbMath1331.03038OpenAlexW15085223MaRDI QIDQ3007658
Clément Houtmann, Olivier Hermant, Aloïs Brunel
Publication date: 17 June 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/inria-00563331/file/main.pdf
Cites Work
- Linear logic
- Towards a semantic characterization of cut-elimination
- Theorem proving modulo
- Phase semantic cut-elimination and normalization proofs of first- and higher-order linear logic
- A uniform semantic proof for cut-elimination and completeness of various first and higher order logics.
- Classical \(F_{\omega}\), orthogonality and symmetric candidates
- Truth Values Algebras and Proof Normalization
- Phase semantics and sequent calculus for pure noncommutative classical linear propositional logic
- Proof normalization modulo
- A Simple Proof That Super-Consistency Implies Cut Elimination