Advertisement

Properties of the atoms in finitely supported structures

  • Andrei Alexandru
  • Gabriel CiobanuEmail author
Article
  • 4 Downloads

Abstract

The goal of this paper is to present a collection of properties of the set of atoms and the set of finite injective tuples of atoms, as well as of the (finite and cofinite) powersets of atoms in the framework of finitely supported structures. Some properties of atoms are obtained by translating classical Zermelo–Fraenkel results into the new framework, but several important properties are specific to finitely supported structures (i.e. they do not have related classical Zermelo–Fraenkel and related non-atomic correspondents).

Keywords

Finitely supported sets Atoms Fixed points Choice principles 

Mathematics Subject Classification

03E35 03E10 03B70 

Notes

Acknowledgements

The authors are grateful to an anonymous referee for several comments and suggestions which improve the paper.

References

  1. 1.
    Alexandru, A., Ciobanu, G.: Finitely Supported Mathematics: An Introduction. Springer, Berlin (2016)CrossRefzbMATHGoogle Scholar
  2. 2.
    Barwise, J.: Admissible Sets and Structures: An Approach to Definability Theory, Perspectives in Mathematical Logic, vol. 7. Springer, Berlin (1975)CrossRefzbMATHGoogle Scholar
  3. 3.
    Blass, A.: Ramsey’s theorem in the hierarchy of choice principles. J. Symb. Log. 42, 387–390 (1977)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Bojanczyk, M., Klin, B., Lasota, S.: Automata with group actions. In: 26th Symposium on Logic in Computer Science, pp. 355–364. IEEE Computer Society Press, New York (2011)Google Scholar
  5. 5.
    Gabbay, M.J., Pitts, A.M.: A new approach to abstract syntax with variable binding. Form. Asp. Comput. 13(3–5), 341–363 (2001)zbMATHGoogle Scholar
  6. 6.
    Gandy, R.: Church’s thesis and principles for mechanisms. In: Barwise, J., Keisler, H.J., Kunen, K. (eds.) The Kleene Symposium, pp. 123–148. North-Holland, Amsterdam (1980)CrossRefGoogle Scholar
  7. 7.
    Halbeisen, L.: Combinatorial Set Theory: With a Gentle Introduction to Forcing, 2nd edn. Springer, Berlin (2017)CrossRefzbMATHGoogle Scholar
  8. 8.
    Howard, P., Rubin, J.E.: Consequences of the Axiom of Choice. Mathematical Surveys and Monographs, vol. 59. American Mathematical Society, New York (1998)CrossRefGoogle Scholar
  9. 9.
    Jech, T.J.: The Axiom of Choice. Studies in Logic and the Foundations of Mathematics. North-Holland, Amsterdam (1973)Google Scholar
  10. 10.
    Kleinberg, E.M.: The independence of Ramsey’s theorem. J. Symb. Log. 34, 205–206 (1969)CrossRefzbMATHGoogle Scholar
  11. 11.
    Pitts, A.M.: Nominal Sets Names and Symmetry in Computer Science. Cambridge University Press, Cambridge (2013)CrossRefzbMATHGoogle Scholar
  12. 12.
    Tachtsis, E.: On Ramsey’s Theorem and the existence of infinite chains or infinite anti-chains in infinite posets. J. Symb. Log. 81(1), 384–394 (2016)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag GmbH Germany, part of Springer Nature 2019

Authors and Affiliations

  1. 1.Romanian AcademyInstitute of Computer ScienceIaşiRomania
  2. 2.Alexandru Ioan Cuza UniversityIaşiRomania

Personalised recommendations