Saeed Salehi - Personal Website


		Saeed Salehi Personal Website

Home Publications Talks ⁄ Lectures Courses ⁄ Theses Miscellaneous

Date of Birth: 1976, January 15 (the day after the World Logic Day!).
University of Tabriz (since 2007). Associate Professor of Mathematics (since 2013).
- A Volunteer Member of the Scientific Committee of Tabriz Math House, Tabriz, Iran (since 2014).
- An Editor of the Journal of the Iranian Mathematical Society (2019–2025).
- An Elected Member of the Board of Directors of the Iranian Association for Logic (2019–2022).
- Researcher at the School of Mathematics, Institute for Research in Fundamental Sciences, IPM (2010–2020).

PhD in Theoretical Computer Science, from University of Turku (UTU), Turku, Finland (2005), under the supervision of (the late) Magnus Steinby.
- Title of Dissertation: Varieties of Tree Languages. (Study funds awarded by Turku Centre for Computer Science, TUCS).
PhD in Mathematical Logic, from Polish Academy of Sciences (PAN), Warsaw, Poland (2002), under the supervision of Zofia Adamowicz.
- Title of Dissertation: Herbrand Consistency in Arithmetics with Bounded Induction. (Study funds awarded by the Institute of Mathematics, IMPAN).
BSc in Pure Mathematics, from Sharif University of Technology, Tehran, Iran.
- Graduated with Distinction, and the First Rank in the National Mathematical Olympiad 1997.

Research Interests
- Mathematics
- Computer Science
- Philosophy

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

Home Publications Talks ⁄ Lectures Courses ⁄ Theses Miscellaneous

Journal Papers and Book Chapters (Refereed)

Saeed Salehi (2023), On Gödel’s “Much Weaker” Assumption, History and Philosophy of Logic (forthcoming). Preprint: arXiv:2209.07122.
Saeed Salehi (2023), A Reunion of Gödel, Tarski, Carnap, and Rosser, Journal of Logic and Computation (forthcoming). doi: 10.1093/logcom/exad001
Saeed Salehi (2022), Axiomatic (and Non-Axiomatic) Mathematics, Rocky Mountain Journal of Mathematics 52(4):1157–1176. doi: 10.1216/rmj.2022.52.1157
Ziba Assadi & Saeed Salehi (2022), Gödelian Sentences, Rosserian Sentences and Truth, Journal of Logic and Computation 32(4):729–740. doi: 10.1093/logcom/exab075
Saeed Salehi (2022), Tarski’s Undefinability Theorem and the Diagonal Lemma, Logic Journal of the IGPL 30(3):489–498. doi: 10.1093/jigpal/jzab016
Saeed Salehi (2022), ‘Sometime A Paradox’, Now Proof: Yablo Is Not First Order, Logic Journal of the IGPL 30(1):71–77. doi: 10.1093/jigpal/jzaa051
Kaave Lajevardi & Saeed Salehi (2021), There May Be Many Arithmetical Gödel Sentences, Philosophia Mathematica 29(2):278–287. doi: 10.1093/philmat/nkaa041
Saeed Salehi (2021), From Intuitionism to Many-Valued Logics Through Kripke Models, in: M. Mojtahedi & Sh. Rahman & M.S. Zarepour (eds.), Mathematics, Logic, and their Philosophies: Essays in Honour of Mohammad Ardeshir, Springer, pp. 339–348. doi: 10.1007/978-3-030-53654-1_11
Saeed Salehi (2020), Gödel’s Second Incompleteness Theorem: How It Is Derived and What It Delivers, The Bulletin of Symbolic Logic 26(3-4):241–256. doi: 10.1017/bsl.2020.22
Saeed Salehi (2020), On the Diagonal Lemma of Gödel and Carnap, The Bulletin of Symbolic Logic 26(1):80–88. doi: 10.1017/bsl.2019.58
Saeed Salehi (2020), On Rudimentarity, Primitive Recursivity and Representability, Reports on Mathematical Logic 55:73–85. doi: 10.4467/20842589RM.20.004.12436
Saeed Salehi & Mohammadsaleh Zarza (2020), First-Order Continuous Induction and a Logical Study of Real Closed Fields, Bulletin of the Iranian Mathematical Society 46(1):225–243. doi: 10.1007/s41980-019-00252-0
Kaave Lajevardi & Saeed Salehi (2019), On the Arithmetical Truth of Self-Referential Sentences, Theoria: A Swedish Journal of Philosophy 85(1):8–17. doi: 10.1111/theo.12169
Ziba Assadi & Saeed Salehi (2019), On Decidability and Axiomatizability of Some Ordered Structures, Soft Computing 23(11):3615–3626. doi: 10.1007/s00500-018-3247-1
Saeed Salehi & Payam Seraji (2018), On Constructivity and the Rosser Property: A Closer Look at Some Gödelean Proofs, Annals of Pure and Applied Logic 169(10):971–980. doi: 10.1016/j.apal.2018.04.009
Saeed Salehi (2018), On Axiomatizability of the Multiplicative Theory of Numbers, Fundamenta Informaticae 159(3):279–296. doi: 10.3233/FI-2018-1665
Parvin Safari & Saeed Salehi (2018), Kripke Semantics for Fuzzy Logics, Soft Computing 22(3):839–844. doi: 10.1007/s00500-016-2387-4
Saeed Salehi & Payam Seraji (2017), Gödel–Rosser’s Incompleteness Theorem, generalized and optimized for definable theories, Journal of Logic and Computation 27(5):1391–1397. doi: 10.1093/logcom/exw025
Ahmad Karimi & Saeed Salehi (2017), Diagonal Arguments and Fixed Points, Bulletin of the Iranian Mathematical Society 43(5):1073–1088.
Saeed Salehi (2014), Gödel’s Incompleteness Phenomenon—Computationally, Philosophia Scientiae 18(3):23–37. doi: 10.4000/philosophiascientiae.968
Saeed Salehi (2013), Herbrand Consistency of Some Finite Fragments of Bounded Arithmetical Theories, Archive for Mathematical Logic 52(3-4):317–333. doi: 10.1007/s00153-012-0318-3
Saeed Salehi (2012), Herbrand Consistency of Some Arithmetical Theories, The Journal of Symbolic Logic 22(3):807–827. doi: 10.2178/jsl/1344862163
Saeed Salehi (2012), Separating Bounded Arithmetical Theories by Herbrand Consistency, Journal of Logic and Computation 77(3):545–560. doi: 10.1093/logcom/exr005
Saeed Salehi & Magnus Steinby (2007), Varieties of Many-Sorted Recognizable Sets, Pure Mathematics and Applications 18(3-4):319–343.
Saeed Salehi & Magnus Steinby (2007), Tree Algebras and Varieties of Tree Languages, Theoretical Computer Science 377(1-3):1–24. doi: 10.1016/j.tcs.2007.02.006
Tatjana T. Petković & Saeed Salehi (2005), Positive Varieties of Tree Languages, Theoretical Computer Science 347(1):1–35. doi: 10.1016/j.tcs.2005.07.026
Saeed Salehi (2005), Varieties of Tree Languages Definable by Syntactic Monoids, Acta Cybernetica 17(1):21–41.
Saeed Salehi (2005), Congruence Preserving Functions of Wilke’s Tree Algebras, Algebra Universalis 53(4):451–470. doi: 10.1007/s00012-005-1912-6
Saeed Salehi (2005), Polynomially Bounded Recursive Realizability, Notre Dame Journal of Formal Logic 46(4):407–417. doi: 10.1305/ndjfl/1134397659
Saeed Salehi (2003), Provably Total Functions of Basic Arithmetic, Mathematical Logic Quarterly 49(3):316–322. doi: 10.1002/malq.200310032
Mohammad Ardeshir & Wim Ruitenburg & Saeed Salehi (2003), Intuitionistic Axiomatizations for Bounded Extension Kripke Models, Annals of Pure and Applied Logic 124(1-3):267–285. doi: 10.1016/S0168-0072(03)00058-7
Saeed Salehi (2002), Decidable Formulas of Intuitionistic Primitive Recursive Arithmetic, Reports on Mathematical Logic 36:55–61.

Conference Papers (Short refereed)

Saeed Salehi (2012), Axiomatizing Mathematical Theories: Multiplication, in: A. Kamali-Nejad (ed.), Proceedings of Frontiers in Mathematical Sciences, Fundamental Education Publications (Iran), pp. 165–176.
Saeed Salehi (2012), Computation in Logic and Logic in Computation, in: B. Sadeghi-Bigham (ed.), Proceedings of the 3rd International Conference on Contemporary Issues in Computer and Information Sciences, Brown Walker Press (USA), pp. 580–583.
Saeed Salehi (2003), A Completeness Property of Wilke’s Tree Algebras, in: B. Rovan & P. Vojtáš (eds.), Proceedings of the Mathematical Foundations of Computer Science (MFCS’03), LNCS 2747, Springer, pp. 662–670. doi: 10.1007/978-3-540-45138-9_60
Saeed Salehi (2001), Unprovability of Herbrand Consistency in Weak Arithmetics, in: K. Striegnitz (ed.), Proceedings of the (6th) Student Session of the (13th) European Summer School in Logic, Language and Information, pp. 265–274.

Manuscripts (Not refereed)

Saeed Salehi (2023), Proving Concurrency by Loci, SSRN (Social Science Research Network – Geometry eJournal): 4451055.
Kaave Lajevardi & Saeed Salehi (2023), On a Certain Fallacy Concerning I-am-unprovable Sentences, PhilPapers (Online Research in Philosophy): LAJOAC.
Saeed Salehi (2015), Theorems of Tarski’s Undefinability and Gödel’s Second Incompleteness—Computationally, arXiv (e-Print archive): 1509.00164.
Ahmad Karimi & Saeed Salehi (2014), Theoremizing Yablo’s Paradox, arXiv (e-Print archive): 1406.0134.

Reviews for Zentralblatt MATH (zbMATH).

Reviews for Mathematical Reviews (MathSciNet).

Publications in Persian

Parvin Safari & Saeed Salehi (2019), Truth Values and Connectives in Some Non-Classical Logics, Journal of New Researches in Mathematics 5(19):31–36.
Saeed Salehi (2010), Logical Number Theory, Newsletter of the Iranian Mathematical Society 32(3-4):16.

Home Publications Talks ⁄ Lectures Courses ⁄ Theses Miscellaneous

Invited (a selection)

International Workshop on Gödel’s Incompleteness Theorems [online] (Wuhan’21), Wuhan University, Wuhan, China, 16–20 August 2021. (Poster of the Workshop).
- Title: Some Fairies in the Incompleteness Wonderland.
Celebrating 90 Years of Gödel’s Incompleteness Theorems [online and on-site] (Tübingen’21), Carl Friedrich von Weizsäcker Center, Tübingen, Germany, 5–9 July 2021.
- Title: The Diagonalization Lemma—Demystified Hopefully.
Workshop on Proof Theory, Modal Logic and Reflection Principles (Wormshop’17), Steklov Mathematical Institute, Moscow, Russia, 17–20 October 2017.
- Title: Diagonal-Free Proofs of the Diagonal Lemma.
Meta-Arithmetical Results and their Philosophical Meaning (Swamplandia’16), Faculty of Arts and Philosophy, Ghent University, Ghent, Belgium, 30 May–1 June 2016. (CFP in the FOM mailing list).
- Title (Tutorial): Gödel’s Incompleteness Theorem: Constructivity of its Various Proofs.
- Title (Talk): Theoremizing Paradoxes: Turning Puzzles into Proofs.
The 3rd Annual Conference of the Iranian Association for Logic (IAL’15), Tarbiat Modares University (& IAL), Tehran, Iran, 22–23 December 2015. (Poster of the conference).
- Title: Logic and Computation: A Constructive Look at Proofs of Gödel’s Incompleteness Theorem.
The 10th International Tbilisi Summer School in Logic and Language (Tbilisi’14), Ivane Javakhishvili Tbilisi State University, Tbilisi, Georgia, 22–27 September 2014.
- Title (Tutorial): Axiomatic Mathematics: Issues of Decidability in Logic.
The 3rd International Conference on Contemporary Issues in Computer and Information Sciences (CICIS’12), the Institute for Advanced Studies in Basic Sciences, Zanjan, Iran, 29–31 May 2012.
- Title: Computation in Logic and Logic in Computation.
Foundations and Trends in Computer Science (FTCS’08), Winter School by IPM School of Computer Science and United Nations University, IPM, Tehran, Iran, 31 January–10 February 2008.
- Title (Tutorial): Logics in Computer Science.
IPM Logic Conference (IPM-LC’07), IPM, Tehran, Iran, 10–15 June 2007.
- Title: Modal Logic of Herbrand Consistency in Weak Arithmetics.
Algebraic Theory of Automata and Logic (ATAL’06), a satellite event of the conference Computer Science Logic (CSL’06), Szeged, Hungary, 30 September–1 October 2006.
- Title: Characterizing Families of Tree Languages by Syntactic Monoids.

Contributed (a selection)

The 5th World Congress and School on Universal Logic (UniLog’15), University of Istanbul, Istanbul, Turkey, 20–30 June 2015.
- Title: Theorems of Tarski and Gödel’s Second Incompleteness—Computationally.
Frontiers in Mathematical Sciences—The Second Conference (Front’13), Sharif University of Technology, Tehran, Iran, 25–27 December 2013.
- Title: Diagonalizing Out by Fixed-Points and Self-Reference.
Frontiers in Mathematical Sciences—A Conference in Honor of Siavash Shahshahani (Front’12), Sharif University of Technology, Tehran, Iran, 25–27 December 2012.
- Title: Axiomatizing Mathematical Theories: Multiplication.
The 14th Congress of Logic, Methodology and Philosophy of Science (CLMPS’11), Nancy, France, 19–26 July 2011.
- Title: Gödel’s Incompleteness Phenomenon from Computational Viewpoint.
The ASL European Summer Meeting, Logic Colloquium (LC’11), Barcelona, Spain, 11–16 July 2011.
- Title: On Herbrand Consistency of Bounded Arithmetics.
The International Workshop on Logical Approaches to Barriers in Computing and Complexity (LABCC’10), Alfried Krupp Wissenschaftskolleg, Greifswald, Germany, 17–20 February 2010. [On a travel grant].
- Title: Herbrand Consistency of IΔ₀ and IΔ₀+Ω₁.
The Fourth European Congress of Mathematics (4ECM), Stockholm, Sweden, 27 June–2 July 2004. [On a travel grant].
- Title: A Model-Theoretic Proof of an Incompleteness Theorem (poster).
The 28th International Symposium on Mathematical Foundations of Computer Science (MFCS’03), Bratislava, Slovakia, 25–29 August 2003.
- Title: A Completeness Property of Wilke’s Tree Algebras.
The 10th International Conference on Automata and Formal Languages (AFL’02), Debrecen, Hungary, 13–18 August 2002.
- Title: Tree Algebras (Extended Abstract).
The (6th) Student Session of the (13th) European Summer School in Logic, Language and Information (ESSLLI’01), Helsinki, Finland, 13–24 August 2001. [On a travel grant].
- Title: Unprovability of Herbrand Consistency in Weak Arithmetics.
The ASL European Summer Meeting, Logic Colloquium (LC’01), Vienna, Austria, 6–11 August 2001. [On an ASL Student Travel Grant].
- Title: Unprovability of Herbrand Consistency in Weak Arithmetics.
The ASL European Summer Meeting, Logic Colloquium (LC’00), Paris, France, 23–31 July 2000. [On an ASL Student Travel Grant].
- Title: A Generalized Realizability for Constructive Arithmetics.
The ASL European Summer Meeting, Logic Colloquium (LC’99), Utrecht, The Netherlands, 1–6 August 1999. [On an ASL Student Travel Grant].
- Title: Intuitionistic Axiomatization of End-Extension Kripke Models.

Home Publications Talks ⁄ Lectures Courses ⁄ Theses Miscellaneous

Taught Courses (a selection)

Postgraduate Courses [Click on ► for some references.]

Advanced Computability Theor

Some References:

M. Sipser (2013, 3rd ed.), Introduction to the Theory of Computation, Cengage Learning.
J. Shallit (2008), A Second Course in Formal Languages and Automata Theory, Cambridge University Press.
M. Davis & R. Sigal & E. Weyuker (1994, 2nd ed.), Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science, Morgan Kaufmann.

Complexity Theory

Some References:

D-Z. Du & K-I. Ko (2014, 2nd ed.), Theory of Computational Complexity, Wiley.
S. Homer & A.L. Selman (2011, 2nd ed.), Computability and Complexity Theory, Springer.
Ch. Papadimitriou (1993), Computational Complexity, Pearson.

Logical Number Theory

Some References:

P. Hájek & P. Pudlák (1993), Metamathematics of First-Order Arithmetic, Springer.
R. Kaye (1991), Models of Peano Arithmetic, Oxford University Press.
C. Smoryński (1991), Logical Number Theory I: An Introduction, Springer.

Logic and Computation

Some References:

M. Ben-Ari (2012, 3rd ed.), Mathematical Logic for Computer Science, Springer.
G. Dowek (2011), Proofs and Algorithms: An Introduction to Logic and Computability, Springer.
G.S. Boolos & J.P. Burgess & R.C. Jeffrey (2007, 5th ed.), Computability and Logic, Cambridge University Press.

Recursion Theory

Some References:

H.B. Enderton (2010), Computability Theory: An Introduction to Recursion Theory, Academic Press.
R.L. Epstein & W.A. Carnielli (2008, 3rd ed.), Computability: Computable Functions, Logic, and the Foundations of Mathematics, Advanced Reasoning Forum.
S.B. Cooper (2003), Computability Theory, Chapman and Hall / CRC.

Proof Theory

Some References:

G. Takeuti (2013, 2nd ed.), Proof Theory, Dover Publications.
S. Negri & J. von Plato (2008), Structural Proof Theory, Cambridge University Press.
A.S. Troelstra & H. Schwichtenberg (2000, 2nd ed.), Basic Proof Theory, Cambridge University Press.

Modal Logic

Some References:

A. Chagrov & M. Zakharyaschev (1997), Modal Logic, Clarendon Press.
M.J. Cresswell & G.E. Hughes (1996), A New Introduction to Modal Logic, Routledge.
B.F. Chellas (1980), Modal Logic: An Introduction, Cambridge University Press.

Advanced Mathematical Logic

Some References:

H.B. Enderton (2001, 2nd ed.), A Mathematical Introduction to Logic, Academic Press.
Z. Adamowicz & P. Zbierski (1997), Logic of Mathematics: A Modern Course of Classical Logic, Wiley.
G. Kreisel & J.L. Krivine (1967), Elements of Mathematical Logic (Model Theory), North-Holland.
- (A PDF file of the whole book is available at the webpage of Jean-Louis Krivine).

Universal Algebra

Some References:

K. Denecke & Sh.L. Wismath (2002), Universal Algebra and Applications in Theoretical Computer Science, Chapman and Hall / CRC.
S. Burris & H.P. Sankappanavar (1981), A Course in Universal Algebra, Springer.
G. Grätzer (1979, 2nd ed.), Universal Algebra, Springer.

Undergraduate Courses [Click on ► for some references.]

Foundations of Mathematics

Some References:

D. Rosenthal & D. Rosenthal & P. Rosenthal (2018, 2nd ed.), A Readable Introduction to Real Mathematics, Springer.
I. Stewart & D. Tall (2015, 2nd ed.), The Foundations of Mathematics, Oxford University Press.

Mathematical Logic

Some References:

U. Schöning (2008), Logic for Computer Scientists, Birkhäuser.
I. Chiswell & W. Hodges (2007), Mathematical Logic, Oxford University Press.

Set Theory

Some References:

K. Devlin (1993, 2nd ed.), The Joy of Sets: Fundamentals of Contemporary Set Theory, Springer.
H. Enderton (1977), Elements of Set Theory, Academic Press.

Discrete Mathematics

Some References:

R.P. Grimaldi (2018, 5th ed.), Discrete and Combinatorial Mathematics: An Applied Introduction, Pearson.
V.K. Balakrishnan (1991), Introductory Discrete Mathematics, Prentice-Hall.

Number Theory

Some References:

D.M. Burton (2010, 7th ed.), Elementary Number Theory, McGraw-Hill.
J. Stillwell (2003), Elements of Number Theory, Springer.

Theory of Automata and Formal Languages

Some References:

J. Hromkovič (2010), Theoretical Computer Science: Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography, Springer.
J. Hopcroft & R. Motwani & J. Ullman (2006, 3rd ed.), Introduction to Automata Theory, Languages, and Computation, Pearson.

English as Lingua Franca for Mathematic

Some References:

U. Daepp & P. Gorkin (2011, 2nd ed.), Reading, Writing, and Proving: A Closer Look at Mathematics, Springer.
G.R. Exner (1996), An Accompaniment to Higher Mathematics, Springer.

Calculus

Some References:

S. Shahshahani (2017, 2nd ed.), Calculus, Fatemi (in Persian).
- (Siavash Shahshahani is the author of An Introductory Course on Differentiable Manifolds, Dover Publications, 2016).
M. Spivak (2008, 4th ed.), Calculus, Publish or Perish.

Supervised PhD Theses

Department of Mathematics, University of Tabriz, Tabriz, Iran (in Persian):

M. Zarza (2019), Axiomatizations of Subfields of the Real Numbers.
Z. Assadi (2019), Decidability of the Multiplicative and Order Theory of Numbers.
P. Safari (2017), Investigating Kripke Semantics for Fuzzy Logics.
P. Seraji (2016), Rosserizing and Effectivizing Some Proofs of the First Incompleteness Theorem.

Department of Mathematics, Tarbiat Modares University, Tehran, Iran (in Persian):

A. Karimi (2014), Innovative Types in Unified Diagonal Argument.

Supervised MSc Theses

Department of Mathematics, University of Tabriz, Tabriz, Iran (in Persian):

E. Rokni (2018), Bounded Relations and their Relation to Primitive Recursive Relations.
Y. Nobakht (2017), Necessary and Sufficient Conditions for Undecidability of the Gödel Sentence and its Truth.
Sh. Khaleghi (2017), Standard Proofs for Gödel’s Second Incompleteness Theorem.
M. A. Tareeghee (2016), Yablo’s Paradox in Second-Order Logic.
V. Delaramoghanloo (2015), Yablo’s Paradox and Gödel’s Incompleteness Theorems.
S. Ghanizadeh (2015), Kolmogorov Complexity and Characteristic Constants of Formal Theories of Arithmetic.
S. Sarvarimehrabad (2015), On Proofs of the Incompleteness Theorems Based on Berry’s Paradox.
M. Sahahi (2015), The Incompleteness Theorems of Gödel and Rosser.
H. Shirzadeh (2014), The Shortest Definition of a Number in Peano Arithmetic.
P. Ghaemi (2014), The Surprise Examination Paradox and the Second Incompleteness Theorem.
Sh. Sadeghibigham (2014), Undecidability of First-Order Logic.
M. Mohammadian (2013), Incompleteness in a General Setting.
S. Esmati (2012), Nonstandard Models that are Definable in Peano Arithmetic.
F. Azarpeyvand (2012), Heterologicality and Incompleteness.
N. Jangibahador (2012), An Interpolation Theorem in First-Order Logic.
M. Abedini (2010), A Universal Approach to Self-Referential Paradoxes, Incompleteness and Fixed Points.

Department of Mathematics, Institute for Advanced Studies in Basic Sciences, Zanjan, Iran (in Persian):

F. Elmi (2010), A Study of Algebraic Structures By Logical Tools.

Home Publications Talks ⁄ Lectures Courses ⁄ Theses Miscellaneous

Honors (a selection)
- Distinguished Reviewer (Certificate and Letter) of Zentralblatt MATH (2014).
- The first rank in the national Mathematical Olympiad of University Students (in both of the 1st and the 2nd/final rounds), Iran (1997).
- The first ranked graduate of Mathematics from Sharif University of Technology, Tehran, Iran (1997).

Grant Acquisition (external funding) as Principal Investigator (a selection)
- Researcher (Grantee) at the Institute for Research in Fundamental Sciences (IPM), Tehran, Iran:
- Research Grant awarded by the National Elites Foundation (BMN), Iran (2008-2009).
- Research Grants from Iran National Science Foundation (INSF):
- Research Grants awarded by University of Tabriz (UoT), Tabriz, Iran:

Organizing Conferences (a selection)
- A Member of the Scientific Committee of the 10th Annual Conference of the Iranian Association for Logic, Amirkabir University of Technology (Tehran Polytechnic), Tehran, Iran, 22–23 February 2023.
- A Member of the Scientific Committee of the 6th Annual Conference of the Iranian Association for Logic, Shahid Beheshti University, Tehran, Iran, 21–22 January 2019.
- A Member of the Scientific Committee of the 5th Annual Conference of the Iranian Association for Logic, Amirkabir University of Technology (Tehran Polytechnic), Tehran, Iran, 22–25 November 2017.
- Chair of Tabriz Seminar on Mathematical Logic, University of Tabriz, Iran, 27–28 October 2010.
- A member of the Scientific Committee of the 38th Annual Iranian Mathematics Conference (AIMC’38), Zanjan University, Zanjan, Iran, 3–6 September 2007.

Referee
- The Journal of Symbolic Logic (JSL of the Association for Symbolic Logic).
- Annals of Pure and Applied Logic (APAL of Elsevier).
- Journal of Logic and Computation (JLC of the Oxford University Press).
- Theoretical Computer Science (TCS of Elsevier).
- The Review of Symbolic Logic (RSL of the Association for Symbolic Logic).
- Philosophia Mathematica (PhilMath of the Oxford University Press).
- Logic Journal of the Interest Group in Pure and Applied Logics (IGPL of the Oxford University Press).
- ACM Transactions on Computational Logic (TOCL of the Association for Computing Machinery).
- International Journal of Foundations of Computer Science (IJFCS of the World Scientific).
- Bulletin of the Iranian Mathematical Society (BIMS of Springer).
- Journal of Logic, Language and Information (JLLI of Springer).
- Discussiones Mathematicae—General Algebra and Applications (DMGAA of the University of Zielona Góra).
- Notre Dame Journal of Formal Logic (NDJFL of the University of Notre Dame).
- (Proceedings of the) Conferences: (i) WoLLIC 2017, (ii) AFL’11, (iii) ICALP’04.
- Iran National Science Foundation (INSF).
- Iranian Journal of Mathematical Sciences and Informatics (IJMSI of Tarbiat Modares University).
- Mathematical Culture and Thought (MCT of the Iranian Mathematical Society, in Persian).

Internet Links
- Google Scholar: xI4on2oAAAAJ.
- Semantic Scholar: 1468709567.
- ORCiD: 0000-0001-6961-5749.
- Mathematics Genealogy: 93048.
- MathSciNet: 714784.
- zbMATH: 10864.
- DBLP: pid/95/520.
- arXiv: salehi_s_1.
- PublOns: Y-3287-2019.
- Scopus: 9277111900.
- ResearchGate: Saeed-Salehi-2.
- Academia: SaeedSalehi.
- PhilPapers: Saeed Salehi.
- exaly: 93861.

Appendix (Some More Information, Pictures, Videos, and Mementos).

www.SaeedSalehi.ir

Saeed Salehi Personal Website

Saeed Salehi

Personal Website