Saeed Salehi (Website) Information for Prospective Students (UG, MSc, PhD, PostDoc)

 

	Postdoctoral Scholars: I can work within any of the following areas if your research plans interest me. Artificial Intelligence and Logic (relations and applications). Artificial Intelligence and Mathematics (such as automated theorem proving). Mathematical Logic: completeness or incompleteness of theories. Theoretical Computer Science: computability theory or complexity. Philosophy of Mathematics (and philosophical logic). PhD Students: I can supervise PhD theses in the areas of my fields of expertise at Mathematical Logic: completeness, decidability, axiomatizability. Theoretical Computer Science: theory of computability or complexity theory. Philosophy of Mathematics: incompleteness phenomenon. The following are my past PhD graduates with the respective joint papers. Ziba Assadi (2019), Decidability of the Multiplicative and Order Theory of Numbers. On Decidability and Axiomatizability of Some Ordered Structures, Soft Computing 23:11 (2019) 3615–3626. (Full Text) Another (independent) joint paper: Gödelian Sentences, Rosserian Sentences and Truth, Journal of Logic and Computation 32:4 (2022) 729–740. (Full Text) Payam Seraji (2016), Rosserizing and Effectivizing Some Proofs of the First Incompleteness Theorem. On Constructivity and the Rosser Property: a closer look at some Gödelean proofs, Annals of Pure and Applied Logic 169:10 (2018) 971–980. (Full Text) Gödel–Rosser’s Incompleteness Theorem, generalized and optimized for definable theories, Journal of Logic and Computation 27:5 (2017) 1391–1397. (Full Text) Parvin Safari (2017), Investigating Kripke Semantics for Fuzzy Logics. Kripke Semantics for Fuzzy Logics, Soft Computing 22:3 (2018) 839–844. (Full Text) Mohammadsaleh Zarza (2019), Axiomatizations of Subfields of the Real Numbers. First-Order Continuous Induction and a Logical Study of Real Closed Fields, Bulletin of the Iranian Mathematical Society 46:1 (2020) 225–243. (Full Text) Ahmad Karimi (2014), Innovative Types in Unified Diagonal Argument. Diagonal Arguments and Fixed Points, Bulletin of the Iranian Mathematical Society 43:5 (2017) 1073–1088. (Full Text) I have the (rather old-style) habit of mentioning the following text in the joint papers that are mainly based on the PhD theses: This is a part of the Ph.D. thesis of [this/that author] written under the supervision of [me/supervisors] at [the place]. MSc Students: I can supervise MSc theses in the areas of my fields of expertise at Artificial Intelligence and Logic (relations and applications). Artificial Intelligence and Mathematics (such as automated theorem proving). Mathematical Logic: completeness, decidability, axiomatizability. Theoretical Computer Science: theory of computability or complexity theory. Philosophy of Mathematics (and philosophical logic). Undergraduate Students: I can supervise BSc theses in any of my research areas mentioned above. Here is a list of the courses that I have taught at Plaksha University: Introduction to Logic Some References: W. Ertel (2025, 3rd ed.), Introduction to Artificial Intelligence, Springer. U. Schöning (2008), Logic for Computer Scientists, Birkhäuser. Discrete Mathematics Some References: R.P. Grimaldi (2023 update, 5th ed.), Discrete and Combinatorial Mathematics: An Applied Introduction, Pearson. G. O'Regan (2021, 2nd ed.), Guide to Discrete Mathematics: An Accessible Introduction to the History, Theory, Logic and Applications, Springer. Theory of Computational Complexity Some References: S. Homer & A.L. Selman (2011, 2nd ed.), Computability and Complexity Theory, Springer. Dexter C. Kozen (2006), Theory of Computation, Springer.
www.SaeedSalehi.in