Embedding and automating conditional logics in classical higher-order logic

DOI10.1007/s10472-012-9320-zzbMath1272.03064arXiv1106.3685OpenAlexW2100286464MaRDI QIDQ1935597

Daniele Rispoli, Valerio Genovese, Christoph Benzmüller, Dov M. Gabbay

Publication date: 18 February 2013

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1106.3685

zbMATH Keywords

automated theorem provingsemantic embeddingclassical higher-order logicconditional logics

Mathematics Subject Classification ID

Related Items (3)

Cut-elimination for quantified conditional logic ⋮ Invited Talk: On a (Quite) Universal Theorem Proving Approach and Its Application in Metaphysics ⋮ Unnamed Item

Uses Software

• TPS
• TPTP
• Satallax
• CoLoSS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Conditional logics of normality: A modal approach
• The TPTP problem library and associated infrastructure and associated infrastructure. The FOF and CNF parts, v3.5.0
• Optimal Tableaux for Conditional Logics with Cautious Monotonicity
• Verifying the Modal Logic Cube Is an Easy Task (For Higher-Order Automated Reasoners)
• Multimodal and intuitionistic logics in simple type theory
• Theorem proving for conditional logics: CondLean and GOALDUCK
• A sequent calculus and a theorem prover for standard conditional logics
• General models and extensionality
• A formulation of the simple theory of types

This page was built for publication: Embedding and automating conditional logics in classical higher-order logic