Pages that link to "Item:Q5480615"
From MaRDI portal
The following pages link to Complexity, decidability and completeness (Q5480615):
Displaying 8 items.
- Consistency, optimality, and incompleteness (Q490660) (← links)
- Completeness proofs for propositional logic with polynomial-time connectives (Q1123883) (← links)
- Decidability and complexity analysis by basic paramodulation (Q1281494) (← links)
- Complexity of terms, composition, and hypersubstitution (Q1864336) (← links)
- Expressive completeness and decidability (Q2277437) (← links)
- Turing-Completeness Totally Free (Q2941179) (← links)
- (Q4249223) (← links)
- Computing and Combinatorics (Q5716924) (← links)