Expressing additives using multiplicatives and subexponentials

DOI10.1017/S0960129516000293MaRDI QIDQ4637626zbMATH OpenOpenAlexFDO

Authors Kaustuv Chaudhuri

Publication date 25 April 2018

Published in Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0960129516000293

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Recommendations

• Permutative Additives and Exponentials
• Additive bases and subadditive functions
• Study of multiplicative derivation and its additivity
• scientific article; zbMATH DE number 1066943
• Multipliers in subtraction algebras
• Compound sums and subexponentiality
• On multiplicative and additive differences
• scientific article; zbMATH DE number 4091500
• Exponential sums with multiplicative coefficients

Cites work

• A general proof system for modalities in concurrent constraint programming
• A logical characterization of forward and backward chaining in the inverse method
• An extended framework for specifying and reasoning about proof systems
• Classical and intuitionistic subexponential logics are equally expressive
• Decision problems for propositional linear logic
• Focusing and polarization in linear, intuitionistic, and classical logics
• From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic
• Logic Programming with Focusing Proofs in Linear Logic
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• Specifying proof systems in linear logic with subexponentials
• Structural focalization
• Types for Proofs and Programs
• Undecidability of multiplicative subexponential logic

Cited in

(4)

• An adequate compositional encoding of bigraph structure in linear logic with subexponentials
• Classical and intuitionistic subexponential logics are equally expressive
• Undecidability of multiplicative subexponential logic
• Algorithmic complexity of theories with Kleene iteration

This page was built for publication: Expressing additives using multiplicatives and subexponentials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4637626)