Skip to main content
Erschienen in: Soft Computing 11/2018

30.08.2017 | Foundations

Free functor from the category of G-nominal sets to that of 01-G-nominal sets

verfasst von: Khadijeh Keshvardoost, Mojgan Mahmoudi

Erschienen in: Soft Computing | Ausgabe 11/2018

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

The category \(\mathbf{Nom}\), of all finitely supported G-sets, called G-nominal sets, where \(G=\mathrm{Perm}_{\mathrm{f}}({\mathbb {D}})\) is the group of all finitary permutations over a countable infinite set \({\mathbb {D}}\), is a subject of interest by both set theorists and computer scientists. The category 01-Nom, of all G-nominal sets equipped with the source and the target operations, was introduced by Pitts. He has shown that this category is isomorphic to the category of sets whose elements have a finite support property with respect to an action of the monoid Cb of name substitutions. The latter category is a coreflective subcategory of the category \(\mathbf{Set}^{Cb}\), of sets with the action of the monoid Cb. For a functorial relation between the categories \(\mathbf{Nom}\) and \(\mathbf{Set}^{Cb}\), we study the existence of the free objects in the category 01-Nom. More precisely, we construct the left adjoint to the forgetful functor from the category of 01-G-nominal sets to the category of G-nominal sets, where G is a suitable subgroup of the group of all permutations over a countable infinite set \({\mathbb {D}}\).

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Literatur
Zurück zum Zitat Abramsky S, Ghica DR, Murawski AS, Luke Ong CH, Stark IDB (2004) Nominal games and full abstraction for the nu-calculus. In: Proceedings of 19th IEEE Symposium on Logic in Computer Science, pp 150–159 Abramsky S, Ghica DR, Murawski AS, Luke Ong CH, Stark IDB (2004) Nominal games and full abstraction for the nu-calculus. In: Proceedings of 19th IEEE Symposium on Logic in Computer Science, pp 150–159
Zurück zum Zitat Alexandru A, Ciobanu G (2014) Nominal groups and their homomorphism theorems. Fundam Inform 131(3–4):279–298MathSciNetMATH Alexandru A, Ciobanu G (2014) Nominal groups and their homomorphism theorems. Fundam Inform 131(3–4):279–298MathSciNetMATH
Zurück zum Zitat Bojanczyk M, Klin B, Lasota S (2011) Automata with group actions, In 26th Symposium on Logic in Computer Science, pp 355–364 Bojanczyk M, Klin B, Lasota S (2011) Automata with group actions, In 26th Symposium on Logic in Computer Science, pp 355–364
Zurück zum Zitat Bojanczyk M (2011) Data monoids, In Proceediongs of 28th Symposium on Theoretical Computer Science, pp 105–116 Bojanczyk M (2011) Data monoids, In Proceediongs of 28th Symposium on Theoretical Computer Science, pp 105–116
Zurück zum Zitat Ebrahimi MM, Mahmoudi M (2001) The category of \(M\)-sets. Ital J Pure Appl Math 9:123–132MATH Ebrahimi MM, Mahmoudi M (2001) The category of \(M\)-sets. Ital J Pure Appl Math 9:123–132MATH
Zurück zum Zitat Gabbay M, Pitts A (2002) A new approach to abstract syntax with variable binding. Form Asp Comput 13(3–5):341–363CrossRefMATH Gabbay M, Pitts A (2002) A new approach to abstract syntax with variable binding. Form Asp Comput 13(3–5):341–363CrossRefMATH
Zurück zum Zitat Kilp M, Knauer U, Mikhalev A (2000) Monoids, acts and categories. Walter de Gruyter, Berlin, NewyorkCrossRefMATH Kilp M, Knauer U, Mikhalev A (2000) Monoids, acts and categories. Walter de Gruyter, Berlin, NewyorkCrossRefMATH
Zurück zum Zitat Odersky M (1994) A functional theory of local names. In Conference Record of the 21st Annual ACM Symposium on Principles of Programming Languages, pp 48–59 Odersky M (1994) A functional theory of local names. In Conference Record of the 21st Annual ACM Symposium on Principles of Programming Languages, pp 48–59
Zurück zum Zitat Petrisan D (2011) Investigations into algebra and topology over nominal sets, Ph. D. Thesis, University of Leicester, Leicester Petrisan D (2011) Investigations into algebra and topology over nominal sets, Ph. D. Thesis, University of Leicester, Leicester
Zurück zum Zitat Pitts A (2013) Nominal sets, names and symmetry in computer science. Cambridge University Press, CambridgeCrossRefMATH Pitts A (2013) Nominal sets, names and symmetry in computer science. Cambridge University Press, CambridgeCrossRefMATH
Zurück zum Zitat Pitts A (2015) Nominal presentations of the cubical sets model of type theory, In Leibniz International Proceedings Informations, pp 202–220 Pitts A (2015) Nominal presentations of the cubical sets model of type theory, In Leibniz International Proceedings Informations, pp 202–220
Zurück zum Zitat Pitts A, Stark IDB (1993) Observable properties of higher order functions that dynamically create local names, or: whats new?, Mathematical Foundations of Computer Science, In Proceedings of 18th International Symposium. Lecture Notes in Computer Science 711(1993):122–141 Pitts A, Stark IDB (1993) Observable properties of higher order functions that dynamically create local names, or: whats new?, Mathematical Foundations of Computer Science, In Proceedings of 18th International Symposium. Lecture Notes in Computer Science 711(1993):122–141
Zurück zum Zitat Shinwell MR (2005) The fresh approach: functional programming with names and binders, Ph.D. Thesis, University of Cambridge, Computer Laboratory, Cambridge Shinwell MR (2005) The fresh approach: functional programming with names and binders, Ph.D. Thesis, University of Cambridge, Computer Laboratory, Cambridge
Zurück zum Zitat Shinwell MR, Pitts A (2005) Fresh objective caml user manual, In Technical Report UCAM-CLTR-621, University of Cambridge, Cambridge Shinwell MR, Pitts A (2005) Fresh objective caml user manual, In Technical Report UCAM-CLTR-621, University of Cambridge, Cambridge
Zurück zum Zitat Swan A (2016) An algebraic weak factorization system on 01substitution sets: a constructive proof. J Log Anal 8(1):1–35MathSciNetMATH Swan A (2016) An algebraic weak factorization system on 01substitution sets: a constructive proof. J Log Anal 8(1):1–35MathSciNetMATH
Metadaten
Titel
Free functor from the category of G-nominal sets to that of 01-G-nominal sets
verfasst von
Khadijeh Keshvardoost
Mojgan Mahmoudi
Publikationsdatum
30.08.2017
Verlag
Springer Berlin Heidelberg
Erschienen in
Soft Computing / Ausgabe 11/2018
Print ISSN: 1432-7643
Elektronische ISSN: 1433-7479
DOI
https://doi.org/10.1007/s00500-017-2793-2

Weitere Artikel der Ausgabe 11/2018

Soft Computing 11/2018 Zur Ausgabe