TRANSITIVE PRIMAL INFON LOGIC

DOI10.1017/S1755020312000366zbMath1280.03036OpenAlexW1966669926MaRDI QIDQ4928774

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

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

Related Items (1)

Lewis meets Brouwer: constructive strict implication

Uses Software

• DKAL

Cites Work

• Complexity of subclasses of the intuitionistic propositional calculus
• 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
• Linear-time algorithms for testing the satisfiability of propositional horn formulae

This page was built for publication: TRANSITIVE PRIMAL INFON LOGIC