Infinitary action logic with multiplexing

DOI10.1007/s11225-022-10021-6OpenAlexW4309650751MaRDI QIDQ2698280

Stepan Kuznetsov, Stanislav O. Speranski

Publication date: 21 April 2023

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11225-022-10021-6

zbMATH Keywords

complexityLambek calculusclosure ordinalmultiplexinginfinitary action logic

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Cites Work

• Linear logic
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• Infinitary action logic: complexity, models and grammars
• Decision problems for propositional linear logic
• Elementary induction on abstract structures
• Light linear logic
• Soft linear logic and polynomial time
• Infinitary action logic with exponentiation
• Soft subexponentials and multiplexing
• Complexity of a fragment of infinitary action logic with exponential via non-well-founded proofs
• The Mathematics of Sentence Structure
• On Action Logic: Equational Theories of Action Algebras
• Subexponentials in non-commutative linear logic
• Multiplexor Categories and Models of Soft Linear Logic
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Infinitary action logic with multiplexing