Sets, logic, computation : an open text / remixed by Richard Zach ; contributors, Samara Burns, Dana Hagg.
Material type:
TextPublisher: Richard Zach, Distributor: BCcampus, BC Open Textbook Project Description: 1 online resource (xviii, 360 pages) colour illustrationsSubject(s): Logic -- TextbooksGenre/Form: Electronic books.LOC classification: BC71 | .S48 2017ebOnline resources: BC Open Textbook Project title homepage. | BC Open Textbook Project. Summary: "This textbook is based on the Open Logic Project. It covers naive set theory, first-order logic, sequent calculus and natural deduction, the completeness, compactness, and Löwenheim-Skolem theorems, Turing machines, and the undecidability of the halting problem and of first-order logic"--BCcampus website.
| Item type | Current library | Call number | URL | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|---|
eBook
|
Digital Library
Resources in this library are accessible in digital format e.g. eBooks or eJournals accessible online. |
BC71 .S48 2017eb (Browse shelf(Opens below)) | Link to resource | Available |
Browsing Digital Library shelves, Shelving location: Online Access Close shelf browser (Hides shelf browser)
| No cover image available | No cover image available | No cover image available | No cover image available | No cover image available |
|
No cover image available | ||
| BC71 M34 2012 forall x : | BC71 .M342 2018eb forall x Calgary remix : | BC71 .M342 2019eb forall x, Calgary : | BC71 .S48 2017eb Sets, logic, computation : | BC71 .V36 2016eb Introduction to logic and critical thinking / | BC108 .D45 2017eb A concise introduction to logic / | BC177 G68 2018eb Problems in argument analysis and evaluation / |
This work is licensed under the Creative Commons Attribution-NonCommercial-ShareAlike License.
This bibliographic record is available under the Creative Commons CC0 "No Rights Reserved" license.
"This textbook is based on the Open Logic Project. It covers naive set theory, first-order logic, sequent calculus and natural deduction, the completeness, compactness, and Löwenheim-Skolem theorems, Turing machines, and the undecidability of the halting problem and of first-order logic"--BCcampus website.
Description based on online resource; title from pdf title page (viewed on April 11, 2019).
There are no comments on this title.