Mathematical Logic for Computer Science; M. Ben-Ari; 2001

Mathematical Logic for Computer Science Upplaga 2

av M. Ben-Ari
This is a mathematics textbook with theorems and proofs. The choice of topics has been guided by the needs of computer science students. The method of semantic tableaux provides an elegant way to teach logic that is both theoretically sound and yet sufficiently elementary for undergraduates. In order to provide a balanced treatment of logic, tableaux are related to deductive proof systems. The book presents various logical systems and contains exercises. Still further, Prolog source code is available on an accompanying Web site. The author is an Associate Professor at the Department of Science Teaching, Weizmann Institute of Science.
This is a mathematics textbook with theorems and proofs. The choice of topics has been guided by the needs of computer science students. The method of semantic tableaux provides an elegant way to teach logic that is both theoretically sound and yet sufficiently elementary for undergraduates. In order to provide a balanced treatment of logic, tableaux are related to deductive proof systems. The book presents various logical systems and contains exercises. Still further, Prolog source code is available on an accompanying Web site. The author is an Associate Professor at the Department of Science Teaching, Weizmann Institute of Science.
Upplaga: 2a upplagan
Utgiven: 2001
ISBN: 9781852333195
Förlag: Springer Nature
Format: Häftad
Språk: Engelska
Sidor: 318 st
This is a mathematics textbook with theorems and proofs. The choice of topics has been guided by the needs of computer science students. The method of semantic tableaux provides an elegant way to teach logic that is both theoretically sound and yet sufficiently elementary for undergraduates. In order to provide a balanced treatment of logic, tableaux are related to deductive proof systems. The book presents various logical systems and contains exercises. Still further, Prolog source code is available on an accompanying Web site. The author is an Associate Professor at the Department of Science Teaching, Weizmann Institute of Science.
This is a mathematics textbook with theorems and proofs. The choice of topics has been guided by the needs of computer science students. The method of semantic tableaux provides an elegant way to teach logic that is both theoretically sound and yet sufficiently elementary for undergraduates. In order to provide a balanced treatment of logic, tableaux are related to deductive proof systems. The book presents various logical systems and contains exercises. Still further, Prolog source code is available on an accompanying Web site. The author is an Associate Professor at the Department of Science Teaching, Weizmann Institute of Science.
Begagnad bok (0 st)

Om Mathematical Logic for Computer Science (2001)

I april 2001 släpptes boken Mathematical Logic for Computer Science skriven av M. Ben-Ari. Det är den 2a upplagan av kursboken. Den är skriven på engelska och består av 318 sidor djupgående information om övrigt. Förlaget bakom boken är Springer Nature.

Köp boken Mathematical Logic for Computer Science direkt från en annan student på Studentapan och spara pengar.

KurslitteraturÖvrigtÖvrigtMathematical Logic for Computer Science
Bokens omdömen
Ingen har recenserat den här boken ännu.

Sälj vidare boken när du är klar

När du är klar med boken säljer du enkelt vidare och tjänar pengar på nolltid med Studentapan. Vi tar hand om allt det krångliga så att du får mer tid över till annat. På det sättet kan du tjäna tillbaka det mesta av kostnaden för boken.
Värdera & sälj böcker

Klimatsmart kurslitteratur

Bli en miljöhjälte under din studietid och ge dina gamla kursböcker ett nytt liv. Genom att återanvända dina kursböcker minskar du utsläppen av koldioxid (CO2) med hela 59%. För en psykologstudent skulle det innebära minskade CO2-utsläpp med cirka 240 kg under studietiden. En stor vinst för din plånbok och miljön. Det kallar vi klimatsmart kurslitteratur.

Liknande kurslitteratur

Begagnad bok (0 st)