The following pages link to (Q2753597):
Displaying 16 items.
- Semantics and proof-theory of depth bounded Boolean logics (Q385021) (← links)
- A curious dialogical logic and its composition problem (Q484198) (← links)
- The interrogative model of inquiry meets dynamic epistemic logics (Q514587) (← links)
- Bivalent semantics, generalized compositionality and analytic classic-like tableaux for finite-valued logics (Q744990) (← links)
- An informational view of classical logic (Q897935) (← links)
- Optimization techniques for propositional intuitionistic logic and their implementation (Q959821) (← links)
- Synthetic tableaux: Minimal tableau search heuristics (Q2104533) (← links)
- Normality, non-contamination and logical depth in classical natural deduction (Q2307304) (← links)
- SAT-based explicit LTL reasoning and its application to satisfiability checking (Q2335900) (← links)
- A Dynamic Logic of Interrogative Inquiry (Q3305312) (← links)
- FRACTIONAL SEMANTICS FOR CLASSICAL LOGIC (Q3389493) (← links)
- A Set-theoretic Approach to Reasoning Services for the Description Logic 𝒟 ℒ D 4,× (Q4988948) (← 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)
- Belief Merging by Examples (Q5277910) (← links)
- Graded tableaux for Rational Pavelka Logic (Q5717796) (← links)
- Unified deductive systems: an outline (Q6146292) (← links)