Complexity of a fragment of infinitary action logic with exponential via non-well-founded proofs

DOI10.1007/978-3-030-86059-2_19OpenAlexW3198002352MaRDI QIDQ2142085

Stepan Kuznetsov

Publication date: 25 May 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-86059-2_19

zbMATH Keywords

infinitary action logicnon-well-founded proofsexponential modality

Mathematics Subject Classification ID

Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Related Items

Infinitary action logic with multiplexing, Infinitary action logic with exponentiation

Cites Work

• Linear logic
• Residuated lattices. An algebraic glimpse at substructural logics
• Infinitary action logic: complexity, models and grammars
• Decision problems for propositional linear logic
• A \(\varPi_1^0\)-bounded fragment of infinitary action logic with exponential
• Infinitary action logic with exponentiation
• Soft subexponentials and multiplexing
• Language-theoretic and finite relation models for the (full) Lambek calculus
• On the complexity of reasoning in Kleene algebra
• On Action Logic: Equational Theories of Action Algebras
• Logics without the contraction rule
• Subexponentials in non-commutative linear logic
• Least and Greatest Fixed Points in Linear Logic
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item