Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

29

STACS
2009
Springer

favoriteEmaildiscussreport

111views Theoretical Computer Science» more STACS 2009»

Fragments of First-Order Logic over Infinite Words

14 years 5 months ago

Fragments of First-Order Logic over Infinite Words

Download www.cmi.ac.in

Volker Diekert, Manfred Kufleitner

Real-time Traffic

STACS 2009 | Theoretical Computer Science |

claim paper

Related Content

» A Survey on Small Fragments of FirstOrder Logic over Finite Words

» On FirstOrder Fragments for Mazurkiewicz Traces

» FirstOrder and Temporal Logics for Nested Words

» On the Strictness of the FirstOrder Quantifier Structure Hierarchy over Finite Structures

» FirstOrder Logic vs FixedPoint Logic in Finite Set Theory

» From Separation Logic to FirstOrder Logic

» FirstOrder Model Checking Problems Parameterized by the Model

» The Boundedness Problem for Monadic Universal FirstOrder Logic

» On the Satisfiability of TwoVariable Logic over Data Words

Post Info
More Details (n/a)

Added	20 May 2010
Updated	20 May 2010
Type	Conference
Year	2009
Where	STACS
Authors	Volker Diekert, Manfred Kufleitner

Comments (0)