LOGO

سعيد صالحي پور مهر


وبسايت اينترنتي

Saeed_Salehi  
 
 
متفرقه
  
پژوهشي و اجرائي
  
تدريس و راهنمائي
   کارنامه علمي  
صفحه اصلي
  
 
  
فايل pdf رزومه (به زبان فارسي)   

تحصيلات و مدارج

جوايز و افتخارات
  • رتبه اول رياضي المپياد علمي دانشجويان کشور 1376 (در هر دو مرحله اول و نهايي).
  • فارغ التحصيل ممتاز رياضي (از دانشگاه صنعتي شريف، تهران) 1376.
  • يکي از دانشجويان ممتاز رياضي دانشگاه صنعتي شريف، تهران 1375.

داوري و نقد مقالات
  • داوري مقالات براي:
  • نقد مقالات براي:
    • Mathematical Reviews (MR) of American Mathematical Society (AMS) - MathSciNet.
    • Zentralblatt MATH (Zbl) of European Mathematical Society (EMS).

    • Reviews for MR-MathSciNet:
      • Moser, Georg: The Hydra battle and Cichon's principle, Appl. Algebra Engrg. Comm. Comput. 20 (2009), no. 2, 133--158; MR2511883.
      • Fülöp, Zoltán; Muzamel, Loránd: Circularity, composition, and decomposition results for pebble macro tree transducers, J. Autom. Lang. Comb. 13 (2008), no. 1, 3–44; MR2467434.
      • Ganea, Mihai: Arithmetic on semigroups, J. Symbolic Logic 74 (2009), no. 1, 265--278; MR2499430.
      • Dershowitz, Nachum; Moser,Georg: The hydra battle revisited, Rewriting computation and proof, 1–27, Lecture Notes in Comput. Sci., 4600, Springer, Berlin, 2007; MR2392300.
      • Carlström, Jesper: A constructive version of Birkhoff’s theorem, Math. Log. Q. 54 (2008), no. 1, 27–34; MR2387393.
      • Ésik, Zoltán; Iván, Szabolcs: Some varieties of finite tree automata related to restricted temporal logics, Fund. Inform. 82 (2008), no. 1-2, 79–103; MR2372751.
      • Ésik, Zoltán; Iván, Szabolcs: Products of tree automata with an application to temporal logic, Fund. Inform. 82 (2008), no. 1-2, 61–78; MR2372750.
      • Maletti, Andreas: Pure and o-substitution, Internat. J. Found. Comput. Sci. 18 (2007), no. 4, 829–845; MR2341386.
      • Gyurica, György: On monotone languages and their characterization by regular expressions, Acta Cybernet. 18 (2007), no. 1, 117–134; MR2332718.
      • Mućka, Anna: The lattice of varieties of fibered automata, Discuss. Math. Gen. Algebra Appl. 27 (2007), no. 1, 87–107; MR2319335.
      • Petković, Tatjana: Regular tree languages and quasi orders, Acta Cybernet. 17 (2006), no. 4, 811–823; MR2278078.
      • Kearnes, Keith A.: Congruence lattices of locally finite algebras, Algebra Universalis 54 (2005), no. 2, 237–248; MR2217638.
      • Ésik, Z.: An algebraic characterization of temporal logics on finite trees III, Proceedings of the 1st International Conference on Algebraic Informatics, 101–110, Aristotle Univ. Thessaloniki, Thessaloniki, 2005; MR2186457.
      • Ésik, Z.: An algebraic characterization of temporal logics on finite trees II, Proceedings of the 1st International Conference on Algebraic Informatics, 79–99, Aristotle Univ. Thessaloniki, Thessaloniki, 2005; MR2186456.
      • Ésik, Z.: An algebraic characterization of temporal logics on finite trees I, Proceedings of the 1st International Conference on Algebraic Informatics, 53–77, Aristotle Univ. Thessaloniki, Thessaloniki, 2005; MR2186455.
      • Ésik, Zoltán; Weil, Pascal: Algebraic recognizability of regular tree languages, Theoret. Comput. Sci. 340 (2005), no. 2, 291–321; MR2150756.
      • Fülöp, Zoltán; Vogler, Heiko: Weighted tree transducers, J. Autom. Lang. Comb. 9 (2004), no. 1, 31–54; MR2073242.
      • Hill, Patricia M.; Zaffanella, Enea; Bagnara, Roberto: 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 (2004), no. 3, 289–323; MR2053122.
      • Moniri, Morteza: Intuitionistic weak arithmetic, Arch.Math. Logic 42 (2003), no. 8, 791–796; MR2020045.

    • Reviews for Zentralblatt MATH:
      • Kitada, Hitoshi: An implication of Gödel's incompleteness theorem, Int. J. Pure Appl. Math. 52, No. 4, 511-567 (2009); Zbl pre05575645.
      • Cavagnetto, Stefano: String rewriting and proof complexity: an interpretation of resolution, Rep. Math. Logic 44, 167-200 (2009); Zbl 1173.03043.
      • Bojańczyk, Mikołaj; Segoufin, Luc: Tree languages defined in first-order logic with one quantifier alternation, 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. Lecture Notes in Computer Science 5126, 233-245 (2008); Zbl 1170.03019.
      • Japaridze, Giorgi: Cirquent calculus deepened, J. Log. Comput. 18, No. 6, 983-1028 (2008); Zbl 1170.03028.
      • Pudlák, Pavel: Fragments of bounded arithmetic and the lengths of proofs, J. Symb. Log. 73, No. 4, 1389-1406 (2008); Zbl 1168.03044.
      • [Book] Smith, Peter: An introduction to Gödel’s theorems. Reprint with corrections of the 2007 original. (English) Cambridge Introductions to Philosophy. Cambridge: Cambridge University Press. xiv, 361 p. (2008). ISBN 978-0-521-67453-9/pbk; ISBN 978-0-521-85784-0/hbk; Zbl 1154.03002.
      • Cégielski, Patrick; Richard, Denis; Vsemirnov, Maxim: On the additive theory of prime numbers, Fundam. Inform. 81, No. 1-3, 83-96 (2007); Zbl 1153.11061.
      • Friedman, Harvey M.: Remarks on G¨odel phenomena and the field of reals, Ehrenfeucht, A. (ed.) et al., Andrzej Mostowski and foundational studies, Amsterdam: IOS Press. 68-71 (2008); Zbl 1150.03002.
      • Naumov, Pavel: On meta complexity of propositional formulas and propositional proofs, Arch. Math. Logic 47, No. 1, 35-52 (2008); Zbl 1148.03037.
      • Restall, Greg: Proofnets for S5: sequents and circuits for modal logic, 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), Lecture Notes in Logic 28, 151-172 (2008); Zbl 1146.03038.
      • Schwichtenberg, Helmut: Dialectica interpretation of well-founded induction, Math. Log. Q. 54, No. 3, 229-239 (2008); Zbl 1144.03035.
      • Sirokofskich, A.; Dimitracopoulos, C.: On a problem of J. Paris, J. Log. Comput. 17, No. 6, 1099-1107 (2007); Zbl 1137.03032.
      • Brünnler, Kai: Locality for classical logic, Notre Dame J. Formal Logic 47, No. 4, 557-580 (2006); Zbl 1131.03030.
      • Denecke, K.; Glubudom, P.: Generalized power Menger algebras and generalized non-deterministic hypersubstitutions, 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, Contributions to General Algebra 17, 61-70 (2006); Zbl 1107.08005.
      • Ciabattoni, Agata; Terui, Kazushige: Towards a semantic characterization of cut-elimination, Stud. Log. 82, No. 1, 95-119 (2006); Zbl 1105.03057.
      • Naumov, Pavel: On modal logic of deductive closure, Ann. Pure Appl. Logic 141, No. 1-2, 218-224 (2006); Zbl 1104.03012.
      • Petković, T.; Ćirić, M.; Bogdanović, S.: On correspondences between unary algebras, automata, semigroups and congruences, Algebra Colloq. 13, No. 3, 495-506 (2006); Zbl 1103.08003.
      • Steinby, Magnus: Algebraic classifications of regular tree languages, Kudryavtsev, Valery B. et al., 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. NATO Science Series II: Mathematics, Physics and Chemistry 207, 381-432 (2005); Zbl 1092.68060.
      • Dassow, Jürgen: Completeness of automaton mappings with respect to equivalence relations, Kudryavtsev, Valery B. et al., Structural theory of automata, semigroups, and universal algebra. Proceedings of the NATO Advanced Study Institute, Montreal, Quebec, Canada, July 7–18, 2003; Zbl 1092.68057.
      • Beklemishev, Lev D.; Visser, Albert: On the limit existence principles in elementary arithmetic and \Sigma^0_n-consequences of theories, Ann. Pure Appl. Logic 136, No. 1-2, 56-74 (2005); Zbl 1087.03037.
      • Negri, Sara: Proof analysis in modal logic, J. Philos. Log. 34, No. 5-6, 507-544 (2005); Zbl 1086.03045.
      • D’Aquino, Paola: Weak fragments of Peano arithmetic, Cholak, Peter (ed.), The Notre Dame lectures. Wellesley, MA: A K Peters; Urbana, IL: Association for Symbolic Logic. Lecture Notes in Logic 18, 149-185 (2005); Zbl 1084.03046.
      • Crabbé, Marcel: On the notion of substitution, Log. J. IGPL 12, No. 2, 111-124 (2004); Zbl 1060.03032.
      • Zbl 1051.03050 Baillot, Patrick: Stratified coherence spaces: A denotational semantics for light linear logic, Theor. Comput. Sci. 318, No. 1-2, 29-55 (2004); Zbl 1051.03050.

همايشها و بازديدها
  • برگزاري:
    • عضو کميته علمي سي و هشتمين کنفرانس رياضي (سالانه) کشور (AIMC'38)، دانشگاه زنجان، زنجان 12-15 شهريور 1386
      (مسئول کميته "منطق رياضي و علوم نظري کامپيوتر").
  • سخنران مدعو:
    • In Foundations and Trends in Computer Science (FTCS'08), winter school by IPM School of Computer Science and United Nations Univesity, IPM, Tehran, Iran, January 31 - February 10, 2008.
      • Title: Logics in Computer Science (Abstract).
    • In IPM Logic Conference (IPM-LC'07), IPM, Tehran, Iran, June 10 - 15, 2007.
      • Title: Modal Logic of Herbrand Consistency in Weak Arithmetics (Abstract).
    • In Algebraic Theory of Automata and Logic (ATAL'06), a workshop organized by Z. E'sik, H. Straubing, P. Weil and Th. Wilke, as a satellite event of the conference Computer Science Logic 2006 (CSL'06), Szeged, Hungary, September 30 - October 1, 2006.
  • سخنرانيهاي ارائه شده:
    • In the International Workshop on Logical Approaches to Barriers in Computing and Complexity (LogApp2010), Greifswald, Germany, February 17 - 20, 2010.
    • In the 38th Annual Iranian Mathematics Conference (AIMC'38), Zanjan Univeristy, Zanjan, Iran, September 3 - 6, 2007.
      • Title: Modal Logic of Herbrand Consistency in Weak Arithmetics (Extended Abstract).
    • In the 28th International Symposium on Mathematical Foundations of Computer Science, (MFCS'03), Hotel Sorea, Bratislava, Slovakia, August 25 - 29, 2003.
    • In the 10th International Conference on Automata and Formal Languages (AFL'02), Hotel Aranybika, Debrecen, Hungary, August 13 - 18, 2002.
    • In the Student Session of the 13th European Summer School in Logic, Language and Information (ESSLLI'01), Helsinki, Finland, August 13 - 24, 2001.
      • Title: Unprovability of Herbrand Consistency in Weak Arithmetics.
      • Paper in the Proceedings of the student session of the ESSLLI'01, pp. 265-274.
    • In the ASL European Summer Meeting, Logic Colloquium'2001 (LC'01), Vienna, Austria, August 6 - 11, 2001.
      • Title: Unprovability of Herbrand Consistency in Weak Arithmetics.
      • Abstract in The Bulletin of Symbolic Logic, Vol. 8, No. 1, March 2002, p. 156.
    • In the ASL European Summer Meeting, Logic Colloquium'2000 (LC'00), Paris, France, July 23 - 31, 2000.
      • Title: A Generalized Realizability for Constructive Arithmetics.
      • Abstract in The Bulletin of Symbolic Logic, Vol. 7, No. 1, March 2001, pp. 147-148.
    • In the ASL European Summer Meeting, Logic Colloquium'99 (LC'99), Utrecht, The Netherlands, August 1 - 6, 1999.
      • Title: Intuitionistic Axiomatization of End-Extension Kripke Models.
      • Abstract in The Bulletin of Symbolic Logic, Vol. 6, No. 1, March 2000, p. 125.
  • پوستر:
    • In the Fourth European Congress of Mathematics (4ECM), Stockholm, Sweden, June 27 - July 2, 2004.
  • شرکت در مدرسه تابستاني:
    • Summer School and Workshop on "Proof Theory, Computation and Complexity", Technische Universität Dresden, Germany, June 23 - July 4, 2003.
      • Photo with Professor Roy Dyckhoff and Ms. Ge Chen.
    • Summer School on "Structural Theory of Automata, Semigroups and Universal Algebra", NATO Advanced Study Institute, Seminaire de Mathematiques Superieures, Departement de Mathematiques et de Statistique, Universite de Montreal, Canada, July 7 - 18, 2003.
      • Photo of the participants.
  • بازديد پسا دکتري:

    • مقالات و کتابها
    • مقالات داوري شده در مجلات:
      • Saeed Salehi & Magnus Steinby, Varieties of Many-Sorted Recognizable Sets,
        in Pure Mathematics and Applications, Vol. 18, No. 3-4 (2007) pages 319 - 343.
      • Saeed Salehi & Magnus Steinby, Tree Algebras and Varieties of Tree Languages,
        in Theoretical Computer Science, Vol. 377, No. 1-3 (2007) pages 1 - 24.
      • Tatjana Petković & Saeed Salehi, Positive Varieties of Tree Languages,
        in Theoretical Computer Science, Vol. 347, No. 1 (2005) pages 1 - 35.
      • Saeed Salehi, Polynomially Bounded Recursive Realizability,
        in Notre Dame Journal of Formal Logic, Vol. 46, No. 4 (2005) pages 407 - 417.
      • Saeed Salehi, Congruence Preserving Functions of Wilke's Tree Algebras,
        in Algebra Universalis, Vol. 53, No. 4 (2005) pages 451 - 470.
      • Saeed Salehi, Varieties of Tree Languages Definable by Syntactic Monoids,
        in Acta Cybernetica, Vol. 17, No. 1 (2005) pages 21 - 41.
      • Saeed Salehi, Provably Total Functions of Basic Arithmetic,
        in Mathematical Logic Quarterly, Vol. 49, No. 3 (2003) pages 316 - 322.
      • Mohammad Ardeshir & Wim Ruitenburg & Saeed Salehi, Intuitionistic Axiomatizations for Bounded Extension Kripke Models, in Annals of Pure and Applied Logic, Vol. 124, No. 1-3, (2003) pages 267 - 285.
      • Saeed Salehi, Decidable Formulas of Intuitionistic Primitive Recursive Arithmetic,
        in Reports on Mathematical Logic, No. 36 (2002) pages 55 - 61.
    • مقالات داوري شده در کنفرانسها:
      • Saeed Salehi, A Completeness Property of Wilke's Tree Algebras,
        in Proceedings of the MFCS 2003, LNCS 2747, Springer-Verlag (2003) pages 662 - 670.
    • مقالات کنفرانس داوري نشده:
      • Saeed Salehi, Unprovability of Herbrand Consistency in Weak Arithmetics,
        in Proceedings of the sixth ESSLLI Student Session (2001) pages 265 - 274.
    • پايان-نامه ها:
      • Saeed Salehi, Varieties of Tree Languages, Ph.D. Dissertation,
        Department of Mathematics, University of Turku, TUCS Dissertations 64, Turku, Finland, 2005.
        ISBN 952-12-1576-3 (128+iv pages).
      • Saeed Salehi, Herbrand Consistency in Arithmetics with Bounded Induction,
        Ph.D. Dissertation, Institute of Mathematics, Polish Academy of Sciences, Warsaw, Poland, 2002.
      • Saeed Salehi, Decidable Formulas of Intuitionistic Primitive Recursive Arithmetic,
        M.Sc. Thesis, the School of Exact Sciences in Warsaw, Poland, 2001.
    • کتابها:
      • Saeed Salehi, A Structural Theory for Varieties of Tree Languages: An Algebraic Study of the Theory of Formal Tree Languages and Tree Automata, VDM Verlag, 2010.
        ISBN 978-3-639-23055-0 (151+iv pages).

    		 
    http://saeedsalehi.ir/
    آخرين ويرايش: خرداد 1389 © صاحب حقوق و امتياز: سعيد صالحي پور مهر