Skip to main content
SpringerLink
Log in

Uniformization Problem for Variants of First Order Logic over Finite Words

  • Conference paper
  • First Online:
Developments in Language Theory (DLT 2018)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11088))

Included in the following conference series:

  • 652 Accesses

Abstract

We study the uniformization problem for natural variants of the first order logic over finite words. We show that none of them has the uniformization property, as witnessed by proposed counterexamples.

This article is part of a project that has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (ERC Consolidator Grant LIPA, grant agreement No. 683080).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Kechris, A.S.: Classical Descriptive Set Theory. Springer, New York (1995). https://doi.org/10.1007/978-1-4612-4190-4

    Book  MATH  Google Scholar 

  2. Rabin, M.O.: Decidability of second-order theories and automata on infinite trees. Trans. Am. Math. Soc. 141, 1–35 (1969)

    MathSciNet  MATH  Google Scholar 

  3. Lifsches, S., Shelah, S.: Uniformization and skolem functions in the class of trees. J. Symbolic Logic 63, 103–127 (1998)

    Article  MathSciNet  Google Scholar 

  4. Gurevich, Y., Shelah, S.: Rabin’s uniformization problem. J. Symbolic Logic 48(4), 1105–1119 (1983)

    Article  MathSciNet  Google Scholar 

  5. Carayol, A., Löding, C., Niwiñski, D., Walukiewicz, I.: Choice functions and well-orderings over the infinite binary tree. Cent. Eur. J. Math. 8(4), 662–682 (2010)

    MathSciNet  MATH  Google Scholar 

  6. Bilkowski, M., Skrzypczak, M.: Unambiguity and uniformization problems on infinite trees. Della Rocca, S.R. (ed.) Comput. Sci. Logic 23, 81–100 (2013)

    Google Scholar 

  7. Courcelle, B., Engelfriet, J.: Graph Structure and Monadic Second-Order Logic: A Language-Theoretic Approach, 2nd edn. Cambridge University Press, Cambridge (2012)

    Book  Google Scholar 

  8. Ebbinghaus, H.-D., Flum, J., Thomas, W.: Mathematical Logic, 2nd edn. Springer, New York Inc. (1996). https://doi.org/10.1007/978-1-4757-2355-7

    Book  MATH  Google Scholar 

  9. Kamp, J.A.W.: Tense logic and the theory of linear order. Ph.D. thesis, University of California, Los Angeles (1968)

    Google Scholar 

  10. Etessami, K., Vardi, M.Y., Wilke, T.: First-order logic with two variables and unary temporal logic. Inf. Comput. 179(2), 279–295 (2002)

    Article  MathSciNet  Google Scholar 

  11. Straubing, H.: Finite Automata, Formal Logic, and Circuit Complexity. Progress in Theoretical Computer Science, 1st edn. Birkhüser, Basel (1994)

    Book  Google Scholar 

  12. Schützenberger, M.P.: On finite monoids having only trivial subgroups. Inf. Control 8(2), 190–194 (1965)

    Article  MathSciNet  Google Scholar 

  13. McNaughton, R., Papert, S.: Counter-Free Automata. M.I.T. Press Research Monographs, M.I.T. Press, Cambridge (1971)

    MATH  Google Scholar 

  14. Place, T., Segoufin, L.: Decidable Characterization of FO2 \((< +1)\) and locality of DA. CoRR abs/1606.03217 http://arxiv.org/abs/1606.03217 (2016)

  15. Beauquier, D., Pin, J.É.: Languages and scanners. Theor. Comput. Sci. Arch. 84(1), 3–21 (1991)

    Article  Google Scholar 

Download references

Acknowledgements

The author would like to thank M. Skrzypczak for fruitful discussions and suggestions on the topic.

Author information

Authors and Affiliations

  1. University of Warsaw, Banacha 2, 02-097, Warsaw, Poland

    Vincent Michielini

Authors
  1. Vincent Michielini
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Vincent Michielini .

Editor information

Editors and Affiliations

  1. National Archives of Japan, Tokyo, Japan

    Mizuho Hoshi

  2. The University of Electro-Communications, Tokyo, Japan

    Shinnosuke Seki

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Michielini, V. (2018). Uniformization Problem for Variants of First Order Logic over Finite Words. In: Hoshi, M., Seki, S. (eds) Developments in Language Theory. DLT 2018. Lecture Notes in Computer Science(), vol 11088. Springer, Cham. https://doi.org/10.1007/978-3-319-98654-8_42

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-98654-8_42

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-98653-1

  • Online ISBN: 978-3-319-98654-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation