On the Expressive Power of Cost Logics over Infinite Words
From MaRDI portal
Publication:3167019
DOI10.1007/978-3-642-31585-5_28zbMATH Open1433.03102OpenAlexW14848105MaRDI QIDQ3167019FDOQ3167019
Authors: Denis Kuperberg, Michael Vanden Boom 
Publication date: 1 November 2012
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-31585-5_28
Recommendations
- Two-way cost automata and cost logics over infinite trees
- On the expressive power of temporal logic for infinite words
- Expressive power of infinitary \([0,1]\)-logics
- LATIN 2004: Theoretical Informatics
- Computational complexity of infinite-valued Łukasiewicz propositional logic
- Fragments of first-order logic over infinite words
- Fragments of first-order logic over infinite words
- Weak cost monadic logic over infinite trees
- From ultrafilters on words to the expressive power of a fragment of logic
- Complexity of a fragment of infinitary action logic with exponential via non-well-founded proofs
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Higher-order logic (03B16) Logic in computer science (03B70)
Cited In (12)
- Two-way cost automata and cost logics over infinite trees
- Quantifying Bounds in Strategy Logic
- Cost Automata, Safe Schemes, and Downward Closures
- Regular cost functions. I: Logic and algebra over words
- Logic and regular cost functions
- Definability and transformations for cost logics and automatic structures
- Positive First-order Logic on Words and Graphs
- Regular temporal cost functions
- Index problems for game automata
- Linear temporal logic for regular cost functions
- Weak cost monadic logic over infinite trees
- Linear temporal logic for regular cost functions
This page was built for publication: On the Expressive Power of Cost Logics over Infinite Words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3167019)
