A sequent calculus and a theorem prover for standard conditional logics

DOI10.1145/1276920.1276924zbMath1367.68253arXivcs/0407064OpenAlexW2097313873MaRDI QIDQ5277787

Nicola Olivetti, Gian Luca Pozzato, Camilla B. Schwind

Publication date: 12 July 2017

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

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

zbMATH Keywords

proof theorylogic programmingautomated deductionconditional logicslabeled deductive systemsanalytic sequent calculi

Mathematics Subject Classification ID

Logic programming (68N17) Proof theory in general (including proof-theoretic semantics) (03F03)

Related Items

Cut-elimination for quantified conditional logic, In All, but Finitely Many, Possible Worlds: Model-Theoretic Investigations on ‘Overwhelming Majority’ Default Conditionals, A Sequent Calculus for Preferential Conditional Logic Based on Neighbourhood Semantics, Nested Sequent Calculi for Conditional Logics, Sequent Systems for Lewis’ Conditional Logics, Natural deduction calculi and sequent calculi for counterfactual logics, Cut elimination in coalgebraic logics, Embedding and automating conditional logics in classical higher-order logic, Proof analysis in intermediate logics, Modular algorithms for heterogeneous modal logics via multi-sorted coalgebra, A Conditional Constructive Logic for Access Control and Its Sequent Calculus, Cut Elimination for Shallow Modal Logics, Admissibility of Cut in Coalgebraic Logics

Uses Software

• Prolog
• CondLean