Pages that link to "Item:Q685391"
From MaRDI portal
The following pages link to Methods for proving completeness via logical reductions (Q685391):
Displaying 14 items.
- Generalized hex and logical characterizations of polynomial space (Q287159) (← links)
- Languages represented by Boolean formulas (Q290253) (← links)
- Complete problems for monotone NP (Q673092) (← links)
- Succinct representation, leaf languages, and projection reductions (Q1271623) (← links)
- Context-sensitive transitive closure operators (Q1319508) (← links)
- A note on first-order projections and games. (Q1401218) (← links)
- The problem of guaranteeing the existence of a complete set of reductions (Q1823015) (← links)
- Does reductive proof theory have a viable rationale? (Q1841001) (← links)
- Proof-theoretic reduction as a philosopher's tool (Q1841003) (← links)
- First-order reduction and computational complexity (Q2994065) (← links)
- (Q4246965) (← links)
- Proving completeness by logic (Q4653719) (← links)
- REDUCTION TECHNIQUES FOR PROVING DECIDABILITY IN LOGICS AND THEIR MEET–COMBINATION (Q5009679) (← links)
- Checking Sufficient Completeness by Inductive Theorem Proving (Q6487296) (← links)