The following pages link to Complexity issues in Basic Logic (Q816857):
Displaying 11 items.
- Disjunction property and complexity of substructural logics (Q549720) (← links)
- Approximation and universality of fuzzy Turing machines (Q954457) (← links)
- The consequence relation in the logic of commutative GBL-algebras is PSPACE-complete (Q1006641) (← links)
- Lattice-valued fuzzy Turing machines: computing power, universality and efficiency (Q1043325) (← links)
- Automated theorem provers for multiple-valued logics with satisfiability modulo theory solvers (Q1697332) (← links)
- Approximation and robustness of fuzzy finite automata (Q2270389) (← links)
- MNiBLoS: a SMT-based solver for continuous t-norm based logics and some of their modal expansions (Q2282273) (← links)
- New complexity results for Łukasiewicz logic (Q2317509) (← links)
- Computational complexities of axiomatic extensions of monoidal t-norm based logic (Q2391235) (← links)
- Fuzzy Time in Linear Temporal Logic (Q2946742) (← links)
- The Complexity of 3-Valued Łukasiewicz Rules (Q5268448) (← links)
