Algorithmic complexity of theories with Kleene iteration
From MaRDI portal
Cites work
- *-continuity vs. induction: divide and conquer
- A completeness theorem for Kleene algebras and the algebra of regular events
- A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
- A note on hereditarily Π10- and Σ10-complete sets of sentences
- Algorithmic complexity for theories of commutative Kleene algebras
- An infinitary sequent system for the equational theory of *-continuous action lattices
- Arithmetical Predicates and Function Quantifiers
- Automata Studies. (AM-34)
- Axiomatische Begründung der allgemeinen Idealtheorie.
- Circular proofs for the Gödel-Löb provability logic
- Classical recursion theory. The theory of functions and sets of natural numbers
- Classical system of Martin-Löf's inductive definitions is not equivalent to cyclic proofs
- Closure ordinal of immediate derivability operator of infinitary action logic
- Commutative action logic
- Complete systems of \(\mathcal B\)-rational identities
- Complexity of the infinitary Lambek calculus with Kleene star
- Computability, complexity, logic. Transl. from the German
- Computable structures and the hyperarithmetical hierarchy
- Creative sets
- Cut-elimination theorem for relevant logics
- Cyclic arithmetic is equivalent to Peano arithmetic
- Decision problems for propositional linear logic
- Distributive full Lambek calculus has the finite model property
- Expressing additives using multiplicatives and subexponentials
- Fragments of arithmetic and cyclic proofs
- From semirings to residuated Kleene lattices
- Games for the -calculus
- scientific article; zbMATH DE number 3148870 (Why is no real title available?)
- scientific article; zbMATH DE number 4210141 (Why is no real title available?)
- scientific article; zbMATH DE number 3179944 (Why is no real title available?)
- scientific article; zbMATH DE number 194101 (Why is no real title available?)
- scientific article; zbMATH DE number 3560737 (Why is no real title available?)
- scientific article; zbMATH DE number 1222927 (Why is no real title available?)
- scientific article; zbMATH DE number 549971 (Why is no real title available?)
- scientific article; zbMATH DE number 1033559 (Why is no real title available?)
- scientific article; zbMATH DE number 873168 (Why is no real title available?)
- scientific article; zbMATH DE number 3316966 (Why is no real title available?)
- scientific article; zbMATH DE number 3316967 (Why is no real title available?)
- scientific article; zbMATH DE number 3366846 (Why is no real title available?)
- scientific article; zbMATH DE number 3045417 (Why is no real title available?)
- Infinitary action logic with exponentiation
- Infinitary action logic with multiplexing
- Infinitary action logic: complexity, models and grammars
- Iterative division in the distributive full non-associative Lambek calculus
- Kleene star, subexponentials without contraction, and infinite computations
- Lambek calculus and its relational semantics: Completeness and incompleteness
- Lambek grammars with one division and one primitive type
- Language models for some extensions of the Lambek calculus
- Left-Handed Completeness for Kleene algebra, via Cyclic Proofs
- Linear logic
- Logic Programming with Focusing Proofs in Linear Logic
- Meeting of the Association for Symbolic Logic, New York 1969
- NON-WELL-FOUNDED PROOFS FOR THE GRZEGORCZYK MODAL LOGIC
- Non-wellfounded proof theory for (Kleene+action)(algebras+lattices)
- On Action Logic: Equational Theories of Action Algebras
- On the complexity of reasoning in Kleene algebra
- On the complexity of reasoning in Kleene algebra with commutativity conditions
- On the decision problem for MELL
- On tools for completeness of Kleene algebra with hypotheses
- Proof theory
- Recursive unsolvability of a problem of Thue
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- Recursive well-orderings
- Relational Models for the Lambek Calculus with Intersection and Constants
- Residuated lattices.
- Residuated lattices. An algebraic glimpse at substructural logics
- Sequent calculi for induction and infinite descent
- The `long rule' in the Lambek calculus with iteration: undecidability without meets and joins
- The Lambek calculus with iteration: two variants
- The logic of action lattices is undecidable
- The logic of categorial grammars. A deductive account of natural language syntax and semantics
- The Mathematics of Sentence Structure
- Tightening the complexity of equivalence problems for commutative grammars
- Untersuchungen über das logische Schließen. I.
This page was built for publication: Algorithmic complexity of theories with Kleene iteration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7267362)
