Pages that link to "Item:Q5300587"
From MaRDI portal
The following pages link to The complexity of admissible rules of Lukasiewicz logic (Q5300587):
Displaying 10 items.
- Lexicographic rationalizability and iterated admissibility (Q674075) (← links)
- Bases of admissible rules of proper axiomatic extensions of Łukasiewicz logic (Q723257) (← links)
- Complexity of admissible rules (Q868660) (← links)
- Structural completeness in many-valued logics with rational constants (Q2080696) (← links)
- On the complexity of validity degrees in Łukasiewicz logic (Q2106603) (← links)
- Computational complexity of infinite-valued Łukasiewicz propositional logic (Q2784792) (← links)
- Bases of Admissible Rules of Lukasiewicz Logic (Q3069724) (← links)
- Complexity Issues in Axiomatic Extensions of Lukasiewicz Logic (Q3623218) (← links)
- PRESERVATION OF ADMISSIBLE RULES WHEN COMBINING LOGICS (Q5737940) (← links)
- Universal proof theory: feasible admissibility in intuitionistic modal logics (Q6652040) (← links)