Results for 'Word problem for groups'

1000+ found
Order:
  1.  15
    J. L. Britton. The word problem for groups. Proceedings of the London Mathematical Society, third series, vol. 8 , pp. 493–506. - John L. Britton. The word problem. Annals of mathematics, second series, vol. 77 , pp. 16–32. [REVIEW]Michael O. Rabin - 1964 - Journal of Symbolic Logic 29 (4):205-206.
  2.  20
    Seperating the intrinsic complexity and the derivational complexity of the word problem for finitely presented groups.Daniel E. Cohen, Klaus Madlener & Friedrich Otto - 1993 - Mathematical Logic Quarterly 39 (1):143-157.
    A pseudo-natural algorithm for the word problem of a finitely presented group is an algorithm which not only tells us whether or not a word w equals 1 in the group but also gives a derivation of 1 from w when w equals 1. In [13], [14] Madlener and Otto show that, if we measure complexity of a primitive recursive algorithm by its level in the Grzegorczyk hierarchy, there are groups in which a pseudo-natural algorithm is (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  3.  37
    The word problem for cancellation semigroups with zero.Yuri Gurevich & Harry R. Lewis - 1984 - Journal of Symbolic Logic 49 (1):184-191.
    By theword problemfor some class of algebraic structures we mean the problem of determining, given a finite setEof equations between words and an additional equationx=y, whetherx=ymust hold in all structures satisfying each member ofE. In 1947 Post [P] showed the word problem for semigroups to be undecidable. This result was strengthened in 1950 by Turing, who showed the word problem to be undecidable forcancellation semigroups,i.e. semigroups satisfying thecancellation propertyNovikov [N] eventually showed the word (...) for groups to be undecidable.In 1966 Gurevich [G] showed the word problem to be undecidable forfinitesemigroups. However, this result on finite structures has not been extended to cancellation semigroups or groups; indeed it is easy to see that a finite cancellation semigroup is a group, so both questions are the same. We do not here settle the word problem for finite groups, but we do show that the word problem is undecidable for finite semigroups with zero satisfying an approximation to the cancellation property. (shrink)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  4. Review: J. L. Britton, The Word Problem for Groups; John L. Britton, The Word Problem[REVIEW]Michael O. Rabin - 1964 - Journal of Symbolic Logic 29 (4):205-206.
  5. Review: J. L. Britton, Solution of the Word Problem for Certain Types of Groups. I; J. L. Britton, Solution of the Word Problem for Certain Types of Groups. II. [REVIEW]William W. Boone - 1967 - Journal of Symbolic Logic 32 (1):126-127.
  6.  3
    Review: A. A. Fridman, Degrees of Unsolvability of the Word Problem for Finitely Defined Groups[REVIEW]D. J. Collins - 1969 - Journal of Symbolic Logic 34 (1):114-115.
  7.  16
    Britton J. L.. Solution of the word problem for certain types of groups. I. Proceedings of the Glasgow Mathematical Association, vol. 3 , pp. 45–54.Britton J. L.. Solution of the word problem for certain types of groups. II. Proceedings of the Glasgow Mathematical Association, vol. 3 , pp. 68–90. [REVIEW]William W. Boone - 1967 - Journal of Symbolic Logic 32 (1):126-127.
  8.  9
    Word problems and ceers.Valentino Delle Rose, Luca San Mauro & Andrea Sorbi - 2020 - Mathematical Logic Quarterly 66 (3):341-354.
    This note addresses the issue as to which ceers can be realized by word problems of computably enumerable (or, simply, c.e.) structures (such as c.e. semigroups, groups, and rings), where being realized means to fall in the same reducibility degree (under the notion of reducibility for equivalence relations usually called “computable reducibility”), or in the same isomorphism type (with the isomorphism induced by a computable function), or in the same strong isomorphism type (with the isomorphism induced by a (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  9.  14
    Word problems for bidirectional, single-premise Post systems.Charles E. Hughes & David W. Straight - 1980 - Notre Dame Journal of Formal Logic 21 (3):501-508.
  10.  20
    The word problem for free fields.P. M. Cohn - 1973 - Journal of Symbolic Logic 38 (2):309-314.
  11.  26
    The word problem for free fields: A correction and an addendum.P. M. Cohn - 1975 - Journal of Symbolic Logic 40 (1):69-74.
  12.  32
    The word problem for semigroups with two generators.Marshall Hall - 1949 - Journal of Symbolic Logic 14 (2):115-118.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  13.  21
    The word problem for division rings.Angus Macintyre - 1973 - Journal of Symbolic Logic 38 (3):428-436.
  14.  18
    An undecidability theorem for lattices over group rings.Carlo Toffalori - 1997 - Annals of Pure and Applied Logic 88 (2-3):241-262.
    Let G be a finite group, T denote the theory of Z[G]-lattices . It is shown that T is undecidable when there are a prime p and a p-subgroup S of G such that S is cyclic of order p4, or p is odd and S is non-cyclic of order p2, or p = 2 and S is a non-cyclic abelian group of order 8 . More precisely, first we prove that T is undecidable because it interprets the word (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  15.  11
    Review: Marshall Hall, The Word Problem for Semigroups with Two Generators. [REVIEW]Martin Davis - 1950 - Journal of Symbolic Logic 14 (4):259-259.
  16.  12
    Trevor Evans. The word problem for abstract algebras. The journal of the London Mathematical Society, vol. 26 , pp. 64–71. - Trevor Evans. Embeddability and the word problem. The journal of the London Mathematical Society, vol. 28 , pp. 76–80. [REVIEW]C. R. J. Clapham - 1969 - Journal of Symbolic Logic 34 (3):507.
  17.  10
    Ethics in Internet (Document).Pontifical Council for Social Communication - 2020 - Journal of Interdisciplinary Studies 32 (1-2):179-192.
    Today, the earth is an interconnected globe humming with electronic transmissions-a chattering planet nestled in the provident silence of space. The ethical question is whether this is contributing to authentic human development and helping individuals and peoples to be true to their transcendent destiny. The new media are powerful tools for education, cultural enrichment, commercial activity, political participation, intercultural dialogue and understanding. They also can serve the cause of religion. Yet the new information technology needs to be informed and guided (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  18.  19
    Word Problem Solving in Contemporary Math Education: A Plea for Reading Comprehension Skills Training.Anton J. H. Boonen, Björn B. de Koning, Jelle Jolles & Menno van der Schoot - 2016 - Frontiers in Psychology 7.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  19. Beyond the Senses: How Self-Directed Speech and Word Meaning Structure Impact Executive Functioning and Theory of Mind in Individuals With Hearing and Language Problems.Thomas F. Camminga, Daan Hermans, Eliane Segers & Constance T. W. M. Vissers - 2021 - Frontiers in Psychology 12.
    Many individuals with developmental language disorder (DLD) and individuals who are deaf or hard of hearing (D/HH) have social–emotional problems, such as social difficulties, and show signs of aggression, depression, and anxiety. These problems can be partly associated with their executive functions (EFs) and theory of mind (ToM). The difficulties of both groups in EF and ToM may in turn be related to self-directed speech (i.e., overt or covert speech that is directed at the self). Self-directed speech is thought (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  20. Review: P. S. Novikov, Algorithmic Unsolvability of the Word Problem in Group Theory. [REVIEW]J. L. Britton - 1958 - Journal of Symbolic Logic 23 (1):50-52.
  21.  13
    Processing of Words Related to the Demands of a Previously Solved Problem.Marek Kowalczyk - 2014 - Polish Psychological Bulletin 45 (2):179-191.
    Earlier research by the author brought about findings suggesting that people in a special way process words related to demands of a problem they previously solved, even when they do not consciously notice this relationship. The findings concerned interference in the task in which the words appeared, a shift in affective responses to them that depended on sex of the participants, and impaired memory of the words. The aim of this study was to replicate these effects and to find (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  22.  51
    The conjugacy problem for the automorphism group of the random graph.Samuel Coskey, Paul Ellis & Scott Schneider - 2011 - Archive for Mathematical Logic 50 (1-2):215-221.
    We prove that the conjugacy problem for the automorphism group of the random graph is Borel complete, and discuss the analogous problem for some other countably categorical structures.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  23.  7
    Word and conjugacy problems in groups with only a few defining relations.Donald J. Collins - 1969 - Mathematical Logic Quarterly 15 (20‐22):305-324.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  24.  19
    Word and conjugacy problems in groups with only a few defining relations.Donald J. Collins - 1969 - Mathematical Logic Quarterly 15 (20-22):305-324.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  25.  12
    Turing A. M.. The word problem in semi-groups with cancellation. Annals of mathematics, ser. 2 vol. 52 , pp. 491–505.William W. Boone - 1952 - Journal of Symbolic Logic 17 (1):74-76.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  26. The Biedenharn-Louck-Hecht resolution of the outer multiplicity problem for theU(3) andU q (3) groups.R. M. Asherova, J. P. Draayer, Yu I. Kharitonov & Yu F. Smirnov - 1997 - Foundations of Physics 27 (7):1035-1046.
    The solution of the outer multiplicity problem in the tensor product of U(3) irreducible representations (irreps) developed by Biedenharn et al.(1–7) and realized through the well-known Draayer-Akiyama (DA) computer code(8) is extended to the quantum algebra Uq(3). An analytic formula for special stretched Uq(3) Wigner coefficients, $$\left\langle {(\lambda _1 \mu _1 ) H_1 , (\lambda _2 \mu _2 ) \varepsilon _2 \Lambda _2 m_2 \left| { (\lambda _3 \mu _3 ) H_3 } \right.} \right\rangle _{\max }^q $$ is derived (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  27.  12
    Review: E. I. Grindlinger, On the Unsolvability of the Word Problem for a Class of Semigroups with a Solvable Isomorphism Problem; M. Greendlinger, Soviet Mathematics. [REVIEW]C. R. J. Clapham - 1968 - Journal of Symbolic Logic 33 (3):469-469.
  28.  10
    Grindlingér É. I.. O nérazréšimosti problémy toždéstva slov dlá odnogo klassa polugrupp s razréšimoj problèmoj izomorfizma. Doklady Akadémii Nauk SSSR, vol. 171 , pp. 519–520.Grindlinger [Greendlinger] E. I.. On the unsolvability of the word problem for a class of semigroups with a solvable isomorphism problem. English translation of the preceding by Greendlinger M.. Soviet mathematics, vol. 7 no. 6 , pp. 1502–1503. [REVIEW]C. R. J. Clapham - 1968 - Journal of Symbolic Logic 33 (3):469-469.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  29. Quantum-information conservation. The problem about “hidden variables”, or the “conservation of energy conservation” in quantum mechanics: A historical lesson for future discoveries.Vasil Penchev - 2020 - Energy Engineering (Energy) eJournal (Elsevier: SSRN) 3 (78):1-27.
    The explicit history of the “hidden variables” problem is well-known and established. The main events of its chronology are traced. An implicit context of that history is suggested. It links the problem with the “conservation of energy conservation” in quantum mechanics. Bohr, Kramers, and Slaters (1924) admitted its violation being due to the “fourth Heisenberg uncertainty”, that of energy in relation to time. Wolfgang Pauli rejected the conjecture and even forecast the existence of a new and unknown then (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  30.  12
    The conjugacy problem for automorphism groups of countable homogeneous structures.Samuel Coskey & Paul Ellis - 2016 - Mathematical Logic Quarterly 62 (6):580-589.
    No categories
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  31.  24
    The Isomorphism Problem for Computable Abelian p-Groups of Bounded Length.Wesley Calvert - 2005 - Journal of Symbolic Logic 70 (1):331 - 345.
    Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider only countable members. This paper explores such a notion for classes of computable structures by working out a sequence of examples. We follow recent work by Goncharov and Knight in using the degree of the isomorphism problem for a class to distinguish classifiable classes from non-classifiable. (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  32.  14
    The classification problem for p-local torsion-free Abelian groups of rank two.Greg Hjorth & Simon Thomas - 2006 - Journal of Mathematical Logic 6 (2):233-251.
    We prove that if p ≠ q are distinct primes, then the classification problems for p-local and q-local torsion-free abelian groups of rank two are incomparable with respect to Borel reducibility.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  33.  4
    The Problems in Ḥadīth Usage in Kur’an Yolu Tafsīr within the Context of Qurʾān-Sunnah Unity.Mehmet Ali Çalgan - 2021 - Cumhuriyet İlahiyat Dergisi 25 (3):1277-1298.
    The Sunnah has an important role in the correct understanding and the protection from wrong interpretations of the Qurʾān. Accordingly, ḥadīth played a crucial role in shaping the opinions of the mufassirs. In this article, the tafsir titled Kur’an Yolu written by a group of scholars and first published by the Presidency of the Religious Affairs in 2003 which is widely read in Tur-key is examined from ḥadīth usage point of view. The problems in ḥadīth usage are classified under headings (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  34.  28
    Epistemic Paternalism, Open Group Inquiry, and Religious Knowledge.Kirk Lougheed - 2021 - Res Philosophica 98 (2):261-281.
    Epistemic paternalism occurs when a decision is made for an agent which helps them arrive at the truth, though they didn’t consent to that decision (and sometimes weren’t even aware of it). Common defenses of epistemic paternalism claim that it can help promote positive veritistic results. In other words, epistemic paternalism is often good for inquiry. I argue that there is often a better alternative available to epistemic paternalism in the form of what I call Open Group Inquiry. I then (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  35.  23
    Adjan S. I.. Defining relations and algorithmic problems for groups and semigroups. English translation of XXXVIII 357 by M. Greendlinger. Proceedings of the Steklov Institute of Mathematics, no. 85 , American Mathematical Society, Providence 1967, iii + 152 pp. [REVIEW]Ann Yasuhara - 1973 - Journal of Symbolic Logic 38 (2):338-339.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  36.  9
    Review: S. I. Adjan, M. Greendlinger, Defining Relations and Algorithmic Problems for Groups and Semigroups. [REVIEW]Ann Yasuhara - 1973 - Journal of Symbolic Logic 38 (2):338-339.
  37. Tarski's problem for varieties of groups with a commutator identity.John Lawrence - 1986 - Journal of Symbolic Logic 51 (1):75-78.
    It is proved that for a variety of groups in which the relatively free groups are solvable, the relatively free groups of distinct finite rank are not elementarily equivalent.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark  
  38.  11
    Polynomial Time Uniform Word Problems.Stanley Burris - 1995 - Mathematical Logic Quarterly 41 (2):173-182.
    We have two polynomial time results for the uniform word problem for a quasivariety Q: The uniform word problem for Q can be solved in polynomial time iff one can find a certain congruence on finite partial algebras in polynomial time. Let Q* be the relational class determined by Q. If any universal Horn class between the universal closure S and the weak embedding closure S̄ of Q* is finitely axiomatizable then the uniform word (...) for Q is solvable in polynomial time. This covers Skolem's 1920 solution to the uniform word problem for lattices and Evans' 1953 applications of the weak embeddability property for finite partial V algebras. (shrink)
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  39.  38
    A descriptive view of combinatorial group theory.Simon Thomas - 2011 - Bulletin of Symbolic Logic 17 (2):252-264.
    In this paper, we will prove the inevitable non-uniformity of two constructions from combinatorial group theory related to the word problem for finitely generated groups and the Higman—Neumann—Neumann Embedding Theorem.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark  
  40.  20
    Two proposals for group signature schemes based on number theory problems.R. Duran Diaz, L. Hernandez Encinas & J. Munoz Masque - 2013 - Logic Journal of the IGPL 21 (4):648-658.
  41.  41
    The decision problem for some finite extensions of the intuitionistic theory of abelian groups.Dov M. Gabbay - 1975 - Studia Logica 34 (1):59-67.
  42.  20
    Hierarchies of computable groups and the word problem.Frank B. Cannonito - 1966 - Journal of Symbolic Logic 31 (3):376-392.
  43.  26
    William W. Boone. Word problems and recursively enumerable degrees of unsolvability. An emendation. Annals of mathematics, ser. 2 vol. 94 , pp. 389–391. - Donald J. Collins. Truth-table degrees and the Boone groups. Annals of mathematics, ser. 2 vol. 94 , pp. 392–396. [REVIEW]Charles E. Hughes - 1974 - Journal of Symbolic Logic 39 (1):184-185.
  44.  16
    The Problem of Ideology in American Literary History.Sacvan Bercovitch - 1986 - Critical Inquiry 12 (4):631-653.
    For my present purposes, and in terms of my immediate concerns, the problem of ideology in American literary history has three different though closely related aspects: first, the multivolume American literary history I have begun to edit; then, the concept of ideology as a constituent part of literary study, and, finally, the current revaluation of the American Renaissance. I select this period because it has been widely regarded as both the source and the epitome of our literary tradition; because (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  45.  9
    Borrowed Words: problems of vocabulary in eighteenth-century geology.Rhoda Rappaport - 1982 - British Journal for the History of Science 15 (1):27-44.
    Every science has its technical vocabulary, consisting in part of terms coined for explicit purposes and in part of words borrowed from ordinary discourse and used with greater or lesser degrees of precision. Words of the latter sort pose curious problems, some of them familiar to those historians of science concerned with, for example, what Galileo meant by forza and Newton by attraction. Indeed, analogous problems face any historian seeking to understand the older meanings of terms still in use today.
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  46. On the complexity of the classification problem for torsion-free Abelian groups of finite rank.Simon Thomas - 2001 - Bulletin of Symbolic Logic 7 (3):329-344.
    In this paper, we shall discuss some recent contributions to the project [15, 14, 2, 18, 22, 23] of explaining why no satisfactory system of complete invariants has yet been found for the torsion-free abelian groups of finite rank n ≥ 2. Recall that, up to isomorphism, the torsion-free abelian groups of rank n are exactly the additive subgroups of the n-dimensional vector space ℚn which contain n linearly independent elements. Thus the collection of torsion-free abelian groups (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  47.  19
    Frank B. Cannonito. Hierarchies of computable groups and the word problem. The journal of symbolic logic, vol. 31 , pp. 376–392.B. H. Mayoh - 1968 - Journal of Symbolic Logic 33 (1):121.
  48. A Problem for Generic Generalisations in Scientific Communication.Mark Bowker - 2023 - Journal of Applied Philosophy 40 (1):123-132.
    Generic generalisations like ‘Opioids are highly addictive’ are very useful in scientific communication, but they can often be interpreted in many different ways. Although this is not a problem when all interpretations provide the same answer to the question under discussion, a problem arises when a generic generalisation is used to answer a question other than that originally intended. In such cases, some interpretations of the generalisation might answer the question in a way that the original speaker would (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  49.  15
    Review: A. A. Fridman, On the Relation between the Word Problem and the Conjugacy Problem in Finitely Defined Groups[REVIEW]J. L. Britton - 1969 - Journal of Symbolic Logic 34 (3):507-508.
  50.  16
    Review: B. H. Mayoh, Groups and Semigroups with Solvable Word Problems. [REVIEW]F. B. Cannonito - 1971 - Journal of Symbolic Logic 36 (3):541-541.
1 — 50 / 1000