Polynomials, fragments of temporal logic and the variety DA over traces
type: Item
instance of: scholarly article
title: Polynomials, fragments of temporal logic and the variety DA over traces
zbMATH Open document ID: 1111.68059
author: Manfred Kufleitner
published in: Theoretical Computer Science
publication date: 2007-05-11T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 03B44
zbMATH DE Number: 5151700
zbMATH Keywords: Mazurkiewicz traces
zbMATH Keywords: polynomial closure
zbMATH Keywords: temporal logic
MaRDI profile type: Publication
full work available at URL: j.tcs.2007.01.014
OpenAlex ID: W2037688028
cites work: Q4132170
cites work: Q4737221
cites work: Parallel Program Schemata and Maximal Parallelism I. Fundamental Results
cites work: Q3771629
cites work: On varieties of rational languages and variable length codes. II
cites work: Locally trivial categories and unambiguous concatenation
cites work: Profinite semigroups, Mal'cev products, and identities
cites work: Polynomial closure and unambiguous product
cites work: Q4407441
DOI: 10.1016/J.TCS.2007.01.014
Recommended article: Polynomials, Fragments of Temporal Logic and the Variety DA over Traces
Recommended article: On polynomial semantics for propositional logics
Recommended article: Complexity of finite-variable fragments of propositional temporal and modal logics of computation
Recommended article: Polynomial semantics for modal logics
Recommended article: A fragment of dependence logic capturing polynomial time
Recommended article: Q4281547
Recommended article: Q4864475
Recommended article: Q4737221
Recommended article: Q4723705
Recommended article: Q5465440
description: scientific article; zbMATH DE number 5151700