- Academic Remediation: Accommodations, Adjustments and Modifications Senate Executive Committee Bulletin #6 (Revised January 8, 2009)
- The last word on Leibniz? 1. ``8.12'', again
- Notes on a (very) Elementary Set Theory---Part II
- A Programming Formalism for PR George Tourlakis
- A Programming Formalism for PR # George Tourlakis
- Why mathematicians need not lose sleep over automatic theorem provers
- Post's Theorem and other Tools A note on notation and a few ``reminders'': The silly symbol ``'' + goes
- Arithmetisation Normal Form Theorems
- A mini "Logic Toolbox" Here I list some tools/facts from old M1090 classes I taught, which you can use
- Notes on a (very) Elementary Set Theory---Part IV
- A userfriendly Introduction to Computability
- Notes on a (very) Elementary Set Theory---Part V
- Fundamenta Informaticae 34 (2001) 1--9 1 Computability in type2 objects with wellbehaved type1
- A user-friendly Introduction to Computability
- 1. Godel's first incompleteness theorem We o#er here a nave presentation of Godel's first incompleteness theorem that
- A modal extension of first order classical logic George Tourlakis
- Fundamenta Informaticae XX (2001) 19 1 Computability in type-2 objects with well-behaved type-1 oracles is
- 0.1. Notes on Arithmetic Peano Arithmetic is a formal theory, kind of "applied logic", that talks about
- 1. Godel's first incompleteness theorem We offer here a naive presentation of Godel's first incompleteness theorem that
- Notes on a (very) Elementary Set Theory--Part II
- Notes on a (very) Elementary Set Theory--Part IV
- Notes on a (very) Elementary Set Theory--Part V
- MATH 2090 Problem Set #2 (Sample Solutions) October 2003 York University
- Why mathematicians need not lose sleep over automatic theorem provers
- 1. Definitions of acceptance 1.1 Definition. (PDA) A pushdown automaton or PDA, M, is essentially an
- A mini ``Logic Toolbox'' Here I list some tools/facts from old M1090 classes I taught, which you can use
- 1. Definitions of acceptance 1.1 Definition. (PDA) A pushdown automaton or PDA, M , is essentially an
- MATH1090: Facts-List for the December 2005 Examination York University
- Academic Remediation: Accommodations, Adjustments and Modifications Senate Executive Committee Bulletin #6 (Revised and Expanded December 18)
- Notes on a (very) Elementary Set Theory---Part III
- A userfriendly Introduction to Computability
- Chapter III Normal Form Theorem
- Ackermann's Function George Tourlakis
- MATH 2090 Problem Set #2 (Sample Solutions) October 2003 York University
- Notes on a (very) Elementary Set Theory--Part III
- Notes on a (very) Elementary Set Theory--Part I
- 0.1. Notes on Arithmetic Peano Arithmetic is a formal theory, kind of "applied logic", that talks ab*
- Notes on a (very) Elementary Set Theory_Part II
- Chapter III Normal Form Theorem
- A user-friendly Introduction to Computability
- 0.1. Notes on Arithmetic Peano Arithmetic is a formal theory, kind of ``applied logic'', that talks about
- Notes on a (very) Elementary Set Theory_Part I
- Why mathematicians need not lose sleep over automatic theorem provers
- 1. Definitions of acceptance 1.1 Definition. (PDA)A pushdown automaton or PDA, M, is essentially an
- MATH_2090______Problem_Set_#2_(Sample_Solutions)October_2003_ York University
- 1. G"odel's first incompleteness theorem We offer here a na"ive presentation of G"odel's first incompleteness theorem th*
- Chapter III APPENDIX
- A Programming Formalism for P R * George Tourlakis
- Notes on a (very) Elementary Set Theory---Part I
- The last word on Leibniz? 1. "8.12", again
- A user-friendly Introduction to Computability
- ______________________A_mini_"Logic_Toolbox"____________________ Facts-List
- A user-friendly Introduction to Computability
- A Weak Post's Theorem and the Deduction
- A user-friendly Introduction to
- York University Faculty of Science and Engineering