The Taming of the Cut. Classical Refutations with Analytic Cut
From MaRDI portal
Recommendations
- Analyticity, balance and non-admissibility of \textit{Cut} in stoic logic
- Structural cut elimination. I: Intuitionistic and classical logic
- Publication:3475264
- A note on cut-elimination for classical propositional logic
- Cut for classical core logic
- Cutting plane and Frege proofs
- On cut-elimination arguments for axiomatic theories of truth
- Analytic cut in modal logic: the system B
- scientific article; zbMATH DE number 512977
- Equal Rights for the Cut: Computable Non-analytic Cuts in Cut-based Proofs
Cited in
(55)- An epistemic operator for description logics
- Representing scope in intuitionistic deductions
- Are tableaux an improvement on truth-tables? Cut-free proofs and bivalence
- A generalization of analytic deduction via labelled deductive systems. I: Basic substructural logics
- The proof complexity of analytic and clausal tableaux
- Building decision procedures for modal logics from propositional decision procedures: The case study of modal \(K(m)\).
- Using tableaux to automate the Lambek and other categorial calculi
- Non-distributive relatives of ETL and NFL
- Chrysippus' logic in a natural deduction setting
- Synthetic tableaux: Minimal tableau search heuristics
- Analytic tableaux for non-deterministic semantics
- CEGAR-tableaux: improved modal satisfiability via modal clause-learning and SAT
- Hybrid-logical reasoning in the Smarties and Sally-Anne tasks
- Normality, non-contamination and logical depth in classical natural deduction
- Rasiowa-Sikorski deduction systems with the rule of cut: a case study
- Correspondence analysis and automated proof-searching for first degree entailment
- Informational semantics, non-deterministic matrices and feasible deduction
- Classic-like cut-based tableau systems for finite-valued logics
- Classical natural deduction
- Focusing in Linear Meta-logic
- Tableaux for logics of time and knowledge with interactions relating to synchrony
- An efficient relational deductive system for propositional non-classical logics
- Semantics and proof-theory of depth bounded Boolean logics
- A tableau proof system for a Mazurkiewicz trace logic with fixpoints
- Labelling ideality and subideality
- Fibred tableaux for multi-implication logics
- Distributed modal theorem proving with KE
- A tableau calculus for minimal model reasoning
- The tableau-based theorem prover 3 T A P Version 4.0
- Building decision procedures for modal logics from propositional decision procedures -- the case study of modal K
- Grammar specification in categorial logics and theorem proving
- Hybrid tableaux for the difference modality
- A Set-theoretic Approach to Reasoning Services for the Description Logic 𝒟 ℒ D 4,×
- An improved set-based reasoner for the description logic \(\mathcal{DL}_\mathrm{D}^{4,\times\dagger}\)
- BOUNDED-ANALYTIC SEQUENT CALCULI AND EMBEDDINGS FOR HYPERSEQUENT LOGICS
- Towards an efficient prover for the \(C_1\) paraconsistent logic
- Using Abduction to Compute Efficient Proofs
- Labelled proofs for quantified modal logic
- Equal Rights for the Cut: Computable Non-analytic Cuts in Cut-based Proofs
- Aspects of analytic deduction
- An Optimized KE-Tableau-Based System for Reasoning in the Description Logic $${\mathcal {DL}}_{{\mathbf {D}}}^{4,\!\times }$$
- Abduction as deductive saturation: a proof-theoretic inquiry
- Non-transitive correspondence analysis
- Tableaux and interpolation for propositional justification logics
- Analytic proofs for tense logic
- A tableau system for first-order logic with standard names
- Natural constructive proofs of A via A B, proof paradoxes, and impredicativity
- A framework for proof systems
- Labelled KE for intuitionistic propositional logic
- Bivalent semantics, generalized compositionality and analytic classic-like tableaux for finite-valued logics
- Unrestricted vs restricted cut in a tableau method for Boolean circuits
- The enduring scandal of deduction. Is propositional logic really uninformative?
- Cut and pay
- An informational view of classical logic
- Optimization techniques for propositional intuitionistic logic and their implementation
This page was built for publication: The Taming of the Cut. Classical Refutations with Analytic Cut
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4304496)
