Computing and Software 701
Logic and Discrete Mathematics In Software Engineering
Fall 2002
Instructor:
William M. Farmer
Student Contributions
Ping Tan:
Linear Order
Bo (Tyler) Xie:
Schroeder-Bernstein 1
Schroeder-Bernstein 2
Schroeder-Bernstein 3
Lei Lai:
Function Composition
Xia-Yong (Jason) Hu:
Ordinal Properties
Xiaoyang Yu:
Transitive Closure
Joe Fakhri:
Universal Turing Machine
Fatima Issawi:
Unlimited Register Machines
Zhuomei Wu:
Quotient Structure
Pengcheng Dai:
Dense Linear Orders
Huidong (Dennis) Tian:
Prenex Normal Form Theorem
Pengcheng Dai:
Well Orders in STT
Lei Lai:
Theory of Rings and Theory of Fields
Shahram Siavash:
Compactness Theorem of First-Order Logic
Joe Fakhri:
The Theory of a Complete Ordered Field
Ping Tan:
The Hilbert Choice Operator and Quantifications
Keith Mackay:
Primitive Recursive Definition of the Exponential Function on N
Fatima Issawi:
Semantic Tableaux for Propositional Logic
Bo (Tyler) Xie:
Theory for Stacks in BESTT
Zhuomei Wu:
Natural Deduction Systems
Millie de Guzman:
Recursion via Monotone Functionals
Shahram Siavash:
Monoid Homomorphisms, Formalized in BESTT
Wei Gao:
Formalizing the Theory of Groups
Xiayon (Jason) Hu:
Formalizing the Theory of Boolean Algebra
Dawn MacIsaac:
Cantor's Paradox
Dawn MacIsaac:
The Fibonacci Sequence: An Example of Well-Founded Recursion
Jun Wu:
Theory of Lattices in FOL
Keith Mackay:
Base Negative Two
Kevin Everets:
STT and the ML Programming Language
Kevin Everets:
Terms and Formulas of PFOL as Strings