Propositional primal logic with disjunction

DOI10.1093/logcom/exs018zbMath1327.03023OpenAlexW2089024112MaRDI QIDQ5406129

Lev D. Beklemishev, Yuri Gurevich

Publication date: 1 April 2014

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/6fc9f8bc71b9588de2af35dd9adfe41f5d4e3ff6

zbMATH Keywords

complexitycut eliminationKripke semanticsauthorization languageDKALprimal logic

Mathematics Subject Classification ID

Logic in computer science (03B70) Cut-elimination and normal-form theorems (03F05)

Related Items (2)

The Complexity of Disjunction in Intuitionistic Logic ⋮ The complexity of primal logic with disjunction

Uses Software

• DKAL
• MiniML

This page was built for publication: Propositional primal logic with disjunction