PHOTO

Saeed Salehi

Personal Website

 
 
 
  Home Publications Talks/Lectures Courses/Theses Miscellaneous  
             
 
  • Research Interests
    • Mathematics
      • Mathematical Logic (Axiomatic Systems, Decidability, and Axiomatizability).
    • Computer Science
      • Theory of Computability, and Complexity Theory (and relations with Logic).
    • Philosophy
      • Philosophy of Mathematics (Constructivity, Intuitionism, and Incompleteness).

  • Curriculum Vitae (a printable pdf file of my CV, 6 pages).

 
 
  Home Publications Talks/Lectures Courses/Theses Miscellaneous  
             
 

 
 
  Home Publications Talks/Lectures Courses/Theses Miscellaneous  
             
 

 
 
  Home Publications Talks/Lectures Courses/Theses Miscellaneous  
             
 

 
 
  Home Publications Talks/Lectures Courses/Theses Miscellaneous  
             
 
  • Honors

  • Awarded Grants
    • Researcher (Grantee) at the Institute for Research in Fundamental Sciences, Tehran, Iran:
      • Project Title: On Some Multiplicative Structures of the Rational Numbers (Grant No. 98030022), 2019.
      • Project Title: Gödel's Second Incompleteness Theorem From Computational Viewpoint (Grant No. 96030030), 2017.
      • Project Title: Resolving Paradoxes By Turning Them Into Proofs (Grant No. 95030033), 2016.
      • Project Title: Structural Comparison of Various Proofs for Incompleteness (Grant No. 94030033), 2015.
      • Project Title: Generalizing Gödel's Incompleteness Theorem for Definable Theories (Grant No. 93030033), 2014.
      • Project Title: The Incompleteness Phenomenon from Computational Viewpoint (Grant No. 92030033), 2013.
      • Project Title: Axiomatizability of Some Multiplicative Structures of Numbers (Grant No. 91030033), 2012.
      • Project Title: On the Decidability of Some Ordered Structures of Numbers (Grant No. 90030053), 2011.
      • Project Title: On the Herbrand Consistency of Weak Arithmetical Theories (Grant No. 89030062), 2010.
      • Project Title: Herbrand Consistency Predicate of Bounded Arithmetics (Grant No. 86030011), 2007.
    • Research Grant awarded by the National Elite Foundation, Iran (2008-2009).
    • Research Grants from Iran National Science Foundation (INSF):
      • Project Title: Diagonal Arguments: From Cantor's Non-Equinumerosity to Gödel's Incompleteness Theorem (Grant No. 98013430), 2019.
    • Research Grants awarded by University of Tabriz, Tabriz, Iran:
      • Project Title: Gödelian Sentences and Unprovable Sentences in Arithmetical Theories (Grant No. S/1400), 2020.
      • Project Title: Self-Referential Sentences in First-Order Arithmetical Theories (Grant No. S/872), 2019.
      • Project Title: The Diagonalization Lemma and its Applications in Logic and Computer Science (Grant No. S/877) 2018.
      • Project Title: Some Philosophical Considerations on Gödel's Incompleteness Theorem (Grant No. S/713), 2017.
      • Project Title: Some Considerations on Primitive Recursive Functions and Relations (Grant No. S/712), 2017.
    • Travel Grants
      • Grant for participating and delivering a talk at the International Workshop on Logical Approaches to Barriers in Computing and Complexity (LABCC'10), Greifswald, Germany, 17–20 February 2010.
      • Grant for participating and presenting a poster at the Fourth European Congress of Mathematics (4ECM), Stockholm, Sweden, 27 June–2 July 2004.
      • Grant for participating at Summer School on Structural Theory of Automata, Semigroups and Universal Algebra, NATO Advanced Study Institute and Universite de Montreeal, Montreal, Canada, 7–18 July 2003.
      • Grant for participating at Summer School and Workshop on Proof Theory, Computation and Complexity, Technische Universitat Dresden, Dresden, Germany, 23 June–4 July 2003.
      • Grant for participating and delivering a talk at the (6th) Student Session of the (13th) European Summer School in Logic, Language and Information (ESSLLI'01), Helsinki, Finland, 13–24 August 2001.
      • ASL Student Travel Grants for participating and delivering talks at Logic Colloquiums in 1999 (Utrecht, The Netherlands), 2000 (Paris, France), and 2001 (Vienna, Austria).
    • Ph.D. Studentship

  • Organizing Conferences

  • Selected Visits

  • Referee
    • Theoretical Computer Science (TCS of Elsevier).
    • The Review of Symbolic Logic (RSL of the Association for Symbolic Logic).
    • International Journal of Foundations of Computer Science (IJFCS of World Scientific).
    • Philosophia Mathematica (PhilMath of Oxford University Press).
    • Bulletin of the Iranian Mathematical Society (BIMS of Springer).
    • Discussiones Mathematicæ—General Algebra and Applications (DMGAA).
    • Notre Dame Journal of Formal Logic (NDJFL of University of Notre Dame).
    • Proceedings of the 24th International Workshop on Logic, Language, Information, and Computation (WoLLIC 2017), 18–21 July 2017, London, United Kingdom (LNCS 10388, Springer 2017).
    • Proceedings of the 13th International Conference on Automata and Formal Languages (AFL'11), 17–22 August 2011, Debrecen, Hungary; P. Domosi & S. Ivan (eds.), Nyiregyhaza College.
    • Proceedings of the 31th International Colloquium on Automata, Languages and Programming (ICALP'04), 12–16 July 2004, Turku, Finland (LNCS 3142, Springer 2004).
    • Iran National Science Foundation (INSF).
    • Iranian Journal of Mathematical Sciences and Informatics (IJMSI).

  • Internet Links

  • Hobbies
    • reading and listening to music (very often done together!),
    • walking (long distances) and sightseeing (cities and the nature),
    • Tai Chi Chuan Yang Style (for keeping fit and staying healthy).

  • Some Mementos (and pictures).

 
 
http://saeedsalehi.ir/
 

© Saeed Salehi 2021



 

Reviews for Zentralblatt MATH (zbMATH)


  • Zbl 07326440   Kurahashi, Taishi (2020); A note on derivability conditions, J. Symb. Log. 85, 1224-1253.
  • Zbl 07335864   Cheng, Yong (2020); Finding the limit of incompleteness. I, Bull. Symb. Log. 26, No. 3-4, 268-286.
  • Zbl 07243253   von Plato, Jan (2020); Can mathematics be proved consistent? Gödel's shorthand notes & lectures on incompleteness, Sources and Studies in the History of Mathematics and Physical Sciences. Cham: Springer (ISBN 978-3-030-50875-3/hbk; 978-3-030-50876-0/ebook). ix, 263 p.
  • Zbl 1456.03091   Montalban, Antonio; Walsh, James (2019); On the inevitability of the consistency operator, J. Symb. Log. 84, No. 1, 205-225.
  • Zbl 1454.03015   Utreras, Javier (2019); Interpreting arithmetic in the first-order theory of addition and coprimality of polynomial rings, J. Symb. Log. 84, No. 3, 1194-1214.
  • Zbl 1454.03079   Konovalov, A. Yu. (2019); Generalized realizability for extensions of the language of arithmetic, Mosc. Univ. Math. Bull. 74, No. 4, 167-170. Translation from Vestn. Mosk. Univ., Ser. I 74, No. 4, 50-54.
  • Zbl 1446.03029   Hieronymi, Philipp (2019); When is scalar multiplication decidable?, Ann. Pure Appl. Logic 170, No. 10, 1162-1175.
  • Zbl 1458.11171   Koenigsmann, Jochen (2018); Decidability in local and global fields, in: Sirakov, Boyan (ed.) et al., Proceedings of the international congress of mathematicians, ICM 2018, Rio de Janeiro, Brazil, August 1--9, 2018. Volume II. Invited lectures. Hackensack, NJ: World Scientific; Rio de Janeiro: Sociedade Brasileira de Matem├ítica (SBM). 45-59.
  • Zbl 1446.03102   Kurahashi, Taishi (2018); On partial disjunction properties of theories containing Peano arithmetic, Arch. Math. Logic 57, No. 7-8, 953-980.
  • Zbl 1412.03019   Halava, Vesa; Harju, Tero; Sahla, Esa (2018); On fixed points of rational transductions, Theor. Comput. Sci. 732, 85-88.
  • Zbl 1426.03037   Li, Fu; Tzameret, Iddo; Wang, Zhengyu (2018); Characterizing propositional proofs as noncommutative formulas, SIAM J. Comput. 47, No. 4, 1424-1462.
  • Zbl 1426.03038   Kikuchi, Makoto; Kurahashi, Taishi (2017); Generalizations of Godel's incompleteness theorems for Sigma_n-definable theories of arithmetic, Rev. Symb. Log. 10, No. 4, 603-616.
  • Zbl 1404.03016   Freund, Max A. (2016); Predication and computable concepts, Log. Anal., Nouv. Ser. 59, No. 234, 133-155.
  • Zbl 1350.68173   Idziaszek, Tomasz; Skrzypczak, Michal; Bojanczyk, Mikolaj (2016); Regular languages of thin trees, Theory Comput. Syst. 58, No. 4, 614-663.
  • Zbl 1343.03045   Japaridze, Giorgi (2016); Introduction to clarithmetic. II, Inf. Comput. 247, 290-312.
  • Zbl 1339.03014   Kufleitner, Manfred; Walter, Tobias (2015); One quantifier alternation in first-order logic with modular predicates, RAIRO, Theor. Inform. Appl. 49, No. 1, 1-22.
  • Zbl 1319.68138   Maletti, Andreas (2015); Hyper-optimization for deterministic tree automata, Theor. Comput. Sci. 578, 72-87.
  • Zbl 1303.03089   Japaridze, Giorgi (2014); Introduction to clarithmetic. III, Ann. Pure Appl. Logic 165, No. 1, 241-252.
  • Zbl 1391.20003   Lohrey, Markus (2014); The compressed word problem for groups, SpringerBriefs in Mathematics. New York, NY: Springer (ISBN 978-1-4939-0747-2/pbk; 978-1-4939-0748-9/ebook). xii, 153 p.
  • Zbl 1270.03002   Smith, Peter (2013); An introduction to Godel's theorems Cambridge Introductions to Philosophy. Cambridge: Cambridge University Press (ISBN 978-1-107-60675-3/pbk; 978-1-107-02284-3/hbk). xvi, 388 p.
  • Zbl 1295.68121   Bova, Simone; Chen, Hubie; Valeriote, Matthew (2013); Generic expression hardness results for primitive positive formula comparison, Inf. Comput. 222, 108-120.
  • Zbl 1306.08004   Steinby, Magnus (2012); On the solidity of general varieties of tree languages, Discuss. Math., Gen. Algebra Appl. 32, 23-53.
  • Zbl 1301.03063   Fernandez-Duque, David; Joosten, Joost J. (2012); Kripke models of transfinite provability logic, in: Bolander, Thomas (ed.) et al., Advances in modal logic. Vol. 9. Proceedings of the 9th conference (AiML 2012), Copenhagen, Denmark, August 22--25, 2012. London: College Publications (ISBN 978-1-84890-068-4/pbk). 185-199
  • Zbl 1282.03023   Dantchev, Stefan; Martin, Barnaby (2012); Cutting planes and the parameter cutwidth, Theory Comput. Syst. 51, No. 1, 50-64.
  • Zbl 1260.08001   Esik, Z.; Kuich, W. (2012); Free iterative and iteration K-semialgebras,Algebra Univers. 67, No. 2, 141-162.
  • Zbl 1257.03088   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. Q. 58, No. 4-5, 307-316.
  • Zbl 1257.68006   Courcelle, Bruno; Engelfriet, Joost (2012); Graph structure and monadic second-order logic. A language-theoretic approach, Encyclopedia of Mathematics and its Applications 138. Cambridge: Cambridge University Press (ISBN 978-0-521-89833-1/hbk). xiv, 728 p.
  • Zbl 1244.68047   Fratani, Severine (2012); Regular sets over extended tree structures, Theor. Comput. Sci. 418, 48-70.
  • Zbl 1288.03003   Macintyre, Angus (2011); The impact of Godel's incompleteness theorems on mathematics, in: Baaz, Matthias (ed.) et al., Kurt Godel and the foundations of mathematics. Horizons of truth. Cambridge: Cambridge University Press (ISBN 978-0-521-76144-4/hbk). 3-25
  • Zbl 1291.03079   Morozov, A. S. (2011); On some representations of the real number field, Algebra Logic 50, No. 2, 189-190. Translation from Algebra Logika 50, No. 2, 270-271.
  • Zbl 1282.03024   Sereny, Gyorgy (2011); How do we know that the Godel sentence of a consistent theory is true?, Philos. Math. (3) 19, No. 1, 47-73.
  • Zbl 1262.03123   Visser, Albert (2011); Can we make the second incompleteness theorem coordinate free?, J. Log. Comput. 21, No. 4, 543-560.
  • Zbl 1257.03087   Jerabek, Emil (2011); A sorting network in bounded arithmetic, Ann. Pure Appl. Logic 162, No. 4, 341-355.
  • Zbl 1243.03075   Japaridze, Giorgi (2011); Introduction to clarithmetic. I, Inf. Comput. 209, No. 10, 1312-1354.
  • Zbl 1244.68046   Esik, Zoltan; Maletti, Andreas (2011); The category of simulations for weighted tree automata, Int. J. Found. Comput. Sci. 22, No. 8, 1845-1859.
  • Zbl 1231.03053   Kitada, Hitoshi (2011); Rebuttal to the review of my paper "An implication of Godel's incompleteness theorem" appeared in Zentralblatt fur Mathematik, Int. J. Pure Appl. Math. 70, No. 1, 11-14.
  • Zbl 1236.08014   Mucka, Anna (2011); Subdirectly irreducible fibered automata. II, Demonstr. Math. 44, No. 1, 1-15.
  • Zbl 1237.68117   Moura, Ana (2011); The word problem for omega-terms over DA, Theor. Comput. Sci. 412, No. 46, 6556-6569.
  • Zbl 1235.68106   Haubold, Niko; Lohrey, Markus (2011); Compressed word problems in HNN-extensions and amalgamated products, Theory Comput. Syst. 49, No. 2, 283-305.
  • Zbl 1235.11114   Utreras, Javier (2011); A logical approach to the problem of representation of integers by systems of diagonal forms, Bull. Lond. Math. Soc. 43, No. 2, 299-310.
  • Zbl 1227.68079   Hofner, Peter; Moller, Bernhard (2011); Fixing Zeno gaps, Theor. Comput. Sci. 412, No. 28, 3303-3322.
  • Zbl 1227.68041   Endrullis, Jorg; Grabmayer, Clemens; Klop, Jan Willem; van Oostrom, Vincent (2011); On equal mu-terms, Theor. Comput. Sci. 412, No. 28, 3175-3202.
  • Zbl 1220.68067   Fulop, Zoltan; Steinby, Magnus (2011); Varieties of recognizable tree series over fields, Theor. Comput. Sci. 412, No. 8-10, 736-752.
  • Zbl 1236.08015   Mucka, Anna (2010); Subdirectly irreducible fibered automata, Demonstr. Math. 43, No. 4, 739-753.
  • Zbl 1217.03045   Chubaryan, Anahit (2010); Rabin style speed-up of proofs. More generalized speed-up in the systems of first order logic Saarbrucken: LAP Lambert Academic Publishing (ISBN 978-3-8433-7255-8). 52 p.
  • Zbl 1205.03064   Hetzl, Stefan (2010); On the form of witness terms, Arch. Math. Logic 49, No. 5, 529-554.
  • Zbl 1201.03055   Japaridze, Giorgi (2010); Towards applied theories based on computability logic, J. Symb. Log. 75, No. 2, 565-601.
  • Zbl 1201.03050   Chen, Yijia; Flum, Jorg (2010); On the complexity of Godel's proof predicate, J. Symb. Log. 75, No. 1, 239-254.
  • Zbl 1191.03044   Willard, Dan E. (2009); Some specially formulated axiomizations for ISigma_0 manage to evade the Herbrandized version of the second incompleteness theorem, Inf. Comput. 207, No. 10, 1078-1093.
  • Zbl 1186.03072   Kitada, Hitoshi (2009); An implication of Godel's incompleteness theorem, Int. J. Pure Appl. Math. 52, No. 4, 511-567.
  • Zbl 1173.03043   Cavagnetto, Stefano (2009); String rewriting and proof complexity: an interpretation of resolution, Rep. Math. Logic 44, 167-200.
  • Zbl 1222.11147   Shlapentokh, Alexandra (2008); Elliptic curves retaining their rank in finite extensions and Hilbert's tenth problem for rings of algebraic numbers, Trans. Am. Math. Soc. 360, No. 7, 3541-3555.
  • Zbl 1170.03019   Bojanczyk, Mikolaj; Segoufin, Luc (2008); Tree languages defined in first-order logic with one quantifier alternation, in: Aceto, Luca (ed.) et al., Automata, languages and programming. 35th international colloquium, ICALP 2008, Reykjavik, Iceland, July 7--11, 2008. Proceedings, Part II. Berlin: Springer (ISBN 978-3-540-70582-6/pbk). Lecture Notes in Computer Science 5126, 233-245.
  • Zbl 1168.03044   Pudlak, Pavel (2008); Fragments of bounded arithmetic and the lengths of proofs, J. Symb. Log. 73, No. 4, 1389-1406.
  • Zbl 1170.03028   Japaridze, Giorgi (2008); Cirquent calculus deepened, J. Log. Comput. 18, No. 6, 983-1028.
  • Zbl 1153.11061   Cegielski, Patrick; Richard, Denis; Vsemirnov, Maxim (2007); On the additive theory of prime numbers, Fundam. Inform. 81, No. 1-3, 83-96.
  • Zbl 1154.03002   Smith, Peter (2008); An introduction to Godel's theorems, Cambridge Introductions to Philosophy. Cambridge: Cambridge University Press (ISBN 978-0-521-67453-9/pbk; 978-0-521-85784-0/hbk). xiv, 361 p.
  • Zbl 1150.03002   Friedman, Harvey M. (2008); Remarks on Godel phenomena and the field of reals, in: Ehrenfeucht, A. (ed.) et al., Andrzej Mostowski and foundational studies, Amsterdam: IOS Press (ISBN 978-1-58603-782-6/hbk). 68-71.
  • Zbl 1148.03037   Naumov, Pavel (2008); On meta complexity of propositional formulas and propositional proofs, Arch. Math. Logic 47, No. 1, 35-52.
  • Zbl 1144.03035   Schwichtenberg, Helmut (2008); Dialectica interpretation of well-founded induction, Math. Log. Q. 54, No. 3, 229-239.
  • Zbl 1146.03038   Restall, Greg (2008); Proofnets for S5: sequents and circuits for modal logic, in: Dimitracopoulos, Costas (ed.) et al., Logic colloquium 2005. Proceedings of the annual European summer meeting of the Association for Symbolic Logic (ASL), Athens, Greece, July 28--August 3, 2005. Cambridge: Cambridge University Press; Urbana, IL: Association for Symbolic Logic (ASL) (ISBN 978-0-521-88425-9/hbk). Lecture Notes in Logic 28, 151-172.
  • Zbl 1137.03032   Sirokofskich, A.; Dimitracopoulos, C. (2007); On a problem of J. Paris, J. Log. Comput. 17, No. 6, 1099-1107.
  • Zbl 1131.03030   Brunnler, Kai (2006); Locality for classical logic, Notre Dame J. Formal Logic 47, No. 4, 557-580.
  • Zbl 1107.08005   Denecke, K.; Glubudom, P. (2006); Generalized power Menger algebras and generalized non-deterministic hypersubstitutions, in: Dorfer, G. (ed.) et al., Proceedings of the 70th workshop on general algebra "70. Arbeitstagung Allgemeine Algebra", Vienna, Austria, May 26--29, 2005. Klagenfurt: Verlag Johannes Heyn (ISBN 3-7084-0194-8/pbk). Contributions to General Algebra 17, 61-70.
  • Zbl 1104.03012   Naumov, Pavel (2006); On modal logic of deductive closure, Ann. Pure Appl. Logic 141, No. 1-2, 218-224.
  • Zbl 1105.03057   Ciabattoni, Agata; Terui, Kazushige (2006); Towards a semantic characterization of cut-elimination, Stud. Log. 82, No. 1, 95-119.
  • Zbl 1103.08003   Petkovic, T.; Cirid, M.; Bogdanovic, S. (2006); On correspondences between unary algebras, automata, semigroups and congruences, Algebra Colloq. 13, No. 3, 495-506.
  • Zbl 1092.68060   Steinby, Magnus (2005); Algebraic classifications of regular tree languages, in: Kudryavtsev, Valery B. et al. (eds.), Structural theory of automata, semigroups, and universal algebra. Proceedings of the NATO Advanced Study Institute, Montreal, Quebec, Canada, July 7--18, 2003. Dordrecht: Kluwer Academic Publishers (ISBN 1-4020-3815-1/hbk; 1-4020-3817-8/e-book). NATO Science Series II: Mathematics, Physics and Chemistry 207, 381-432.
  • Zbl 1092.68057   Dassow, Jurgen (2005); Completeness of automaton mappings with respect to equivalence relations, in: Kudryavtsev, Valery B. et al. (eds.), Structural theory of automata, semigroups, and universal algebra. Proceedings of the NATO Advanced Study Institute, Montreal, Quebec, Canada, July 7--18, 2003. Dordrecht: Kluwer Academic Publishers (ISBN 1-4020-3815-1/hbk; 1-4020-3817-8/e-book). NATO Science Series II: Mathematics, Physics and Chemistry 207, 77-108.
  • Zbl 1086.03045   Negri, Sara (2005); Proof analysis in modal logic, J. Philos. Log. 34, No. 5-6, 507-544.
  • Zbl 1087.03037   Beklemishev, Lev D.; Visser, Albert (2005); On the limit existence principles in elementary arithmetic and Sigma_{n}^{0}-consequences of theories, Ann. Pure Appl. Logic 136, No. 1-2, 56-74.
  • Zbl 1084.03046   D'Aquino, Paola (2005); Weak fragments of Peano arithmetic, in: Cholak, Peter (ed.), The Notre Dame lectures. Wellesley, MA: A K Peters; Urbana, IL: Association for Symbolic Logic (ISBN 1-56881-249-3/hbk; 1-56881-250-7/pbk). Lecture Notes in Logic 18, 149-185.
  • Zbl 1060.03032   Crabbe, Marcel (2004); On the notion of substitution, Log. J. IGPL 12, No. 2, 111-124.
  • Zbl 1051.03050   Baillot, Patrick (2004); Stratified coherence spaces: A denotational semantics for light linear logic, Theor. Comput. Sci. 318, No. 1-2, 29-55.

Back

 

 

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); 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

 

 

Some Pictures and Mementos



Back