Transitive primal infon logic

DOI10.1017/S1755020312000366MaRDI QIDQ4928774zbMATH OpenOpenAlexFDO

Authors Carlos Cotrini, Yuri Gurevich

Publication date 18 June 2013

Published in The Review of Symbolic Logic (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Classical propositional logic (03B05) Other nonclassical logic (03B60) Logic in computer science (03B70)

Recommendations

• Primal Infon Logic: Derivability in Polynomial Time
• Basic primal infon logic
• Logic of infons, the propositional case
• Primal infon logic with conjunctions as sets
• scientific article; zbMATH DE number 5606348

Cites work

• Complexity of subclasses of the intuitionistic propositional calculus
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• LTUR: A simplified linear-time unit resolution algorithm for Horn formulae and computer implementation
• Many-dimensional modal logics: theory and applications
• The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic

Cited in

(7)

• Lewis meets Brouwer: constructive strict implication
• Basic primal infon logic
• Logic of infons, the propositional case
• Primal Infon Logic: Derivability in Polynomial Time
• Primal infon logic with conjunctions as sets
• Primal implication as encryption
• Primal logic of information

Describes a project that uses

Uses Software

• DKAL

This page was built for publication: Transitive primal infon logic

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