Primal Infon Logic: Derivability in Polynomial Time

DOI10.4230/LIPICS.FSTTCS.2013.163zbMATH Open1359.03026OpenAlexW2244480826MaRDI QIDQ2963910FDOQ2963910

Prasad Naldurg, Anguraj Baskar, S. P. Suresh, K. R. Raghavendra

Publication date: 21 February 2017

Full work available at URL: https://doi.org/10.4230/LIPIcs.FSTTCS.2013.163

zbMATH Keywords

proof theorycut eliminationintuitionistic modal logicsubformula propertyauthorization logics

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic in computer science (03B70)

Cited In (1)

• The Complexity of Disjunction in Intuitionistic Logic

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• From Primal Infon Logic with Individual Variables to Datalog 👍 👎
• Linear logic and polynomial time 👍 👎
• On the polynomial-space completeness of intuitionistic propositional logic 👍 👎
• Intuitionistic deductive databases and the polynomial time hierarchy 👍 👎
• TRANSITIVE PRIMAL INFON LOGIC 👍 👎
• Polynomial time in untyped elementary linear logic 👍 👎
• The complexity of primal logic with disjunction 👍 👎
• Primal Infon Logic with Conjunctions as Sets 👍 👎

This page was built for publication: Primal Infon Logic: Derivability in Polynomial Time

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