Infinitary action logic: complexity, models and grammars
From MaRDI portal
Publication:935019
DOI10.1007/s11225-008-9116-7zbMath1209.03015OpenAlexW2149439075MaRDI QIDQ935019
Wojciech Buszkowski, Ewa Palka
Publication date: 31 July 2008
Published in: Studia Logica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11225-008-9116-7
Logic of natural languages (03B65) Algebraic theory of languages and automata (68Q70) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Cylindric and polyadic algebras; relation algebras (03G15)
Related Items
Complexity of a fragment of infinitary action logic with exponential via non-well-founded proofs ⋮ Parsing/theorem-proving for logical grammar \textit{CatLog3} ⋮ Relational Models for the Lambek Calculus with Intersection and Constants ⋮ On the Logic of Expansion in Natural Language ⋮ Relational models for the Lambek calculus with intersection and unit ⋮ Infinitary action logic with multiplexing ⋮ Kleene star, subexponentials without contraction, and infinite computations ⋮ The multiplicative-additive Lambek calculus with subexponential and bracket modalities ⋮ COMPLEXITY OF THE INFINITARY LAMBEK CALCULUS WITH KLEENE STAR
Cites Work
- Cut-elimination theorem for relevant logics
- A completeness theorem for Kleene algebras and the algebra of regular events
- From semirings to residuated Kleene lattices
- Lambek calculus is NP-complete
- On the complexity of reasoning in Kleene algebra
- The Mathematics of Sentence Structure
- On Action Logic: Equational Theories of Action Algebras
- On the Complexity of the Equational Theory of Relational Action Algebras
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item