Skip to main content
SpringerLink
Log in

Modelling Infinite Structures with Atoms

  • Conference paper
Logic, Language, Information, and Computation (WoLLIC 2013)

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

Abstract

The topic is a variant of first-order logic defined in the framework of sets with atoms, which allows formulas to use orbit-finite boolean operations. The main contribution is a notion of model for this logic, which admits the compactness theorem.

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 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adamowicz, Z., Zbierski, P.: Logic of Mathematics: A Modern Course of Classical Logic. Pure and Applied Mathematics: A Wiley Series of Texts, Monographs and Tracts. Wiley (2011)

    Google Scholar 

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

    Google Scholar 

  3. Bojańczyk, M., Place, T.: Toward model theory with data values. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012, Part II. LNCS, vol. 7392, pp. 116–127. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  4. Bojanczyk, M., Torunczyk, S.: Imperative programming in sets with atoms. In: D’Souza, D., Kavitha, T., Radhakrishnan, J. (eds.) FSTTCS. LIPIcs, vol. 18, pp. 4–15. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2012)

    Google Scholar 

  5. Gabbay, M.J., 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. Gabbay, M.J.: Fresh logic: proof-theory and semantics for fm and nominal techniques. J. Applied Logic 5(2), 356–387 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  7. Gabbay, M.J.: Finite and infinite support in nominal algebra and logic: nominal completeness theorems for free. J. Symb. Log. 77(3), 828–852 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  8. Lopez-Escobar, E.G.K.: An interpolation theorem for denumerably long formulas. Fundam. Math. 57, 253–272 (1965)

    MathSciNet  MATH  Google Scholar 

  9. Pitts, A.M.: Nominal Sets: Names and Symmetry in Computer Science. Cambridge Tracts in Theoretical Computer Science, vol. 57. Cambridge University Press (2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Warsaw, Poland

    Mikołaj Bojańczyk

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

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Informatics, University of Edinburgh, EH8 9AB, Edinburgh, UK

    Leonid Libkin

  2. Fachbereich Mathematik, TU Darmstadt, Schlossgartenstrasse 7, 64289, Darmstadt, Germany

    Ulrich Kohlenbach

  3. Centro de Informática, Universidade Federal de Pernambuco (UFPE), Av. Jornalista Anibal Fernandes, s/n, Cidade Universitária, 50.740-560, Recife, PE, Brazil

    Ruy de Queiroz

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bojańczyk, M. (2013). Modelling Infinite Structures with Atoms. In: Libkin, L., Kohlenbach, U., de Queiroz, R. (eds) Logic, Language, Information, and Computation. WoLLIC 2013. Lecture Notes in Computer Science, vol 8071. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39992-3_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-39992-3_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-39991-6

  • Online ISBN: 978-3-642-39992-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation