An algorithm for the class of pure implicational formulas
type: Item
instance of: scholarly article
title: An algorithm for the class of pure implicational formulas
zbMATH Open document ID: 0941.68154
DOI: 10.1016/S0166-218X(99)00038-4
author: J. Goldsmith
author: John S. Schlipf
author: Ewald Speckenmeyer
author: R. P. Swaminathan
author: John V. Franco
published in: Discrete Applied Mathematics
publication date: 2000-01-17T00:00:00Z
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 1389865
zbMATH Keywords: pure implicational formulas
zbMATH Keywords: falsifiability problem
describes a project that uses: Leibniz
MaRDI profile type: Publication
full work available at URL: s0166-218x(99)00038-4
OpenAlex ID: W2037072284
Recommended article: Proof finding algorithms for implicational logics
Recommended article: A note on the computational complexity of the pure classical implication calculus
Recommended article: Q4729408
Recommended article: The complexity of the falsifiability problem for pure implicational formulas
Recommended article: Q4011579
Recommended article: Algorithmic proof methods and cut elimination for implicational logics. I: Modal implication
Recommended article: Proof complexity of intuitionistic implicational formulas
Recommended article: An algebraic analysis of implication in non-distributive logics
Recommended article: Q3486540
description: scientific article; zbMATH DE number 1389865