Pages that link to "Item:Q2784792"
From MaRDI portal
The following pages link to Computational complexity of infinite-valued Łukasiewicz propositional logic (Q2784792):
Displaying 14 items.
- Satisfiability checking in Łukasiewicz logic as finite constraint satisfaction (Q352963) (← links)
- Automated theorem proving for Łukasiewicz logics (Q687151) (← links)
- Complexity issues in Basic Logic (Q816857) (← links)
- The coherence of Łukasiewicz assessments is NP-complete (Q985139) (← links)
- Resolution and model building in the infinite-valued calculus of Łukasiewicz (Q1276262) (← links)
- Finite-valued reductions of infinite-valued logics (Q1407546) (← links)
- Finiteness in infinite-valued Łukasiewicz logic (Q1971778) (← links)
- New complexity results for Łukasiewicz logic (Q2317509) (← links)
- Implicit definability of truth constants in Łukasiewicz logic (Q2317518) (← links)
- On the Expressive Power of Cost Logics over Infinite Words (Q3167019) (← links)
- (Q3221399) (← links)
- Complexity Issues in Axiomatic Extensions of Lukasiewicz Logic (Q3623218) (← links)
- ON LOWER BOUNDS FOR COMPLEXITY OVER INFINITE BASISES FOR FUNCTIONS OF MULTI-VALUED LOGIC (Q5150696) (← links)
- The complexity of admissible rules of Lukasiewicz logic (Q5300587) (← links)