DETERMINING IDEALS OF A GIVEN FINITE INDEX IN A FINITELY PRESENTED SEMIGROUP
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
DETERMINING IDEALS OF A GIVEN FINITE INDEX IN A FINITELY PRESENTED SEMIGROUP ; volume:11 ; number:3 ; year:1978 ; pages:813-828 ; extent:16
Demonstratio mathematica ; 11, Heft 3 (1978), 813-828 (gesamt 16)
- Urheber
-
Jura, Andrzej
- DOI
-
10.1515/dema-1978-0323
- URN
-
urn:nbn:de:101:1-2411141654519.761820264725
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
30.01.0008, 23:39 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Jura, Andrzej
Ähnliche Objekte (12)
Algorithms determining finite simple images of finitely presented groups
Subgroups of almost finitely presented groups
Computation with finitely L-presented groups
Amenable groups without finitely presented amenable covers
An L3-U3-quotient algorithm for finitely presented groups
Some remarks on finitely presented monoids with automatic structure
An L3-U3-quotient algorithm for finitely presented groups
Virtually special non-finitely presented groups via linear characters
Finitely and non-finitely related words
Separable algebras over infinite fields are 2-generated and finitely presented
Arithmetic groups over function fields : a complete characterization of finitely generated and finitely presented arithmetic subgroups of reductive algebraic groups
Semigroup forum
Algorithms determining finite simple images of finitely presented groups
Subgroups of almost finitely presented groups
Computation with finitely L-presented groups
Amenable groups without finitely presented amenable covers
An L3-U3-quotient algorithm for finitely presented groups
Some remarks on finitely presented monoids with automatic structure
An L3-U3-quotient algorithm for finitely presented groups
Virtually special non-finitely presented groups via linear characters
Finitely and non-finitely related words
Separable algebras over infinite fields are 2-generated and finitely presented
Arithmetic groups over function fields : a complete characterization of finitely generated and finitely presented arithmetic subgroups of reductive algebraic groups
Semigroup forum
Algorithms determining finite simple images of finitely presented groups
Subgroups of almost finitely presented groups
Computation with finitely L-presented groups
Amenable groups without finitely presented amenable covers
An L3-U3-quotient algorithm for finitely presented groups
Some remarks on finitely presented monoids with automatic structure
An L3-U3-quotient algorithm for finitely presented groups
Virtually special non-finitely presented groups via linear characters
Finitely and non-finitely related words
Separable algebras over infinite fields are 2-generated and finitely presented
Arithmetic groups over function fields : a complete characterization of finitely generated and finitely presented arithmetic subgroups of reductive algebraic groups