Search Results - "Word problems, etc. in computability and recursion theory"
-
1
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
-
2
Authors: S. I. Adian
Source: Theoretical Computer Science. 339:3-6
Subject Terms: Defining relation, monoid, word problem, algorithm, Combinatorics on words, divisibility problem, Monoid, defining relation, 01 natural sciences, Word problem, Theoretical Computer Science, Algorithm, 0103 physical sciences, 0101 mathematics, Word problems, etc. in computability and recursion theory, Nonnumerical algorithms, Divisibility problem, Computer Science(all)
File Description: application/xml
-
3
Authors:
Source: Journal of the London Mathematical Society. 71:545-562
Subject Terms: quasi-finitely axiomatizable group, finitely generated group, first-order theory, Undecidability and degrees of sets of sentences, Word problems, other decision problems, connections with logic and automata (group-theoretic aspects), Applications of logic to group theory, 0101 mathematics, Word problems, etc. in computability and recursion theory, 01 natural sciences, \(\Pi_1^1\)-completeness
File Description: application/xml
Access URL: http://www.cs.auckland.ac.nz/~nies/papers/MorozovNies.pdf
https://zbmath.org/2197831
https://doi.org/10.1112/s0024610704006106
https://documat.unirioja.es/servlet/articulo?codigo=2207264
https://academic.oup.com/jlms/article/71/3/545/807608
https://londmathsoc.onlinelibrary.wiley.com/doi/abs/10.1112/S0024610704006106
https://dialnet.unirioja.es/servlet/articulo?codigo=2207264 -
4
Authors: 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 -
5
Authors:
Contributors:
Source: Semigroup Forum. 70:159-187
Subject Terms: hereditarily finitely generated varieties, small varieties, Lattices and Combinatorics, 0101 (four-digit-FOR), finite basis property, 230101 Mathematical Logic, finite semigroups, 16. Peace & justice, 01 natural sciences, Varieties and pseudovarieties of semigroups, semigroup varieties, Equational logic, Mal'tsev conditions, Set Theory, Lattices of varieties, hereditarily finitely based varieties, 0101 mathematics, 010100 Pure Mathematics, limit varieties, Word problems, etc. in computability and recursion theory
File Description: application/xml
-
6
Authors:
Source: Journal of Mathematical Sciences. 123:3921-3985
Subject Terms: elementary equivalences, Model-theoretic algebra, elementary properties, Word problems, other decision problems, connections with logic and automata (group-theoretic aspects), 0102 computer and information sciences, 01 natural sciences, Linear algebraic groups over arbitrary fields, Quasivarieties and varieties of groups, survey, Applications of logic to group theory, Classification theory, stability, and related concepts in model theory, 0101 mathematics, Word problems, etc. in computability and recursion theory, linear groups
File Description: application/xml
-
7
Authors: Claas E. Röver
Source: International Journal of Algebra and Computation. 14:499-504
Subject Terms: Extensions, wreath products, and other compositions of groups, context-free languages, syntactic monoids, Semigroups in automata theory, linguistics, etc, wreath products, Word problems, other decision problems, connections with logic and automata (group-theoretic aspects), Formal languages and automata, 0102 computer and information sciences, 0101 mathematics, Word problems, etc. in computability and recursion theory, 01 natural sciences
File Description: application/xml
-
8
Authors: Benjamin Wells
Source: Theoretical Computer Science. 317:191-207
Subject Terms: pseudorecursive theory, Hypercomputation, 0603 philosophy, ethics and religion, 01 natural sciences, Theoretical Computer Science, Complexity classes (hierarchies, relations among complexity classes, etc.), Decidable theories, 0101 mathematics, Church–Turing Thesis, Word problems, etc. in computability and recursion theory, Pseudorecursive theory, computability, Computability, Complexity of computation (including implicit computational complexity), Undecidability and degrees of sets of sentences, Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.), 06 humanities and the arts, Models of computation (Turing machines, etc.), Varieties of semigroups, Varieties and pseudovarieties of semigroups, hypercomputation, Church-Turing thesis, varieties of semigroups, Equational classes, universal algebra in model theory, decidable theories, Computer Science(all)
File Description: application/xml
Access URL: https://zbmath.org/2081204
https://doi.org/10.1016/j.tcs.2003.12.011
https://dl.acm.org/doi/10.1016/j.tcs.2003.12.011
https://dblp.uni-trier.de/db/journals/tcs/tcs317.html#Wells04
https://www.sciencedirect.com/science/article/pii/S0304397503006388
https://research.cs.queensu.ca/~akl/cisc879/papers/PAPERS_FROM_THEORETICAL_COMPUTER_SCIENCE/05051011123316076.pdf
https://core.ac.uk/display/23940416
https://doi.org/10.1016/j.tcs.2003.12.011 -
9
Authors: Martin R. Bridson
Source: Commentarii Mathematici Helvetici. 78:752-771
Subject Terms: Hyperbolic groups and nonpositively curved groups, indexed languages, finitely presented groups, combings, Grammars and rewriting systems, Word problems, other decision problems, connections with logic and automata (group-theoretic aspects), Formal languages and automata, 0102 computer and information sciences, 0101 mathematics, Geometric group theory, Word problems, etc. in computability and recursion theory, automatic groups, 01 natural sciences
File Description: application/xml
Access URL: http://www.ems-ph.org/journals/show_pdf.php?issn=0010-2571&vol=78&iss=4&rank=6
https://link.springer.com/article/10.1007/s00014-003-0776-7
https://www.ems-ph.org/journals/show_pdf.php?issn=0010-2571&vol=78&iss=4&rank=6
https://link.springer.com/content/pdf/10.1007/s00014-003-0776-7.pdf
https://dialnet.unirioja.es/servlet/articulo?codigo=784246
https://www.ems-ph.org/journals/show_abstract.php?issn=0010-2571&vol=78&iss=4&rank=6
https://people.maths.ox.ac.uk/bridson/papers/combings/combings.pdf
https://ora.ox.ac.uk/objects/uuid:e7010ab1-f425-4aad-bc66-3e4ff0c9c557
https://doi.org/10.1007/s00014-003-0776-7 -
10
Authors:
Source: Discrete Applied Mathematics. 130:521-526
Subject Terms: Applied Mathematics, decidability, Infinite words, Decidability, Formal languages and automata, 0102 computer and information sciences, 01 natural sciences, infinite solutions, Decidability of theories and sets of sentences, infinite word, Post Correspondence Problem, Discrete Mathematics and Combinatorics, binary Post Correspondence Problem, 0101 mathematics, Binary PCP, Word problems, etc. in computability and recursion theory, binary instance
File Description: application/xml
Access URL: https://zbmath.org/1984630
https://doi.org/10.1016/s0166-218x(03)00330-5 -
11
Authors: Mundici, Daniele
Source: Transactions of the American Mathematical Society. 356:1937-1955
Subject Terms: Applied Mathematics, General Mathematics, Elliott's classification, \(C^*\)-equivalence, Word problems, other decision problems, connections with logic and automata (group-theoretic aspects), Ordered abelian groups, Riesz groups, ordered linear spaces, 01 natural sciences, De Concini-Procesi theorem for toric varieties, Classifications of \(C^*\)-algebras, Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry), stable AF-algebra, isomorphism of Bratteli diagrams, Markov undecidability theorem, 0101 mathematics, Word problems, etc. in computability and recursion theory
File Description: application/xml
Access URL: https://www.ams.org/tran/2004-356-05/S0002-9947-03-03353-1/S0002-9947-03-03353-1.pdf
https://zbmath.org/2041166
https://doi.org/10.1090/s0002-9947-03-03353-1
https://www.ams.org/tran/2004-356-05/S0002-9947-03-03353-1/S0002-9947-03-03353-1.pdf
https://www.ams.org/journals/tran/2004-356-05/S0002-9947-03-03353-1/home.html
https://www.openaccessrepository.it/record/207804 -
12
Authors:
Source: Electronic Research Announcements of the American Mathematical Society. 9:40-50
Subject Terms: Generators, relations, and presentations of groups, solvable conjugacy problem, 0103 physical sciences, Frattini embeddings, Subgroup theorems, subgroup growth, finitely generated recursively presented groups, Turing degrees, Word problems, other decision problems, connections with logic and automata (group-theoretic aspects), 0101 mathematics, Word problems, etc. in computability and recursion theory, 01 natural sciences
File Description: application/xml
Access URL: https://www.ams.org/era/2003-09-06/S1079-6762-03-00110-0/S1079-6762-03-00110-0.pdf
https://zbmath.org/2175913
https://doi.org/10.1090/s1079-6762-03-00110-0
https://www.ams.org/era/2003-09-06/S1079-6762-03-00110-0/S1079-6762-03-00110-0.pdf
https://www.ams.org/journals/era/2003-09-06/S1079-6762-03-00110-0/ -
13
Authors: SP Bas Luttik
Source: Annals of Pure and Applied Logic. 121:39-87
Subject Terms: Logic in computer science, input prefix mechanism, process algebras, Specification and verification (program logics, model checking, etc.), transition trees, Logic, Process algebra, Transition tree, 0102 computer and information sciences, 01 natural sciences, Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.), choice quantifiers, Choice quantification, Input prefix mechanism, 0101 mathematics, Word problems, etc. in computability and recursion theory
File Description: application/xml
Access URL: https://zbmath.org/1915311
https://doi.org/10.1016/s0168-0072(02)00082-9
https://dblp.uni-trier.de/db/journals/apal/apal121.html#Luttik03
https://www.sciencedirect.com/science/article/pii/S0168007202000829
https://www.narcis.nl/publication/RecordID/oai%3Aresearch.vu.nl%3Apublications%2Fdb07acda-baf9-467e-89f8-2fe8c097602a
https://research.vu.nl/en/publications/on-the-expressiveness-of-choice-quantification
https://www.sciencedirect.com/science/article/abs/pii/S0168007202000829 -
14
Authors:
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 -
15
Authors: Bella V. Rozenblat
Source: Israel Journal of Mathematics. 128:355-379
Subject Terms: completely simple semigroups, Decidability of theories and sets of sentences, Free semigroups, generators and relations, word problems, undecidability, decidability, elementary theories, 0102 computer and information sciences, Rees matrix semigroups, 0101 mathematics, Word problems, etc. in computability and recursion theory, 01 natural sciences
File Description: application/xml
-
16
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
-
17
Authors:
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
-
18
Authors: V. Yu. Popov
Source: Siberian Mathematical Journal. 43(6):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, Word problems, etc. in computability and recursion theory
File Description: application/xml
-
19
Authors: Miklós Laczkovich
Source: Proceedings of the American Mathematical Society. 131:2235-2240
Subject Terms: Decidability of theories and sets of sentences, undecidable problems, rings of elementary functions, Elementary functions, 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://www.ams.org/proc/2003-131-07/S0002-9939-02-06753-9/S0002-9939-02-06753-9.pdf
https://www.ams.org/journals/proc/2003-131-07/S0002-9939-02-06753-9/home.html
https://doi.org/10.1090%2FS0002-9939-02-06753-9
https://www.jstor.org/stable/1194043
https://www.ams.org/proc/2003-131-07/S0002-9939-02-06753-9/S0002-9939-02-06753-9.pdf -
20
Authors: Patrick Dehornoy
Source: Algebra Universalis. 48:223-248
Subject Terms: word problem, Mathematics - Logic, Group Theory (math.GR), 03D40, 08B20, 20N02, 01 natural sciences, Word problems (aspects of algebraic structures), Free algebras, one-generated free algebra, self-distributivity, FOS: Mathematics, 0101 mathematics, Logic (math.LO), Word problems, etc. in computability and recursion theory, Mathematics - Group Theory
File Description: application/xml
Full Text Finder
Nájsť tento článok vo Web of Science