Complexity of Boolean algebras
type: Item
instance of: scholarly article
title: Complexity of Boolean algebras
zbMATH Open document ID: 0428.03036
DOI: 10.1016/0304-3975(80)90048-1
author: Dexter Kozen
published in: Theoretical Computer Science
publication date: 1980-01-01T00:00:00Z
Mathematics Subject Classification ID: 03D15
Mathematics Subject Classification ID: 06E99
Mathematics Subject Classification ID: 03B25
zbMATH DE Number: 3666785
zbMATH Keywords: alternating Turing machines
zbMATH Keywords: computable sets
zbMATH Keywords: first order theory of Boolean algebras
zbMATH Keywords: decision procedure
MaRDI profile type: Publication
full work available at URL: 0304-3975(80)90048-1
OpenAlex ID: W2083251422
cites work: On the computational power of pushdown automata
cites work: Q5331549
cites work: Model theory.
cites work: The complexity of theorem-proving procedures
cites work: An application of games to the completeness problem for formalized theories
cites work: A Decision Procedure for the First Order Theory of Real Addition with Order
cites work: Q3880807
cites work: Q4142699
cites work: The polynomial-time hierarchy
cites work: Q4131648
cites work: Rudimentary Predicates and Relative Computation
description: scientific article; zbMATH DE number 3666785