Algorithmic complexity for theories of commutative Kleene algebras
From MaRDI portal
(Redirected from Publication:6492397)
Decidability of theories and sets of sentences (03B25) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Other infinitary logic (03C75) Undecidability and degrees of sets of sentences (03D35) Cut-elimination and normal-form theorems (03F05) Other algebras related to logic (03G25)
Cites work
- An infinitary sequent system for the equational theory of *-continuous action lattices
- Arithmetical Predicates and Function Quantifiers
- Automata Studies. (AM-34)
- Classical recursion theory. The theory of functions and sets of natural numbers
- Commutative action logic
- Computability, complexity, logic. Transl. from the German
- Decision problems for propositional linear logic
- scientific article; zbMATH DE number 4210141 (Why is no real title available?)
- scientific article; zbMATH DE number 517072 (Why is no real title available?)
- scientific article; zbMATH DE number 549971 (Why is no real title available?)
- scientific article; zbMATH DE number 3316967 (Why is no real title available?)
- Infinitary action logic with exponentiation
- Infinitary action logic with multiplexing
- Infinitary action logic: complexity, models and grammars
- Kleene star, subexponentials without contraction, and infinite computations
- Linear logic
- On Context-Free Languages
- On the complexity of reasoning in Kleene algebra
- On the decision problem for MELL
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- Recursive well-orderings
This page was built for publication: Algorithmic complexity for theories of commutative Kleene algebras
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6492397)
