Skip to main content
SpringerLink
Log in

Decidable and Undecidable Fragments of First-Order Concatenation Theory

  • Conference paper
  • First Online:
Sailing Routes in the World of Computation (CiE 2018)

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

Included in the following conference series:

Abstract

We identify a number of decidable and undecidable fragments of first-order concatenation theory. We also give a purely universal axiomatization which is complete for the fragments we identify. Furthermore, we prove some normal-form results.

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. Büchi, J.R., Senger, S.: Coding in the existential theory of concatenation. Arch. Math. Logik 26, 101–106 (1986)

    Article  MathSciNet  Google Scholar 

  2. Day, J., Ganesh, V., He, P., Manea, F., Nowotka, D.: The satisfiability of extended word equations: the boundary between decidability and undecidability. arXiv:1802.00523 (2018)

  3. Ganesh, V., Minnes, M., Solar-Lezama, A., Rinard, M.: Word equations with length constraints: what’s decidable? In: Biere, A., Nahir, A., Vos, T. (eds.) HVC 2012. LNCS, vol. 7857, pp. 209–226. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-39611-3_21

    Chapter  Google Scholar 

  4. Grzegorczyk, A.: Undecidability without arithmetization. Stud. Logica. 79, 163–230 (2005)

    Article  MathSciNet  Google Scholar 

  5. Grzegorczyk, A., Zdanowski, K.: Undecidability and concatenation. In: Ehrenfeucht, A., et al. (eds.) Andrzej Mostowski and Foundational Studies, pp. 72–91. IOS, Amsterdam (2008)

    Google Scholar 

  6. Halfon, S., Schnoebelen, P., Zetzsche, G.: Decidability, complexity, and expressiveness of first-order logic over the subword ordering. In: Proceedings of LICS 2017, pp. 1–12. IEEE Computer Society (2017)

    Google Scholar 

  7. Horihata, Y.: Weak theories of concatenation and arithmetic. Notre Dame J. Formal Log. 53, 203–222 (2012)

    Article  MathSciNet  Google Scholar 

  8. Karhumäki, J., Mignosi, F., Plandowski, W.: The expressibility of languages and relations by word equations. J. ACM 47, 483–505 (2000)

    Article  MathSciNet  Google Scholar 

  9. Kristiansen, L., Murwanashyaka, J.: Notes on fragments of first-order concatenation theory. arXiv:1804.06367 (2018)

  10. Leary, C., Kristiansen, L.: A Friendly Introduction to Mathematical Logic, 2nd edn. Milne Library, SUNY Geneseo, Geneseo (2015)

    Google Scholar 

  11. Makanin, G.S.: The problem of solvability of equations in a free semigroup. Math. USSR-Sbornik 32, 129–198 (1977)

    Article  MathSciNet  Google Scholar 

  12. Post, E.L.: A variant of a recursively unsolvable problem. Bull. Am. Math. Soc. 52, 264–268 (1946)

    Article  MathSciNet  Google Scholar 

  13. Visser, A.: Growing commas. A study of sequentiality and concatenation. Notre Dame J. Formal Log. 50, 61–85 (2009)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Oslo, Oslo, Norway

    Lars Kristiansen & Juvenal Murwanashyaka

  2. Department of Informatics, University of Oslo, Oslo, Norway

    Lars Kristiansen

Authors
  1. Lars Kristiansen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Juvenal Murwanashyaka
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Lars Kristiansen .

Editor information

Editors and Affiliations

  1. Kiel University, Kiel, Germany

    Florin Manea

  2. Queens College, CUNY, Queens, New York, USA

    Russell G. Miller

  3. Kiel University, Kiel, Germany

    Dirk Nowotka

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Kristiansen, L., Murwanashyaka, J. (2018). Decidable and Undecidable Fragments of First-Order Concatenation Theory. In: Manea, F., Miller, R., Nowotka, D. (eds) Sailing Routes in the World of Computation. CiE 2018. Lecture Notes in Computer Science(), vol 10936. Springer, Cham. https://doi.org/10.1007/978-3-319-94418-0_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-94418-0_25

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-94417-3

  • Online ISBN: 978-3-319-94418-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation