A problem course in mathematical logic : is a freeware mathematics text
β Scribed by Stefan Bilaniuk
- Publisher
- Dept. of Mathematics Trent University
- Year
- 1994
- Tongue
- English
- Leaves
- 167
- Category
- Library
No coin nor oath required. For personal study only.
β¦ Subjects
ΠΠ°ΡΠ΅ΠΌΠ°ΡΠΈΠΊΠ°;ΠΠ°ΡΠ΅ΠΌΠ°ΡΠΈΡΠ΅ΡΠΊΠ°Ρ Π»ΠΎΠ³ΠΈΠΊΠ°;
π SIMILAR VOLUMES
This is a text for a problem-oriented undergraduate course in mathematical logic. It covers the basics of propositionaland first-order logic through the Soundness, Completeness, and Compactness Theorems. Volume II, Computation, covers the basics of computability using Turing machines and recursive f
This is the Volume II of a text for a problem-oriented undergraduate course in mathematical logic. It covers the basics of computability, using Turing machines and recursive functions, and Goedel's Incompleteness Theorem, and could be used for a one semester course on these topics. Volume I, Proposi
Department of Mathematics Trent University, 1991, -186 pp.<div class="bb-sep"></div>This is a text for a problem-oriented undergraduate course in mathematical logic. It covers the basics of propositional and first-order logic through the Soundness, Completeness, and Compactness Theorems. <br/>Volume