The complexity of admissible rules of Lukasiewicz logic

DOI10.1093/logcom/exs007zbMath1279.03045arXiv1108.6261OpenAlexW2128311727MaRDI QIDQ5300587

Emil Jeřábek

Publication date: 27 June 2013

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1108.6261

zbMATH Keywords

computational complexityŁukasiewicz logicPSPACE-completeadmissible rule

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Many-valued logic (03B50) Complexity of proofs (03F20)

Related Items

PRESERVATION OF ADMISSIBLE RULES WHEN COMBINING LOGICS, Structural completeness in many-valued logics with rational constants, On the complexity of validity degrees in Łukasiewicz logic