An algorithm for the class of pure implicational formulas

DOI10.1016/S0166-218X(99)00038-4MaRDI QIDQ1961448zbMATH OpenOpenAlexFDO

Authors J. Goldsmith, John S. Schlipf, Ewald Speckenmeyer, R. P. Swaminathan, John V. Franco

Publication date 17 January 2000

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0166-218x(99)00038-4

zbMATH Keywords

falsifiability problempure implicational formulas

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• Proof finding algorithms for implicational logics
• A note on the computational complexity of the pure classical implication calculus
• Publication:4729408
• The complexity of the falsifiability problem for pure implicational formulas
• The complexity of the falsifiability problem for pure implicational formulas
• scientific article; zbMATH DE number 66912
• Algorithmic proof methods and cut elimination for implicational logics. I: Modal implication
• Proof complexity of intuitionistic implicational formulas
• An algebraic analysis of implication in non-distributive logics
• scientific article; zbMATH DE number 4158594

Cited in

(10)

• A note on the computational complexity of the pure classical implication calculus
• Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable
• Improving a fixed parameter tractability time bound for the shadow problem
• On generalizations of the shadow independent set problem
• The complexity of the falsifiability problem for pure implicational formulas
• The extended alpha-triple I algorithm based on the generalized implication operator
• Proof finding algorithms for implicational logics
• The complexity of the falsifiability problem for pure implicational formulas
• Computing All Implied Equalities via SMT-Based Partition Refinement
• Algorithmic correspondence for relevance logics, bunched implication logics, and relation algebras via an implementation of the algorithm \textsf{PEARL}

Describes a project that uses

Uses Software

• Leibniz

This page was built for publication: An algorithm for the class of pure implicational formulas

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