Algorithmic complexity for theories of commutative Kleene algebras
From MaRDI portal
Publication:6492397
DOI10.4213/im9480eMaRDI QIDQ6492397
Publication date: 25 April 2024
Published in: Izvestiya: Mathematics (Search for Journal in Brave)
Undecidability and degrees of sets of sentences (03D35) Decidability of theories and sets of sentences (03B25) Cut-elimination and normal-form theorems (03F05) Other algebras related to logic (03G25) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Other infinitary logic (03C75)
This page was built for publication: Algorithmic complexity for theories of commutative Kleene algebras