سعيد صالحي پور مهر
وبسايت اينترنتي
متفرقه
پژوهشي و اجرائي
کارنامه علمي
صفحه اصلي
|
برنامه هفتگي من براي بهار 1389
* يک هفته در ميان رياضي عمومي♦ سياوش شهشهاني، حساب ديفرانسيل و انتگرال، انتشارات فاطمي، ويراست دوم 1388.
مباني رياضيات
♦ Ian Stewart & David Tall,
The Foundations of Mathematics,
Oxford University Press 1977.
◊
ترجمه فارسي توسط محمد مهدي ابراهيمي.
♦ Solomon Feferman,
The Number Systems: Foundations of Algebra and Analysis,
Addison-Wesley 1964, reprinted 1989; AMS Chelsea Publishing 2003.
زبان تخصصي رياضي (انگليسي)
♦ Ulrich Daepp & Pamela Gorkin,
Reading, Writing, and Proving: A Closer Look at Mathematics,
Springer-Verlag 2003.
نظريه مجموعه ها
♦ Herbert B. Enderton,
Elements of Set Theory ,
Academic Press 1977.
♦ Keith Devlin, The Joy of Sets: Fundamentals of Contemporary Set Theory, Springer-Verlag 2nd ed. 1994.
منطق رياضي
♦ Mohammad Ardeshir,
Mathematical Logic,
Hermes 2005 (Farsi).
♦ Ian Chiswell & Wilfrid Hodges, Mathematical Logic, Oxford University Press 2007.
منطق علوم کامپيوتر
♦ Uwem Schöning,
Logic for Computer Scientists, Birkhäuser 1989, 2008.
نظريه اعداد
♦ John Stillwell,
Elements of Number Theory, Springer-Verlag 2003. ◊ ترجمه فارسي توسط مجيد ميرزاوزيري.
♦ David M. Burton,
Elementary Number Theory, McGraw-Hill, 6th ed. 2005. ◊ ترجمه فارسي توسط محمد صادق منتخب.
نظريه محاسبه
♦ John E. Hopcroft & Rajeev Motwani & Jeffrey D. Ullman,
Introduction to Automata Theory, Languages, and Computation,
Addison-Wesley 3rd ed. 2006.
نظريه زبانها و ماشينها
♦ Arindama Singh,
Elements of Computation Theory,
Springer-Verlag 2009.
فلسفه رياضي
♦ Stewart Shapiro,
Thinking About Mathematics: The Philosophy Of Mathematics,
Oxford University Press 2000.
♦ محمد صال مصلحيان، فلسفه رياضي: کلاسيک، مدرن، پست مدرن، واژگان خرد 1384.
♦ Michele Friend,
Introducing Philosophy of Mathematics,
Acumen Publishing 2007.
مباني هندسه ♦ Marvin Jay Greenberg,
Euclidean and Non-Euclidean Geometries: Development and History,
W. H. Freeman 3rd ed. 1993.
◊ ترجمه فارسي توسط محمد هادي شفيعيها.
♦ Gerard A. Venema,
Foundations of Geometry ,
Prentice Hall 2005.
(webpage of the book).
رياضي نويسي♦ Steven G. Krantz,
A Primer of Mathematical Writing,
AMS 1997.
♦ Steven G. Krantz, Mathematical Publishing: A Guidebook, AMS 2005. ♦ X∃Persian, in CTAN and WikiPedia. نظريه علوم کامپيوتر♦ Juraj Hromkovic,
Theoretical Computer Science: Introduction to Automata, Computability, Complexity,
Algorithmics, Randomization, Communication, and Cryptography
,
Springer-Verlag 2004.
منطق و محاسبه♦ George S. Boolos & John P. Burgess & Richard C. Jeffrey,
Computability and Logic,
Cambridge University Press, 5th ed. 2007.
♦ Richard L. Epstein & Walter A. Carnielli, Computability: Computable Functions, Logic, and the Foundations of Mathematics, Advanced Reasoning Forum 2008.
نظريه برهان♦ Sara Negri & Jan von Plato,
Structural Proof Theory,
Cambridge University Press 2001.
♦ Wolfram Pohlers, Proof Theory: The First Step into Impredicativity, Springer-Verlag 2009. نظريه بازگشتي♦ Nigel Cutland,
Computability: An Introduction to Recursive Function Theory,
Cambridge University Press 1980-1997.
♦ S. Barry Cooper, Computability Theory, Chapman Hall/CRC 2003. منطق موجهات♦ Brian F. Chellas,
Modal Logic: An Introduction,
Cambridge University Press 1980-1995.
♦ Patrick Blackburn & Maarten de Rijke & Yde Venema, Modal Logic, Cambridge University Press 2002. رياضيات ساختني و شهودي♦ A. S. Troelstra & D. Van Dalen,
Constructivism in Mathematics
(
Volume 1 ),
(
Volume 2 ),
North-Holland 1988.
♦ Grigori Mints, A Short Introduction to Intuitionistic Logic, Springer-Verlag 2001. نظريه منطقي اعداد♦ Craig Smorynski,
Logical Number Theory I: An Introduction,
Springer-Verlag 1991.
♦ Petr Hajek & Pavel Pudlak, Metamathematics of First-Order Arithmetic, Springer-Verlag 1992. ♦ Richard Kaye, Models of Peano Arithmetic, Oxford University Press 1991. ♦ Roman Kossak & James Schmerl, The Structure of Models of Peano Arithmetic, Oxford University Press 2006. نظريه محاسبات پيشرفته♦ Herbert B. Enderton,
Computability Theory,
Unfinished Book (as of 2009).
نظريه پيچيدگي محاسبه♦ Steven Homer & Alan L. Selman,
Computability and Complexity Theory,
Springer-Verlag 2001.
جبر جامع (جهاني)♦ Klaus Denecke & Shelly L. Wismath,
Universal Algebra and Applications in Theoretical Computer Science,
Chapman & Hall / CRC 2002.
نظريه جبري علوم کامپيوتر♦ W.M.L. Holcombe,
Algebraic Automata Theory,
Cambridge University Press 1982.
♦ H. Comon & M. Dauchet & R. Gilleron & F. Jacquemard & D. Lugiez & Ch. Löding & S. Tison & M. Tommasi, Tree Automata Techniques and Applications, A Web Book Under Construction (Last Version: 2007). مباحثي در منطق♦ Raymond M. Smullyan,
Gödel's Incompleteness Theorems,
Oxford University Press 1992.
♦ Peter Smith, An Introduction to Gödel's Theorems, Cambridge University Press 2007.
|