Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Reachability Problems

RP 2012: Reachability Problems pp 1–5Cite as

Fraenkel-Mostowski Sets with Non-homogeneous Atoms

  • Conference paper

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

Abstract

Fraenkel-Mostowski sets (FM sets) are a variant of set theory, where sets can contain atoms. The existence of atoms is postulated as an axiom. The key role in the theory of FM sets is played by permutations of atoms.

This is a preview of subscription content, 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 PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   49.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alur, R., Dill, D.L.: A theory of timed automata. Theor. Comput. Sci. 126(2), 183–235 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bojanczyk, M., Braud, L., Klin, B., Lasota, S.: Towards nominal computation. In: POPL, pp. 401–412 (2012)

    Google Scholar 

  3. Bojanczyk, M., Klin, B., Lasota, S.: Automata with group actions. In: LICS, pp. 355–364 (2011)

    Google Scholar 

  4. Bojańczyk, M., Lasota, S.: A Machine-Independent Characterization of Timed Languages. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012, Part II. LNCS, vol. 7392, pp. 92–103. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  5. Gabbay, M., Pitts, A.M.: A new approach to abstract syntax with variable binding. Formal Asp. Comput. 13(3-5), 341–363 (2002)

    Article  MATH  Google Scholar 

  6. Kaminski, M., Francez, N.: Finite-memory automata. Theor. Comput. Sci. 134(2), 329–363 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  7. Lipshitz, L.: The Diophantine problem for addition and divisibility. Trans. Amer. Math. Soc. 235, 217–283 (1978)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Warsaw, Poland

    Mikołaj Bojańczyk & Sławomir Lasota

Authors
  1. Mikołaj Bojańczyk
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sławomir Lasota
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. LSV & ENS Cachan, 61, av. du Président Wilson, 94235, Cachan Cedex, France

    Alain Finkel

  2. Univ. Bordeaux, LaBRI, CNRS, 351 cours de la Libération, 33405, Talence Cedex, France

    Jérôme Leroux

  3. Department of Computer Science, University of Liverpool,, Ashton St, Ashton Building, L69 3BX, Liverpool, UK

    Igor Potapov

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bojańczyk, M., Lasota, S. (2012). Fraenkel-Mostowski Sets with Non-homogeneous Atoms. In: Finkel, A., Leroux, J., Potapov, I. (eds) Reachability Problems. RP 2012. Lecture Notes in Computer Science, vol 7550. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33512-9_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-33512-9_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-33511-2

  • Online ISBN: 978-3-642-33512-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation