The following pages link to (Q5282959):
Displaying 12 items.
- The higher-order prover \textsc{Leo}-II (Q287283) (← links)
- Computer-assisted analysis of the Anderson-Hájek ontological controversy (Q523303) (← links)
- The TPTP problem library and associated infrastructure. From CNF to TH0, TPTP v6.4.0 (Q1694574) (← links)
- Designing normative theories for ethical and legal reasoning: \textsc{LogiKEy} framework, methodology, and tool support (Q2211865) (← links)
- Cut-elimination for quantified conditional logic (Q2363418) (← links)
- Variants of Gödel's ontological proof in a natural deduction calculus (Q2363503) (← links)
- Incompleteness, Undecidability and Automated Proofs (Q2829997) (← links)
- Higher-Order Modal Logics: Automation and Applications (Q2970308) (← links)
- Para-Disagreement Logics and Their Implementation Through Embedding in Coq and SMT (Q3305339) (← links)
- Computational Hermeneutics: An Integrated Approach for the Logical Analysis of Natural-Language Arguments (Q3305694) (← links)
- Invited Talk: On a (Quite) Universal Theorem Proving Approach and Its Application in Metaphysics (Q3455772) (← links)
- Computer-supported Analysis of Positive Properties, Ultrafilters and Modal Collapse in Variants of Gödel's Ontological Argument (Q5126209) (← links)
