| Record ID | marc_columbia/Columbia-extract-20221130-007.mrc:202904604:3405 |
| Source | marc_columbia |
| Download Link | /show-records/marc_columbia/Columbia-extract-20221130-007.mrc:202904604:3405?format=raw |
LEADER: 03405mam a22003614a 4500
001 3174837
005 20221020001934.0
008 011010t20022002maua b 001 0 eng
010 $a 2001052551
020 $a0817642498 (alk. paper)
020 $a3764342498 (alk. paper)
035 $a(OCoLC)ocm48177389
035 $9AUB6988CU
035 $a3174837
040 $aDLC$cDLC$dOrLoB-B
042 $apcc
050 00 $aQA9$b.N53 2002
082 00 $a511.3$221
100 1 $aNievergelt, Yves.$0http://id.loc.gov/authorities/names/n88602050
245 10 $aFoundations of logic and mathematics :$bapplications to computer science and cryptography /$cYves Nievergelt.
260 $aBoston :$bBirkhäuser,$c[2002], ©2002.
300 $axvi, 415 pages :$billustrations ;$c26 cm
336 $atext$btxt$2rdacontent
337 $aunmediated$bn$2rdamedia
504 $aIncludes bibliographical references (p. [399]-404) and index.
505 00 $gA.$tTheory.$tBoolean Algebraic Logic.$tLogical Formulae.$tLogical Truth and Connectives.$tTautologies and Contradictions.$tOther Methods of Proof.$tSynthesis of Logical Formulae.$tOther Connectives and Applications.$tSynthesis by Karnaugh Tables.$tAn Application to Circuits.$tProjects.$tLogic and Deductive Reasoning.$tPropositional Calculus.$tClassical Implicational Calculus.$tProofs by Contraposition.$tOther Connectives.$tOther Forms of Deductive Reasoning.$tPredicate Calculus.$tInference with Quantifiers.$tFurther Issues in Logic.$tProjects.$tSet Theory.$tSets and Subsets.$tPairing, Power, and Separation.$tUnions and Intersections of Sets.$tCartesian Products and Relations.$tMathematical Functions.$tComposite and Inverse Functions.$tEquivalence Relations.$tOrdering Relations.$tProjects.$tInduction, Recursion, Arithmetic, Cardinality.$tMathematical Induction.$tArithmetic with Natural Numbers.$tOrders and Cancellations.$tIntegers.$tRational Numbers.$tFinite Cardinality.$tInfinite Cardinality.
505 80 $tArithmetic in Finance.$tProjects.$tDecidability and Completeness.$tLogics for Scientific Reasoning.$tIncompleteness.$tLogics Not Amenable to Truth Tables.$tAutomated Theorem Proving.$tTransfinite Methods.$tTransitive Sets and Ordinals.$tRegularity of Well-Formed Sets.$tFurther Issues in Decidability.$tProjects --$gB.$tApplications.$tNumber Theory and Codes.$tThe Euclidean Algorithm.$tDigital Expansion and Arithmetic.$tPrime Numbers.$tModular Arithmetic.$tModular Codes.$tEuclid, Euler, & Fermat's Theorems.$tRivest-Shamir-Adleman (RSA) Codes.$tFurther Issues in Number Theory.$tProjects.$tCiphers, Combinatorics, and Probabilities.$tAlgebra.$tPermutations.$tCyclic Permutations.$tSignatures of Permutations.$tArrangements.$tCombinations.$tProbability.$tThe ENIGMA Machines.$tProjects.$tGraph Theory.$tMathematical Graphs.$tPath-Connected Graphs.$tEuler and Hamiltonian Circuits.$tMathematical Trees.$tWeighted Graphs and Multigraphs.$tBipartite Graphs and Matchings.$tGraph Theory in Science.
505 80 $tFurther Issues: Planar Graphs.$tProjects.
650 0 $aLogic, Symbolic and mathematical.$0http://id.loc.gov/authorities/subjects/sh85078115
650 0 $aSet theory.$0http://id.loc.gov/authorities/subjects/sh85120387
650 0 $aNumber theory.$0http://id.loc.gov/authorities/subjects/sh85093222
650 0 $aComputer science$xMathematics.$0http://id.loc.gov/authorities/subjects/sh85042295
852 00 $boff,eng$hQA9$i.N53 2002