Pages that link to "Item:Q1314288"
From MaRDI portal
The following pages link to Are tableaux an improvement on truth-tables? Cut-free proofs and bivalence (Q1314288):
Displaying 24 items.
- Semantics and proof-theory of depth bounded Boolean logics (Q385021) (← links)
- Bivalent semantics, generalized compositionality and analytic classic-like tableaux for finite-valued logics (Q744990) (← links)
- Cut and pay (Q851192) (← links)
- The SAT-based approach to separation logic (Q862390) (← links)
- Representing scope in intuitionistic deductions (Q1274448) (← links)
- A generalization of analytic deduction via labelled deductive systems. I: Basic substructural logics (Q1344886) (← links)
- Relative efficiency of propositional proof systems: Resolution vs. cut-free LK (Q1577476) (← links)
- Non-distributive relatives of ETL and NFL (Q2021563) (← links)
- Synthetic tableaux: Minimal tableau search heuristics (Q2104533) (← links)
- Normality, non-contamination and logical depth in classical natural deduction (Q2307304) (← links)
- The universe of propositional approximations (Q2369011) (← links)
- Rasiowa-Sikorski deduction systems with the rule of cut: a case study (Q2422312) (← links)
- Identifying Efficient Abductive Hypotheses Using Multicriteria Dominance Relation (Q2946739) (← links)
- On the Power of Substitution in the Calculus of Structures (Q2946759) (← links)
- An efficient relational deductive system for propositional non-classical logics (Q3647245) (← links)
- An empirical analysis of modal theorem provers (Q4443417) (← links)
- Non-elementary speed-ups in proof length by different variants of classical analytic calculi (Q4610324) (← links)
- Building decision procedures for modal logics from propositional decision procedures — The case study of modal K (Q4647549) (← links)
- The Universe of Approximations (Q4924531) (← links)
- Hybrid Tableaux for the Difference Modality (Q4982124) (← 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)
- Automated Proof-searching for Strong Kleene Logic and its Binary Extensions via Correspondence Analysis (Q5215504) (← links)
- Abduction as deductive saturation: a proof-theoretic inquiry (Q6145029) (← links)
- Tableaux and interpolation for propositional justification logics (Q6564678) (← links)
