Pages that link to "Item:Q4645221"
From MaRDI portal
The following pages link to Theorem Proving with Analytic Tableaux and Related Methods (Q4645221):
Displaying 20 items.
- On sets, types, fixed points, and checkerboards (Q4645222) (← links)
- Fibred tableaux for multi-implication logics (Q4645223) (← links)
- Interpolation for a sequent calculus of generalized quantifiers (Q4645224) (← links)
- Almost duplication-free tableau calculi for prepositional lax logics (Q4645225) (← links)
- Combining many-valued and intuitionistic tableaux (Q4645226) (← links)
- Cyclic connections (Q4645228) (← links)
- Incremental theory reasoning methods for semantic tableaux (Q4645229) (← links)
- The disconnection method (Q4645231) (← links)
- Sequent calculi for default and autoepistemic logics (Q4645232) (← links)
- Minimal model generation with positive unit hyper-resolution tableaux (Q4645233) (← links)
- Distributed modal theorem proving with KE (Q4645234) (← links)
- A simple tableau system for the logic of elsewhere (Q4645235) (← links)
- Situational Calculus, linear connection proofs and STRIPS-like planning: An experimental comparison (Q4645236) (← links)
- Efficient loop-check for backward proof search in some non-classical propositional logics (Q4645239) (← links)
- Strong normalization for all-style LKtq (Q4645240) (← links)
- T-string unification: Unifying prefixes in non-classical proof methods (Q4645241) (← links)
- A timing refinement of intuitionistic proofs and its application to the timing analysis of combinational circuits (Q4645242) (← links)
- A tableau calculus for minimal model reasoning (Q4645243) (← links)
- On the intuitionistic force of classical search (Extended abstract) (Q4645244) (← links)
- Proof-search in intuitionistic logic based on constraint satisfaction (Q4645245) (← links)
