Search Results - Word problems, etc. in computability and recursion theory*

Language Learnability in the Limit: A Generalization of Gold’s Theorem: Language learnability in the limit: a generalization of Gold's theorem

Authors: Fernando C. Alves

Source: Journal of Logic, Language and Information. 32:363-372

Subject Terms: recursion theory, inductive inference, Computational learning theory, learning in the limit, Formal languages and automata, 06 humanities and the arts, 0101 mathematics, 0603 philosophy, ethics and religion, Word problems, etc. in computability and recursion theory, 01 natural sciences, Recursive functions and relations, subrecursive hierarchies, Gold's theorem

File Description: application/xml

Access URL: https://zbmath.org/7726393
https://doi.org/10.1007/s10849-022-09391-w

A finitely axiomatizable undecidable equational theory with recursively solvable word problems

Authors: Dejan Delić

Source: Transactions of the American Mathematical Society. 352:3065-3101

Subject Terms: undecidable equational theory, Decidability of theories and sets of sentences, Word problems (aspects of algebraic structures), Equational logic, Mal'tsev conditions, Equational classes, universal algebra in model theory, many-sorted logics, 0102 computer and information sciences, 0101 mathematics, Automata and formal grammars in connection with logical questions, Word problems, etc. in computability and recursion theory, recursively solvable word problems, 01 natural sciences

File Description: application/xml

Access URL: https://www.ams.org/tran/2000-352-07/S0002-9947-99-02339-9/S0002-9947-99-02339-9.pdf
https://zbmath.org/1449843
https://doi.org/10.1090/s0002-9947-99-02339-9
https://www.ams.org/journals/tran/2000-352-07/S0002-9947-99-02339-9/home.html
https://www.ams.org/tran/2000-352-07/S0002-9947-99-02339-9/S0002-9947-99-02339-9.pdf
https://www.jstor.org/stable/118198

On connection between the word problem and decidability of the equational theory: On a connection between the word problem and decidability of the equational theory

Authors: V. Yu. Popov

Source: Siberian Mathematical Journal. 41:921-923

Subject Terms: word problem, monogenic ring, Decidability of theories and sets of sentences, decidability, Undecidability and degrees of sets of sentences, 0102 computer and information sciences, Applications of logic to commutative algebra, 0101 mathematics, Word problems, etc. in computability and recursion theory, 01 natural sciences, equational theory

File Description: application/xml

Access URL: https://link.springer.com/article/10.1007/BF02674748

GROUPS WITH CONTEXT-FREE CO-WORD PROBLEM: Groups with context-free co-word problem.

Authors: Holt, D. F. Rees, Sarah Röver, Claas E. et al.

Source: Journal of the London Mathematical Society. 71:643-657

Subject Terms: word problem, Generators, relations, and presentations of groups, Baumslag-Solitar groups, Word problems, other decision problems, connections with logic and automata (group-theoretic aspects), Formal languages and automata, 0102 computer and information sciences, context-free groups, 01 natural sciences, polycyclic groups, 0101 mathematics, QA, Word problems, etc. in computability and recursion theory, co-word problem, virtually Abelian groups

File Description: application/xml; application/pdf; Metadata

Access URL: http://wrap.warwick.ac.uk/746/1/WRAP_Holt_Context_free_co-word.pdf
http://doi.wiley.com/10.1112/S002461070500654X
http://wrap.warwick.ac.uk/746/1/WRAP_Holt_Context_free_co-word.pdf
https://homepages.warwick.ac.uk/~mareg/download/papers/cocofree/coCF.pdf
https://londmathsoc.onlinelibrary.wiley.com/doi/10.1112/S002461070500654X
https://academic.oup.com/jlms/article/71/3/643/807629
http://journals.cambridge.org/abstract_S002461070500654X

Deciding the Word Problem in the Union of Equational Theories: Deciding the word problem in the union of equational theories.

Authors: Cesare Tinelli Franz Baader

Source: Information and Computation. 178:346-390

Subject Terms: 0102 computer and information sciences, equational reasoning, decision procedure, 01 natural sciences, Theoretical Computer Science, Computer Science Applications, Mechanization of proofs and logical operations, Decidability of theories and sets of sentences, Computational Theory and Mathematics, Equational classes, universal algebra in model theory, Grammars and rewriting systems, 0101 mathematics, Word problems, etc. in computability and recursion theory, Theorem proving (deduction, resolution, etc.), Information Systems

File Description: application/xml

SOLVING THE WORD PROBLEM IN REAL TIME: Solving the word problem in real time

Authors: Sarah Rees Derek F. Holt

Source: Journal of the London Mathematical Society. 63:623-639

Subject Terms: Hyperbolic groups and nonpositively curved groups, word problem, Dehn algorithms, Word problems, other decision problems, connections with logic and automata (group-theoretic aspects), real-time Turing machines, word-hyperbolic groups, 0102 computer and information sciences, 0101 mathematics, QA, Word problems, etc. in computability and recursion theory, 01 natural sciences, Cancellation theory of groups, application of van Kampen diagrams

File Description: application/xml; application/pdf

Access URL: http://wrap.warwick.ac.uk/812/1/WRAP_Holt_Solving_word_problem.pdf
https://zbmath.org/1818689
https://doi.org/10.1017/s0024610701002083
https://academic.oup.com/jlms/article/63/3/623/874155
https://www.cambridge.org/core/journals/journal-of-the-london-mathematical-society/article/solving-the-word-problem-in-real-time/695F515DD5049D05D25BA1B13C64C991
https://londmathsoc.onlinelibrary.wiley.com/doi/abs/10.1017/S0024610701002083
http://wrap.warwick.ac.uk/812/
https://homepages.warwick.ac.uk/~mareg/download/papers/realtimewp2/rtwp2.pdf

ON REAL-TIME WORD PROBLEMS: On real-time word problems

Authors: Derek F. Holt Claas E. Röver

Source: Journal of the London Mathematical Society. 67:289-301

Subject Terms: restricted wreath product, Turing machines and related notions, word problem of a group, Word problems, other decision problems, connections with logic and automata (group-theoretic aspects), multitape real-time Turing machine, 0101 mathematics, QA, Word problems, etc. in computability and recursion theory, 01 natural sciences

File Description: application/xml; application/pdf

Access URL: http://wrap.warwick.ac.uk/767/1/WRAP_Holt_Real-time_word.pdf
https://zbmath.org/2072594
https://doi.org/10.1112/s0024610702003770
https://dialnet.unirioja.es/servlet/articulo?codigo=644753
https://www.cambridge.org/core/services/aop-cambridge-core/content/view/S0024610702003770
https://www.cambridge.org/core/journals/journal-of-the-london-mathematical-society/article/on-realtime-word-problems/EDCB489C299754983EEAA4B5A75ECF8A
https://wrap.warwick.ac.uk/id/eprint/767
https://academic.oup.com/jlms/article-abstract/67/2/289/804486/
https://londmathsoc.onlinelibrary.wiley.com/doi/pdf/10.1112/S0024610702003770

Solving the Word Problem for Two Classes of Non-associative Rings by Rewriting: Solving the word problem for two classes of non-associative rings by rewriting

Authors: Alfred Widiger

Source: Journal of Symbolic Computation. 32:291-301

Subject Terms: Mechanization of proofs and logical operations, Computational Mathematics, Nonassociative algebras satisfying other identities, Algebra and Number Theory, Grammars and rewriting systems, 0101 mathematics, Word problems, etc. in computability and recursion theory, 01 natural sciences, Theorem proving (deduction, resolution, etc.)

File Description: application/xml

Access URL: https://zbmath.org/1656474
https://doi.org/10.1006/jsco.2000.0404
https://core.ac.uk/display/81214864
https://dialnet.unirioja.es/servlet/articulo?codigo=734579
https://dblp.uni-trier.de/db/journals/jsc/jsc32.html#Widiger01
https://www.sciencedirect.com/science/article/abs/pii/S0747717100904048

On Complexity of the Word Problem for Finitely Presented Commutative Semigroups: On the complexity of the word problem for finitely presented commutative semigroups

Authors: V. Yu. Popov

Source: Siberian Mathematical Journal. 43:1086-1093

Subject Terms: word problem, Complexity of computation (including implicit computational complexity), Free semigroups, generators and relations, word problems, commutative semigroup, Commutative semigroups, Turing machines and related notions, real time Turing machine, 0102 computer and information sciences, 0101 mathematics, Word problems, etc. in computability and recursion theory, 01 natural sciences

File Description: application/xml

Access URL: https://zbmath.org/1936760
https://link.springer.com/article/10.1023/A%3A1021125502991
https://link.springer.com/content/pdf/10.1023/A:1021125502991.pdf

Undecidable varieties with solvable word problems - III (A semigroup variety): Undecidable varieties with solvable word problems. III (a semigroup variety)

Authors: Crvenković, Siniša Dolinka, Igor

Source: Novi Sad Journal of Mathematics - NSJOM. 28(2):109-117

Subject Terms: word problem, Decidability of theories and sets of sentences, Free semigroups, generators and relations, word problems, Word problems (aspects of algebraic structures), undecidability, Varieties, decidability, 0101 mathematics, 01 natural sciences, Word problems, etc. in computability and recursion theory, Varieties and pseudovarieties of semigroups, equational theory, semigroup variety

File Description: application/xml

Access URL: https://zbmath.org/1868880
https://www.cris.uns.ac.rs/record.jsf?recordId=3096&source=OpenAIRE&language=en

Undecidable varieties with solvable word problems - II: Undecidable varieties with solvable word problems. I

Authors: Crvenković, Siniša Dolinka, Igor

Source: Novi Sad Journal of Mathematics - NSJOM. 26(2):21-30

Subject Terms: word problem, undecidable equational theory, Free semigroups, generators and relations, word problems, Varieties, decidability, solvable word problems, 0102 computer and information sciences, 01 natural sciences, Varieties and pseudovarieties of semigroups, recursively based semigroup variety, equational theory, Word problems (aspects of algebraic structures), varieties, recursively based varieties, 0101 mathematics, Word problems, etc. in computability and recursion theory

File Description: application/xml

Access URL: https://zbmath.org/1123898
https://zbmath.org/1482215
https://www.cris.uns.ac.rs/record.jsf?recordId=3095&source=OpenAIRE&language=en
https://www.cris.uns.ac.rs/record.jsf?recordId=3094&source=OpenAIRE&language=en

A NOTE ON CONTEXT-SENSITIVE LANGUAGES AND WORD PROBLEMS: A note on context-sensitive languages and word problems

Authors: Michael Shapiro

Source: International Journal of Algebra and Computation. :493-497

Subject Terms: Free semigroups, generators and relations, word problems, short asynchronous combings, deterministic linear bounded automata, Word problems, other decision problems, connections with logic and automata (group-theoretic aspects), Formal languages and automata, Group Theory (math.GR), 0102 computer and information sciences, finitely generated subgroups, 01 natural sciences, context- sensitive word problem, Semigroups in automata theory, linguistics, etc, FOS: Mathematics, context-sensitive languages, 0101 mathematics, Geometric group theory, Word problems, etc. in computability and recursion theory, automatic groups, Mathematics - Group Theory

File Description: application/xml

Access URL: http://arxiv.org/abs/math/9306204
https://researchportal.bath.ac.uk/en/publications/a-note-on-context-sensitive-languages-and-word-problems
https://www.worldscientific.com/doi/abs/10.1142/S0218196794000129
https://dblp.uni-trier.de/db/journals/ijac/ijac4.html#Shapiro94
https://doi.org/10.1142/S0218196794000129

A residually finite associative algebra with an undecidable word problem

Authors: O. V. Belegradek

Source: Algebra and Logic. 39:252-258

Subject Terms: word problem, residually finite algebras, recursively defined algebras, 0102 computer and information sciences, 01 natural sciences, Decidability of theories and sets of sentences, Applications of logic in associative algebras, associative algebras, Finite rings and finite-dimensional associative algebras, commutative rings, finitely generated algebras, 0101 mathematics, Word problems, etc. in computability and recursion theory, Finite generation, finite presentability, normal forms (diamond lemma, term-rewriting)

File Description: application/xml

Access URL: https://zbmath.org/1622460
https://link.springer.com/article/10.1007%2FBF02681649
https://link.springer.com/content/pdf/10.1007/BF02681649.pdf

THE WORD PROBLEM OF ACD-GROUND THEORIES IS UNDECIDABLE: The word problem of ACD-ground theories is undecidable

Authors: Claude Marché

Source: International Journal of Foundations of Computer Science. :81-92

Subject Terms: Decidability of theories and sets of sentences, Word problems (aspects of algebraic structures), Grammars and rewriting systems, 0102 computer and information sciences, 0101 mathematics, Word problems, etc. in computability and recursion theory, 01 natural sciences, equational theory, ground equations

File Description: application/xml

Access URL: https://zbmath.org/94721
https://doi.org/10.1142/s0129054192000085
https://dblp.uni-trier.de/db/journals/ijfcs/ijfcs3.html#Marche92
https://www.worldscientific.com/doi/abs/10.1142/S0129054192000085

Polynomial Time Uniform Word Problems: Polynomial time uniform word problems

Authors: Stanley Burris

Source: Mathematical Logic Quarterly. 41:173-182

Subject Terms: Partial algebras, Analysis of algorithms and problem complexity, universal theory of lattices, 0102 computer and information sciences, 01 natural sciences, uniform word problem, quasivariety, Free lattices, projective lattices, word problems, polynomial time decidability, weak embedding closure, Word problems (aspects of algebraic structures), finite axiomatizability, 0101 mathematics, Word problems, etc. in computability and recursion theory, universal Horn class, universal closure, Quasivarieties

File Description: application/xml

Access URL: http://www.math.uwaterloo.ca/~snburris/htdocs/MYWORKS/PAPERS/uwp.pdf
https://zbmath.org/761101
https://doi.org/10.1002/malq.19950410204
https://dblp.uni-trier.de/db/journals/mlq/mlq41.html#Burris95
https://core.ac.uk/display/100863115
http://onlinelibrary.wiley.com/doi/10.1002/malq.19950410204/abstract

A variety with locally solvable but globally unsolvable word problem

Authors: Siniša Crvenković D. Delić

Source: Algebra Universalis. 35:420-424

Subject Terms: variety of finite type, undecidable equational theory, Word problems (aspects of algebraic structures), Equational logic, Mal'tsev conditions, Undecidability and degrees of sets of sentences, 0102 computer and information sciences, 0101 mathematics, Word problems, etc. in computability and recursion theory, local word problem, 01 natural sciences

File Description: application/xml

Access URL: https://zbmath.org/908013
https://doi.org/10.1007/bf01197182
https://www.cris.uns.ac.rs/record.jsf?recordId=3414&source=OpenAIRE&language=en
https://link.springer.com/article/10.1007/BF01197182
https://link.springer.com/content/pdf/10.1007/BF01197182.pdf

The Word Problem for Free Partially Commutative, Partially Associative Groupoids: The word problem for free partially commutative, partially associative groupoids

Authors: David P. Jacobs Sekhar V. Muddana

Source: Journal of Symbolic Computation. 16:557-562

Subject Terms: left nucleus, word problem, Algebra and Number Theory, free partially commutative, partially associative groupoids, word problem, groupoid, symmetric binary relations, 01 natural sciences, Groupoids (i.e. small categories in which all morphisms are isomorphisms), Computational Mathematics, free groupoids, 0101 mathematics, Sets with a single binary operation (groupoids), Word problems, etc. in computability and recursion theory, generators

File Description: application/xml

Access URL: https://zbmath.org/598154
https://doi.org/10.1006/jsco.1993.1063
https://www.sciencedirect.com/science/article/abs/pii/S0747717183710631
https://dialnet.unirioja.es/servlet/articulo?codigo=368830
https://core.ac.uk/display/82163179
https://dblp.uni-trier.de/db/journals/jsc/jsc16.html#JacobsM93
https://www.sciencedirect.com/science/article/pii/S0747717183710631
https://dlnext.acm.org/doi/10.1006/jsco.1993.1063

A Variety with Solvable, but not Uniformly Solvable, Word Problem: A variety with solvable, but not uniformly solvable, word problem

Authors: Saharon Shelah Evelyn Nelson Alan H. Mekler

Source: Proceedings of the London Mathematical Society. :225-256

Subject Terms: recursively based variety of finite type, infinite type, Varieties, Mathematics - Logic, Mathematics - Rings and Algebras, 0102 computer and information sciences, uniformly solvable word problem, solvable word problem, finitely based variety of finite type, 01 natural sciences, halting problem, universal Turing machine, Word problems (aspects of algebraic structures), Rings and Algebras (math.RA), FOS: Mathematics, 0101 mathematics, Logic (math.LO), Word problems, etc. in computability and recursion theory

File Description: application/xml

Access URL: http://arxiv.org/pdf/math/9301203
http://arxiv.org/abs/math/9301203
https://academic.oup.com/plms/article/s3-66/2/225/1524907
https://core.ac.uk/display/20708342
https://londmathsoc.onlinelibrary.wiley.com/doi/pdf/10.1112/plms/s3-66.2.225

Seperating the intrinsic complexity and the derivational complexity of the word problem for finitely presented groups: Separating the intrinsic complexity and the derivational complexity of the word problem for finitely presented groups

Authors: Friedrich Otto Klaus Madlener Daniel E. Cohen

Source: Mathematical Logic Quarterly. 39:143-157

Subject Terms: pseudo-natural algorithm, word problems for groups, modular machines, Word problems, other decision problems, connections with logic and automata (group-theoretic aspects), Turing machines, 0102 computer and information sciences, 0101 mathematics, complexity, Word problems, etc. in computability and recursion theory, 01 natural sciences, halting problem

File Description: application/xml

Access URL: https://onlinelibrary.wiley.com/doi/10.1002/malq.19930390117
https://philpapers.org/rec/COHSTI
https://dblp.uni-trier.de/db/journals/mlq/mlq39.html#OttoCM93
https://doi.org/10.1002/malq.19930390117

On the word problem of lattices with the help of graphs

Authors: G. Czédli

Source: Periodica Mathematica Hungarica. 23:49-58

Subject Terms: word problem, finitely presented lattices, algorithm, Free lattices, projective lattices, word problems, 0102 computer and information sciences, 0101 mathematics, Word problems, etc. in computability and recursion theory, 01 natural sciences

File Description: application/xml

Access URL: https://link.springer.com/article/10.1007/BF02260393
https://link.springer.com/content/pdf/10.1007/BF02260393.pdf