Polynomials, fragments of temporal logic and the variety DA over traces
From MaRDI portal
Publication:880176
DOI10.1016/J.TCS.2007.01.014zbMATH Open1111.68059OpenAlexW2037688028MaRDI QIDQ880176FDOQ880176
Authors: Manfred Kufleitner
Publication date: 11 May 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2007.01.014
Recommendations
- Polynomials, Fragments of Temporal Logic and the Variety DA over Traces
- On polynomial semantics for propositional logics
- Complexity of finite-variable fragments of propositional temporal and modal logics of computation
- Polynomial semantics for modal logics
- A fragment of dependence logic capturing polynomial time
- scientific article; zbMATH DE number 512851
- Publication:4864475
- scientific article; zbMATH DE number 2086684
- Publication:4723705
- scientific article; zbMATH DE number 2196590
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Polynomial closure and unambiguous product
- On varieties of rational languages and variable length codes. II
- Title not available (Why is that?)
- Locally trivial categories and unambiguous concatenation
- Profinite semigroups, Mal'cev products, and identities
- Title not available (Why is that?)
- Parallel Program Schemata and Maximal Parallelism I. Fundamental Results
Cited In (1)
This page was built for publication: Polynomials, fragments of temporal logic and the variety DA over traces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q880176)