Nominal Groups and Their Homomorphism Theorems

• Autorzy: Alexandru A. , Ciobanu G.

Identyfikatory

DOI

10.3233/FI-2014-1015

• Języki publikacji: EN

Abstrakty

EN

We introduce and study the nominal groups, providing some algebraic properties of this new structure. We focus on the properties of nominal homomorphisms, and study the correspondence between some results obtained in the Fraenkel-Mostowski framework (where only finitely supported objects are allowed) and those obtained in the classical Zermelo-Fraenkel framework.

Słowa kluczowe

EN

Fraenkel-Mostowski set theory; finitely supported objects; nominal groups; homomorphisms

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2014
• Tom: Vol. 131, nr 3-4
• Strony: 279--298
• Opis fizyczny: Bibliogr. 25 poz.

Twórcy

autor

Alexandru A.

• Institute of Computer Science, Romanian Academy, Iaşi, Romania

autor

Ciobanu G.

• Institute of Computer Science, Romanian Academy, Iaşi, Romania

Bibliografia

• [1] Alexandru, A.: Algebraic Analysis and Processing of Data in Web Systems, PhD Thesis, Romanian Academy, Ia¸si, 2012.
• [2] Alexandru, A., Ciobanu, G.: Nominal event structures, Romanian Journal of Information, Science and Technology, 15, 2012, 79–90.
• [3] Alexandru,A., Ciobanu, G.: Nominal semantics of mobility, Romanian Journal of Information, Science and Technology, 15, 2012, 171–214.
• [4] Alexandru, A., Ciobanu, G.: Nominal fusion calculus, Proc. 14th SYNASC 2012, IEEE Computer Society Press, 2012, 376–384.
• [5] Banâtre, J.P., Fradet, P., Radenac, Y.: Generalised multisets for chemical programming, Mathematical Structures in Computer Science, 16, 2006, 557–580.
• [6] Bengtson, J., Parrow, J.: Formalising the π-calculus using nominal logic, Logical Methods in Computer Science, 5, 2009, 1–36.
• [7] Bojanczyk, M.: Data monoids, Proc. 28th Symposium on Theoretical Aspects of Computer Science, 2011, 105–116.
• [8] Bojanczyk, M.: Nominal Monoids, Theory of Computing Systems, 53, 2013, 194-222.
• [9] Bojanczyk, M., Braud, L., Klin, B., Lasota, S.: Towards nominal computation, Proc. 39th ACM Symposium on Principles of Programming Languages, 2012, 401–412.
• [10] Bojanczyk, M., Klin, B., Lasota, S.: Automata with group actions, Proc. 26th IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press, 2011, 355–364.
• [11] Ciancia, V.: Nominal Sets, Accessible Functors and Final Coalgebras for Named Sets, PhD Thesis, Universita di Pisa, 2008.
• [12] Conway, J.W.: On Numbers and Games, Academic Press, London, 1976.
• [13] Fiore, M., Staton, S.: Comparing operational models of name-passing process calculi, Information and Computation, 204, 2006, 524–560.
• [14] Fraenkel, A.: Zu den Grundlagen der Cantor-Zermeloschen Mengenlehre, Mathematische Annalen, 86, 1922, 230–237.
• [15] Gabbay, M. J., Pitts, A. M.: A new approach to abstract syntax with variable binding, Formal Aspects of Computing, 13, 2001, 341–363.
• [16] Krohn, K., Rhodes, J.: Algebraic theory of machines. Prime decomposition theorem for finite semigroups and machines, Transactions of the American Mathematical Society, 116, 1965, 450–464.
• [17] Kurz, A., Suzuki, T., Tuosto, E.: On nominal regular languages with binders, Proc. 15th International Conference on Foundations of Software Science and Computation Structures, LNCS 7213, 2012, 255–269.
• [18] Lindenbaum, A.,Mostowski. A.: Uber die Unabhangigkeit des Auswahlsaxioms und einiger seiner Folgerungen, Comptes Rendus des Seances de la Societe des Sciences et des Lettres de Varsovie, 31, 1938, 27–32.
• [19] Gadducci, F.,Miculan, M.,Montanari, U.: About permutation algebras, (pre)sheaves and named sets, Higher-Order and Symbolic Computation, 19, 2006, 283–304.
• [20] Montanari, U., Pistore, M.: History-dependent automata: an introduction, Proc. 5th Formal Methods for the Design of Computer, Communication, and Software Systems: Mobile Computing, 2005, 1–28.
• [21] Pitts, A.: Nominal logic, a first order theory of names and binding, Information and Computation, 186, 2003, 165–193.
• [22] Reisig, W.: Petri Nets: An Introduction, Springer-Verlag, 1986.
• [23] Rose, J. S.: A Course on Group Theory, Dover Publications, 1994.
• [24] Shinwell, M. R.: The Fresh Approach: Functional Programming with Names and Binders, PhD Thesis, University of Cambridge, 2005.
• [25] Urban, C.: Nominal techniques in Isabelle/HOL, Journal of Automated Reasoning, 40, 2008, 327–356