Propositional primal logic with disjunction

DOI10.1093/LOGCOM/EXS018MaRDI QIDQ5406129zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• From primal infon logic with individual variables to Datalog
• DKAL and Z3: a logic embedding experiment
• Logic of infons, the propositional case
• Primal Infon Logic: Derivability in Polynomial Time
• Primal infon logic with conjunctions as sets

Cited in

(6)

• The complexity of disjunction in intuitionistic logic
• The complexity of primal logic with disjunction
• Primal infon logic with conjunctions as sets
• From primal infon logic with individual variables to Datalog
• DKAL and Z3: a logic embedding experiment
• Primal implication as encryption

Describes a project that uses

Uses Software

• MiniML
• DKAL

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

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