My Teaching Schedule for Spring 2010
| Weekdays |
8 — 10 |
10 — 12 |
12—14 |
14 — 16 |
16 — 18 |
| Saturday |
|
|
Lunch |
|
|
| Sunday |
Calculus I |
|
Lunch |
|
Calculus I |
| Monday |
Set Theory |
Calculus I* / Seminar* |
Lunch |
English for Math. |
|
| Tuesday |
|
|
Lunch |
Th. Computation |
|
| Wednesday |
Calculus I* |
Set Theory* |
Lunch |
|
Th. Computation* |
+ advanced (M.Sc. & Ph.D. level) course
* biweekly (once every two weeks [fortnightly])
Calculus
♦ Siavash Shahshahani,
Calculus, Fatemi Publishers, 2nd ed. 2009 (Farsi).
Foundations of Mathematics
♦ Ian Stewart & David Tall,
The Foundations of Mathematics,
Oxford University Press 1977.
◊
Farsi Translation by M.M. Ebrahimi.
♦ Solomon Feferman,
The Number Systems: Foundations of Algebra and Analysis,
Addison-Wesley 1964, reprinted 1989; AMS Chelsea Publishing 2003.
English for Mathematics
♦ Ulrich Daepp & Pamela Gorkin,
Reading, Writing, and Proving: A Closer Look at Mathematics,
Springer-Verlag 2003.
Set Theory
♦ 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.
Mathematical Logic
♦ Mohammad Ardeshir,
Mathematical Logic,
Hermes 2005 (Farsi).
♦ Ian Chiswell & Wilfrid Hodges,
Mathematical Logic, Oxford University Press 2007.
Logic for Computer Science
♦ Uwem Schöning,
Logic for Computer Scientists, Birkhäuser 1989, 2008.
Number Theory
♦ John Stillwell,
Elements of Number Theory, Springer-Verlag 2003.
◊
Farsi Translation by M. Mirzavaziri.
♦ David M. Burton,
Elementary Number Theory, McGraw-Hill, 6th ed. 2005.
◊ Farsi Translation by M.S. Montakhab.
Theory of Computation
♦ John E. Hopcroft & Rajeev Motwani & Jeffrey D. Ullman,
Introduction to Automata Theory, Languages, and Computation,
Addison-Wesley 3rd ed. 2006.
Automata & Formal Languages
♦ Arindama Singh,
Elements of Computation Theory,
Springer-Verlag 2009.
Philosophy of Mathematics
♦ Stewart Shapiro,
Thinking About Mathematics: The Philosophy Of Mathematics,
Oxford University Press 2000.
♦ Mohammad S. Moslehian,
Philosophy of Mathematics: Classic, Modern, and Post-Modern,
Vazhegane Kherad 2005 (Farsi).
♦ Michele Friend,
Introducing Philosophy of Mathematics,
Acumen Publishing 2007.
Foundations of Geometry
♦ Marvin Jay Greenberg,
Euclidean and Non-Euclidean Geometries: Development and History,
W. H. Freeman 3rd ed. 1993.
◊
Farsi Translation by M.H. Shafi'iha.
♦ Gerard A. Venema,
Foundations of Geometry ,
Prentice Hall 2005.
(webpage of the book).
Mathematical Writing
♦ 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.
Foundations of Computer Science
♦ Juraj Hromkovic,
Theoretical Computer Science: Introduction to Automata, Computability, Complexity,
Algorithmics, Randomization, Communication, and Cryptography
,
Springer-Verlag 2004.
Logic & Computation
♦ 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.
Proof Theory
♦ Sara Negri & Jan von Plato,
Structural Proof Theory,
Cambridge University Press 2001.
♦ Wolfram Pohlers,
Proof Theory: The First Step into Impredicativity,
Springer-Verlag 2009.
Recursion Theory
♦ Nigel Cutland,
Computability: An Introduction to Recursive Function Theory,
Cambridge University Press 1980-1997.
♦ S. Barry Cooper,
Computability Theory,
Chapman Hall/CRC 2003.
Modal Logic
♦ 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.
Constructive & Intuitioinistic Mathematics
♦ A. S. Troelstra & D. Van Dalen,
Constructivism in Mathematics,
North-Holland 1988.
♦ Grigori Mints,
A Short Introduction to Intuitionistic Logic,
Springer-Verlag 2001.
Logical Number Theory
♦ 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.
Computability Theory
♦ Herbert B. Enderton,
Computability Theory,
Unfinished Book (as of 2009).
Complexity Theory
♦ Steven Homer & Alan L. Selman,
Computability and Complexity Theory,
Springer-Verlag 2001.
Universal Algebra
♦ Klaus Denecke & Shelly L. Wismath,
Universal Algebra and Applications in Theoretical Computer Science,
Chapman & Hall / CRC 2002.
Algebraic Theory of Computer Science
♦ 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).
Topics in Logic
♦ 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.
|