Pages that link to "Item:Q4304496"
From MaRDI portal
The following pages link to The Taming of the Cut. Classical Refutations with Analytic Cut (Q4304496):
Displaying 49 items.
- Informational semantics, non-deterministic matrices and feasible deduction (Q281148) (← links)
- Semantics and proof-theory of depth bounded Boolean logics (Q385021) (← links)
- A framework for proof systems (Q707742) (← links)
- Bivalent semantics, generalized compositionality and analytic classic-like tableaux for finite-valued logics (Q744990) (← links)
- Unrestricted vs restricted cut in a tableau method for Boolean circuits (Q812394) (← links)
- The enduring scandal of deduction. Is propositional logic really uninformative? (Q833033) (← links)
- Cut and pay (Q851192) (← links)
- An informational view of classical logic (Q897935) (← links)
- Optimization techniques for propositional intuitionistic logic and their implementation (Q959821) (← links)
- An epistemic operator for description logics (Q1128772) (← links)
- Representing scope in intuitionistic deductions (Q1274448) (← links)
- Are tableaux an improvement on truth-tables? Cut-free proofs and bivalence (Q1314288) (← links)
- A generalization of analytic deduction via labelled deductive systems. I: Basic substructural logics (Q1344886) (← links)
- The proof complexity of analytic and clausal tableaux (Q1575658) (← links)
- Building decision procedures for modal logics from propositional decision procedures: The case study of modal \(K(m)\). (Q1854375) (← links)
- Using tableaux to automate the Lambek and other categorial calculi (Q1854380) (← links)
- Non-distributive relatives of ETL and NFL (Q2021563) (← links)
- Chrysippus' logic in a natural deduction setting (Q2094135) (← links)
- Synthetic tableaux: Minimal tableau search heuristics (Q2104533) (← links)
- Analytic tableaux for non-deterministic semantics (Q2142063) (← links)
- CEGAR-tableaux: improved modal satisfiability via modal clause-learning and SAT (Q2142066) (← links)
- Hybrid-logical reasoning in the Smarties and Sally-Anne tasks (Q2258816) (← links)
- Normality, non-contamination and logical depth in classical natural deduction (Q2307304) (← links)
- Rasiowa-Sikorski deduction systems with the rule of cut: a case study (Q2422312) (← links)
- Correspondence analysis and automated proof-searching for first degree entailment (Q2663794) (← links)
- Classic-Like Cut-Based Tableau Systems for Finite-Valued Logics (Q2915037) (← links)
- Focusing in Linear Meta-logic (Q3541726) (← links)
- Tableaux for logics of time and knowledge with interactions relating to synchrony (Q3647215) (← links)
- An efficient relational deductive system for propositional non-classical logics (Q3647245) (← links)
- A tableau proof system for a mazurkiewicz trace logic with fixpoints (Q4610334) (← links)
- Labelling ideality and subideality (Q4632306) (← links)
- Fibred tableaux for multi-implication logics (Q4645223) (← links)
- Distributed modal theorem proving with KE (Q4645234) (← links)
- A tableau calculus for minimal model reasoning (Q4645243) (← links)
- The tableau-based theorem prover 3 T A P Version 4.0 (Q4647529) (← links)
- Building decision procedures for modal logics from propositional decision procedures — The case study of modal K (Q4647549) (← links)
- Grammar specification in categorial logics and theorem proving (Q4647559) (← links)
- Hybrid Tableaux for the Difference Modality (Q4982124) (← links)
- A Set-theoretic Approach to Reasoning Services for the Description Logic 𝒟 ℒ D 4,× (Q4988948) (← links)
- An Improved Set-based Reasoner for the Description Logic 𝒟ℒD4,׆ (Q4991928) (← links)
- BOUNDED-ANALYTIC SEQUENT CALCULI AND EMBEDDINGS FOR HYPERSEQUENT LOGICS (Q5159492) (← links)
- Towards an Efficient Prover for the <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mi>C</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:math> Paraconsistent Logic (Q5170293) (← links)
- Using Abduction to Compute Efficient Proofs (Q5178959) (← links)
- Labelled proofs for quantified modal logic (Q5235254) (← links)
- Equal Rights for the Cut: Computable Non-analytic Cuts in Cut-based Proofs (Q5436992) (← links)
- An Optimized KE-Tableau-Based System for Reasoning in the Description Logic $${\mathcal {DL}}_{{\mathbf {D}}}^{4,\!\times }$$ (Q6104768) (← links)
- Abduction as deductive saturation: a proof-theoretic inquiry (Q6145029) (← links)
- Non-transitive correspondence analysis (Q6156626) (← links)
- Tableaux and interpolation for propositional justification logics (Q6564678) (← links)
