Cut-elimination for quantified conditional logic
From MaRDI portal
Publication:2363418
DOI10.1007/S10992-016-9403-0zbMATH Open1417.03282OpenAlexW2431262575MaRDI QIDQ2363418FDOQ2363418
Authors: Christoph Benzmüller 
Publication date: 19 July 2017
Published in: Journal of Philosophical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10992-016-9403-0
Recommendations
cut-eliminationsemantic embeddingclassical higher-order logiccut-simulationquantified conditional logics
Cites Work
- The TPTP problem library and associated infrastructure and associated infrastructure. The FOF and CNF parts, v3.5.0
- Satallax: An Automatic Higher-Order Prover
- Analytic tableaux for higher-order logic with choice
- Intensional models for the theory of types
- Title not available (Why is that?)
- Quantified multimodal logics in simple type theory
- Sufficient conditions for cut elimination with complexity analysis
- The higher-order prover \textsc{Leo}-II
- Multimodal and intuitionistic logics in simple type theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- Cut-Simulation and Impredicativity
- Cut-elimination for simple type theory with an axiom of choice
- Title not available (Why is that?)
- Title not available (Why is that?)
- Higher-order semantics and extensionality
- Reasoning with higher-order abstract syntax in a logical framework
- Completeness in the theory of types
- Proof theory
- Combining and automating classical and non-classical logics in classical higher-order logics
- Basic conditional logic
- Title not available (Why is that?)
- A sequent calculus and a theorem prover for standard conditional logics
- Resolution in type theory
- Generic Modal Cut Elimination Applied to Conditional Logics
- On first-order conditional logics
- Analytic Tableaux for Simple Type Theory and its First-Order Fragment
- Hauptsatz for higher order logic
- General models and extensionality
- A UNIFYING PRINCIPAL IN QUANTIFICATION THEORY
- Interpolation for first order S5
- Title not available (Why is that?)
- Syntactical and semantical properties of simple type theory
- An Unsolvable Problem of Elementary Number Theory
- Embedding and automating conditional logics in classical higher-order logic
- Exploring properties of normal multimodal logics in simple type theory with \texttt{Leo-II}
- General models, descriptions, and choice in type theory
- A proof of cut-elimination theorem in simple type-theory
- A nonconstructive proof of Gentzen’s Hauptsatz for second order predicate logic
- An example on the fundamental conjecture of \(GLC\)
- A first-order conditional logic for prototypical properties
- Title not available (Why is that?)
- Automated Deduction – CADE-20
- First-order conditional logic for default reasoning revisited
- Title not available (Why is that?)
Cited In (14)
- Designing normative theories for ethical and legal reasoning: \textsc{LogiKEy} framework, methodology, and tool support
- Simulating non-prenex cuts in quantified propositional calculus
- Generic Modal Cut Elimination Applied to Conditional Logics
- Extensional higher-order paramodulation in Leo-III
- Some embedding theorems for conditional logic
- Towards a clausal analysis of cut-elimination
- BOUNDED-ANALYTIC SEQUENT CALCULI AND EMBEDDINGS FOR HYPERSEQUENT LOGICS
- Dyadic deontic logic in HOL: faithful embedding and meta-theoretical experiments
- Cut elimination for a calculus with context-dependent rules
- Cut-elimination for knowledge logics with interaction
- CUT ELIMINATION FOR PROPOSITIONAL DYNAMIC LOGIC WITHOUT
- On the elimination of quantifier-free cuts
- Automating free logic in HOL, with an experimental application in category theory
- The role of quantifier alternations in cut elimination
Uses Software
This page was built for publication: Cut-elimination for quantified conditional logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2363418)
