Reviews for Mathematical Reviews (MathSciNet)

  • MR3380150   Gauthier, Yvon A (2015); A note on the internal logic of constructive mathematics: the Gel'fond-Schneider theorem in transcendental number theory, The road to universal logic, 297--306, Stud. Univers. Log., Birkhauser/Springer, Cham. 03F50 (11J81).
  • MR3349107   Ceccherini-Silberstein, Tullio; Coornaert, Michel (2015); On surjunctive monoids, Internat. J. Algebra Comput. 25, no. 4, 567--606. 20M30 (37B10 37B15 54E15 68Q80).
  • MR3376389   Haviv, Ishay; Regev, Oded (2014); On the lattice isomorphism problem, Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 391--404, ACM, New York, 2014. 68Q25.
  • MR3286942   Sun, Qifu Tyler; Li, Shuo-Yen Robert (2014); Lattice classification by cut-through coding, Order 31, no. 2, 271--278. 08B15.
  • MR3267089   Honkala, Juha (2014); Remarks concerning the freeness problem over morphism and matrix semigroups, Theoret. Comput. Sci. 557, 115--119. 20M99 (03B25).
  • MR3200358   Chiodo, Maurice (2014); On torsion in finitely presented groups, Groups Complex. Cryptol. 6, no. 1, 1--8. 20F10 (03D40 03D80 20F05).
  • MR3201831   Dean, Walter (2014); Montague's paradox, informal provability, and explicit modal logic, Notre Dame J. Form. Log. 55, no. 2, 157--196. 03F03 (03F45 03F50).
  • MR3131915   Pin, Jean-Eric; Silva, Pedro V. (2014); A noncommutative extension of Mahler's theorem on interpolation series, European J. Combin. 36, 564--578. 20F10 (11S80 20M05 68Q70).
  • MR3145108   Tyszka, Apoloniusz (2013); A new characterization of computable functions, An. Stiint. Univ. "Ovidius'' Constanta Ser. Mat. 21, no. 3, 289--293. 03D20 (11U09).
  • MR3109604   Schuster, Peter (2013); Induction in algebra: a first case study, Log. Methods Comput. Sci. 9, no. 3, 3:20, 19 pp. 03F65 (03F50 13L05).
  • MR3056060   Allender, Eric; Davie, George; Friedman, Luke; Hopkins, Samuel B.; Tzameret, Iddo (2013); Kolmogorov complexity, circuits, and the strength of formal theories of arithmetic, Chic. J. Theoret. Comput. Sci., Article 5, 15 pp. 68Q15 (03F30 68Q30).
  • MR3307509   Malcher, Andreas; Meckel, Katja; Mereghetti, Carlo; Palano, Beatrice (2012); Description complexity of pushdown store languages, J. Autom. Lang. Comb. 17, no. 2-4, 225--244. 68Q45 (03B25 68Q42).
  • MR2981675   Cassaigne, Julien; Nicolas, Francois (2012); On the decidability of semigroup freeness, RAIRO Theor. Inform. Appl. 46, no. 3, 355--399. 20M05 (03B25 15A30).
  • MR2966625   Chiniforooshan, Ehsan; Daley, Mark; Ibarra, Oscar H.; Kari, Lila; Seki, Shinnosuke (2012); One-reversal counter machines and multihead automata: revisited, Theoret. Comput. Sci. 454, 81--87. 68Q45.
  • MR2965418   Kikuchi, Makoto; Kurahashi, Taishi; Sakai, Hiroshi (2012); On proofs of the incompleteness theorems based on Berry's paradox by Vopenka, Chaitin, and Boolos, Math. Log. Quarterly 8, no. 4-5, 307--316. 03F30 (03A05 03F40 68Q30).
  • MR2911183   de Araujo, Anderson; Carnielli, Walter (2012); Non-standard numbers: a semantic obstacle for modelling arithmetical reasoning, Log. J. IGPL 20, no. 2, 477--485. 03A05 (03D10 03F30).
  • MR2887631   Kirsten, Daniel (2012); Decidability, undecidability, and PSPACE-completeness of the twins property in the tropical semiring, Theoret. Comput. Sci. 420, 56--63. 68Q17 (68Q70).
  • MR2900636   Cook, Stephen; Fontes, Lila (2012); Formal theories for linear algebra, Log. Methods Comput. Sci. 8, no. 1, 1:25, 31 pp. 03F20 (03D15 68Q15).
  • MR2907804   Maletti, Andreas (2011); Survey: Weighted extended top-down tree transducers. Part I---Basics and expressive power, Acta Cybernet. 20, no. 2, 223--250. 68Q45 (68T50).
  • MR2918608   Maletti, Andreas (2011); Survey: Weighted extended top-down tree transducers. Part II---Application in machine translation, Fund. Inform. 112, no. 2-3, 239--261. 68Q45 (68T50).
  • MR2767236   Woodin, W. Hugh (2011); A potential subtlety concerning the distinction between determinism and nondeterminism, Infinity 119--129, Cambridge Univ. Press, Cambridge. 03A05 (03H15).
  • MR2838322   Ibuka, Shingo; Kikuchi, Makoto; Kikyo, Hirotaka (2011); Kolmogorov complexity and characteristic constants of formal theories of arithmetic, Math. Log. Quarterly 57, no. 5, 470--473. 68Q30 (03D10 03F30).
  • MR2839691   Blumensath, Achim (2011); Recognisability for algebras of infinite trees, Theoret. Comput. Sci. 412, no. 29, 3463--3486. 68Q70 (03D05 05C63).
  • MR2839731   Denecke, K.; Sarasit, N. (2011); Products of tree languages, Bull. Sect. Logic Univ. Lodz 40, no. 1-2, 13--36. 68Q45 (68Q70).
  • MR2810596   Liu, Yun; Guo, Yuqi (2011); Semigroups with I-quasi length and syntactic semigroups, Comm. Algebra 39, no. 3, 1069--1081. 20M35 (68Q70).
  • MR2805301   Komara, Jan (2011); On nested simple recursion, Arch. Math. Logic 50, no. 5-6, 617--624. 03D20.
  • MR2796057   Kambites, Mark (2011); Generic complexity of finitely presented monoids and semigroups, Comput. Complexity 20, no. 1, 21--50. 68Q25 (20M05).
  • MR2765638   Ishihara, Hajime; Schuster, Peter (2011); On the contrapositive of countable choice, Arch. Math. Logic 50, no. 1-2, 137--143. 03F55 (03E25 03F35 03F50).
  • MR2775153   Gomez, Antonio Cano; Steinby, Magnus (2011); Generalized contexts and n-ary syntactic semigroups of tree languages, Asian-Eur. J. Math. 4, no. 1, 49--79. 68Q70 (08A70 20M35).
  • MR2775706   Kolodziejczyk, Leszek Aleksander; Nguyen, Phuong; Thapen, Neil (2011); The provably total NP search problems of weak second order bounded arithmetic, Ann. Pure Appl. Logic 162, no. 6, 419--446. 03F30 (03D15 03F20 68Q15).
  • MR2770805   Diekert, Volker; Kufleitner, Manfred (2011); Fragments of first-order logic over infinite words, Theory Comput. Syst. 48, no. 3, 486--516. 68Q45 (03D05).
  • MR2774658   Chiodo, Maurice (2011); Finding non-trivial elements and splittings in groups, J. Algebra 331, 271--284. 20F10 (03D80 20E06 20F05).
  • MR2747726   Carlucci, Lorenzo; Dehornoy, Patrick; Weiermann, Andreas (2011); Unprovability results involving braids, Proc. Lond. Math. Soc. (3) 102, no. 1, 159--192. 03B30 (03F30 20F36 91A50).
  • MR2882826   Asou, Yousuke; Koriyama, Hiromi; Matsuo, Miyuki; Nono, Kiyoharu; Suzuki, Osamu (2010); Methods of formal language, genetics and ternary for non-associative algebras I, Bull. Soc. Sci. Lett. Lodz Ser. Rech. Deform. 60, no. 3, 29--49. 17A99.
  • MR2731232   Poinsot, Laurent; Duchamp, Gerard H. E.; Tollu, Christophe (2010); Partial monoids: associativity and confluence, J. Pure Appl. Math. Adv. Appl. 3, no. 2, 265--285. 20M05 (68Q42).
  • MR2726573   Michel, Pascal (2010); Homology of groups and third busy beaver function, Internat. J. Algebra Comput. 20, no. 6, 769--791. 03D10 (20J06).
  • MR2734969   Silva, Pedro V. (2010); Fixed points of endomorphisms over special confluent rewriting systems, Monatsh. Math. 161, no. 4, 417--447. 20M35 (20F67 68Q42 68R15).
  • MR2601030   Beklemishev, Lev D. (2010); Kripke semantics for provability logic GLP, Ann. Pure Appl. Logic 161, no. 6, 756--774. 03F45 (03B45).
  • MR2548473   Maroti, Miklos (2009); The existence of a near-unanimity term in a finite algebra is decidable, J. Symbolic Logic 74, no. 3, 1001--1014. 03B25 (03C05 08A62).
  • MR2566948   Cain, Alan J.; Oliver, Graham; Ruskuc, Nik; Thomas, Richard M. (2009); Automatic presentations for semigroups, Inform. and Comput. 207, no. 11, 1156--1168. 03D05.
  • MR2589993   Carrasco, Rafael C.; Daciuk, Jan (2009); A perfect hashing incremental scheme for unranked trees using pseudo-minimal automata, Theor. Inform. Appl. 43, no. 4, 779--790. 68P10 (68Q45).
  • MR2536701   Visser, Albert (2009); Growing commas. A study of sequentiality and concatenation, Notre Dame J. Form. Log. 50, no. 1, 61--85. 03B25 (03F25).
  • MR2506930   Carrasco, Rafael C.; Daciuk, Jan; Forcada, Mikel L. (2009); Incremental construction of minimal tree automata, Algorithmica 55, no. 1, 95--110. 68Q45 (68Q70).
  • MR2495541   Fulop, Zoltan; Maletti, Andreas; Vogler, Heiko (2009); A Kleene theorem for weighted tree automata over distributive multioperator monoids, Theory Comput. Syst. 44, no. 3, 455--499. 68Q70.
  • MR2511883   Moser, Georg (2009); The Hydra battle and Cichon's principle, Appl. Algebra Engrg. Comm. Comput. 20, no. 2, 133--158. 68Q42 (03F15).
  • MR2499430   Ganea, Mihai (2009); Arithmetic on semigroups, J. Symbolic Logic 74, no. 1, 265--278. 03D05 (03D35 03F25).
  • MR2467434   Fulop, Zoltan; Muzamel, Lorand (2008); Circularity, composition, and decomposition results for pebble macro tree transducers, J. Autom. Lang. Comb.13, no. 1, 3--44. 68Q70 (68Q60).
  • MR2372750   Esik, Zoltan; Ivan, Szabolcs (2008); Products of tree automata with an application to temporal logic, Fund. Inform. 82, no. 1-2, 61--78. 03D05 (03B44 68Q45 68Q70).
  • MR2372751   Esik, Zoltan; Ivan, Szabolcs (2008); Some varieties of finite tree automata related to restricted temporal logics, Fund. Inform. 82, no. 1-2, 79--103. 03D05 (03B44 68Q45 68Q70).
  • MR2387393   Carlstrom, Jesper (2008); A constructive version of Birkhoff's theorem, Math. Log. Quarterly 54, no. 1, 27--34. 03C05 (03F65 08A05).
  • MR2392300   Dershowitz, Nachum; Moser, Georg (2007); The hydra battle revisited. Rewriting computation and proof, Rewriting computation and proof 1--27, Lecture Notes in Comput. Sci., 4600, Springer, Berlin. 68Q42 (03F30).
  • MR2332718   Gyurica, Gyorgy (2007); On monotone languages and their characterization by regular expression, Acta Cybernet. 18, no. 1, 117--134. 68Q45.
  • MR2341386   Maletti, Andreas (2007); Pure and o-substitution, Internat. J. Found. Comput. Sci. 18, no. 4, 829--845. 68Q70 (68Q45).
  • MR2319335   Mucka, Anna (2007); The lattice of varieties of fibered automata, Discuss. Math. Gen. Algebra Appl. 27, no. 1, 87--107. 08B15 (08A68 68Q70).
  • MR2278078   Petkovic, Tatjana (2006); Regular tree languages and quasi orders, Acta Cybernet. 17, no. 4, 811--823. 68Q45 (06A06).
  • MR2217638   Kearnes, Keith A. (2005); Congruence lattices of locally finite algebras, Algebra Universalis 54, no. 2, 237--248. 08A30.
  • MR2186455   Esik, Z. (2005); An algebraic characterization of temporal logics on finite trees. I., Proceedings of the 1st International Conference on Algebraic Informatics, Aristotle Univ. Thessaloniki, Thessaloniki, 53--77. 03B44 (68Q45 68Q60 68Q70).
  • MR2186456   Esik, Z. (2005); An algebraic characterization of temporal logics on finite trees. II., Proceedings of the 1st International Conference on Algebraic Informatics, Aristotle Univ. Thessaloniki, Thessaloniki, 79--99. 03B44 (68Q45 68Q60 68Q70).
  • MR2186457   Esik, Z. (2005); An algebraic characterization of temporal logics on finite trees. III., Proceedings of the 1st International Conference on Algebraic Informatics, Aristotle Univ. Thessaloniki, Thessaloniki, 101--110. 03B44 (68Q45 68Q60 68Q70).
  • MR2150756   Esik, Zoltan; Weil, Pascal (2005); Algebraic recognizability of regular tree languages, Theoret. Comput. Sci. 340 (2005), no. 2, 291--321. 68Q70 (68Q45).
  • MR2073242   Fulop, Zoltan; Vogler, Heiko (2004); Weighted tree transducers, J. Autom. Lang. Comb. 9, no. 1, 31--54. 68Q45 (68Q65).
  • MR2053122   Hill, Patricia M.; Zaffanella, Enea; Bagnara, Robert (2004); A correct, precise and efficient integration of set-sharing, freeness and linearity for the analysis of finite and rational tree languages, Theory Pract. Log. Program. 4, no. 3, 289--323. 68N17 (68Q45 68Q55).
  • MR2020045   Moniri, Morteza (2003); Intuitionistic weak arithmetic, Arch. Math. Logic 42, no. 8, 791--796. 03F30 (03F55 03H15).

Back ☚