Complexity results for classes of quantificational formulas
type: Item
instance of: scholarly article
title: Complexity results for classes of quantificational formulas
zbMATH Open document ID: 0471.03034
DOI: 10.1016/0022-0000(80)90027-6
author: Harry R. Lewis
published in: Journal of Computer and System Sciences
publication date: 1980-01-01T00:00:00Z
Mathematics Subject Classification ID: 03D15
Mathematics Subject Classification ID: 03D10
Mathematics Subject Classification ID: 03B10
zbMATH DE Number: 3737644
Wikidata QID: Q59650026
MaRDI profile type: Publication
full work available at URL: 0022-0000(80)90027-6
OpenAlex ID: W2080220005
cites work: Linear sampling and the ∀∃∀ case of the decision problem
cites work: Solvable cases of the decision problem
cites work: Q4138187
cites work: A hierarchy for nondeterministic time complexity
cites work: Classification of $AEA$ formulas by letter atoms
cites work: Q3905252
cites work: On the Computational Complexity of Algorithms
cites work: Turing machines and the spectra of first-order formulas
cites work: Description of restricted automata by first-order formulae
cites work: Q3856727
cites work: Satisfiability problems for propositional calculi
cites work: Q3915990
cites work: Q4090322
cites work: A \(2^{2^{2^{pn}}}\) upper bound on the complexity of Presburger arithmetic
cites work: Complete problems in the first-order predicate calculus
cites work: Q3888985
cites work: Q5573940
description: scientific article; zbMATH DE number 3737644