Embedding intuitionistic into classical logic
From MaRDI portal
Cites work
- A proof-theoretic perspective on SMT-solving for intuitionistic propositional logic
- A resolution theorem prover for intuitionistic logic
- Automated Reasoning with Analytic Tableaux and Related Methods
- Efficient Intuitionistic Theorem Proving with the Polarized Inverse Method
- scientific article; zbMATH DE number 3735770 (Why is no real title available?)
- scientific article; zbMATH DE number 3614784 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1497485 (Why is no real title available?)
- scientific article; zbMATH DE number 5493266 (Why is no real title available?)
- scientific article; zbMATH DE number 3291139 (Why is no real title available?)
- Intuitionistic propositional logic is polynomial-space complete
- leanCoP 2.0 and ileanCoP 1.2: High Performance Lean Theorem Proving in Classical and Intuitionistic Logic (System Descriptions)
- Over de Grondslagen der Wiskunde.
- Refined program extraction from classical proofs
- Resolution theorem proving
- SAT modulo intuitionistic implications
- Sur quelques points de la logique de M. Brouwer.
- The \textsf{nanoCoP 2.0} connection provers for classical, intuitionistic and modal logics
- The complexity of theorem-proving procedures
- The consistency of arithmetics
- The eskolemization of universal quantifiers
- The Skolemization of existential quantifiers in intuitionistic logic
- Zur intuitionistischen Arithmetik und Zahlentheorie.
This page was built for publication: Embedding intuitionistic into classical logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7025211)
