L\u00f3gica Proposicional: Sintaxe e Sem\u00e2ntica. \u00c1lgebra de Boole. Portas L\u00f3gicas. Circuitos L\u00f3gicos.<\/p>\n
BIBLIOGRAFIA B\u00c1SICA<\/b>
\nNUNES DE SOUZA, J.\u00a0L\u00f3gica para Ci\u00eancia da Computa\u00e7\u00e3o<\/b>. 1\u00aa ed. S\u00e3o Paulo: Elsevier, 2002.
\nGERSTING, J. L.\u00a0Fundamentos matem\u00e1ticos para a ci\u00eancia da computa\u00e7\u00e3o<\/b>. 5\u00aa ed. Rio de Janeiro: LTC, 2004.
\nMENEZES, P.B.;\u00a0Matem\u00e1tica discreta para Computa\u00e7\u00e3o e Inform\u00e1tica<\/b>. Porto Alegre, Sagra-Luzzatto. Instituto de Inform\u00e1tica da UFRGS, S\u00e9rie Livros Did\u00e1ticos, n\u00famero 16, 2004.
\nBIBLIOGRAFIA COMPLEMENTAR<\/b>
\nDaghlian, Jacob. L\u00f3gica e \u00e1lgebra de Boole. S\u00e3o Paulo: Atlas, 1995.
\nSKVARCIUS, Romualdes; ROBINSON, William B..\u00a0Discrete Mathematics with Computer Science Applications<\/b>.\u00a0Redwood City: Benjamin\/Cummings, 1986.
\nEVARISTO, Jaime.\u00a0Introdu\u00e7\u00e3o \u00e0 \u00e1lgebra com aplica\u00e7\u00f5es \u00e0 ci\u00eancia da computa\u00e7\u00e3o<\/b>.EdUFAL, 1999.
\nSCHEINERMAN, E.R..\u00a0Matem\u00e1tica discreta: uma introdu\u00e7\u00e3o<\/b>.\u00a0S\u00e3o Paulo. Thomson Learning
\nLtda. 2003.
\nSCHEINERMAN, Edward R.:\u00a0Matem\u00e1tica Discreta Uma Introdu\u00e7\u00e3o<\/b>. Thomson Pioneira, 2003.
\nBEZERRA, L.H; BARROS, P.H.V.; TOMEI. C.; WILMER, C.;\u00a0Introdu\u00e7\u00e3o \u00e0 Matem\u00e1tica<\/b>. Florian\u00f3polis. Editora da UFSC, 1995.<\/p>\n","protected":false},"excerpt":{"rendered":"
L\u00f3gica Proposicional: Sintaxe e Sem\u00e2ntica. \u00c1lgebra de Boole. Portas L\u00f3gicas. Circuitos L\u00f3gicos. BIBLIOGRAFIA B\u00c1SICA NUNES DE SOUZA, J.\u00a0L\u00f3gica para Ci\u00eancia da Computa\u00e7\u00e3o. 1\u00aa ed. S\u00e3o Paulo: Elsevier, 2002. GERSTING, J. L.\u00a0Fundamentos matem\u00e1ticos para a ci\u00eancia da computa\u00e7\u00e3o. 5\u00aa ed. Rio de Janeiro: LTC, 2004. MENEZES, P.B.;\u00a0Matem\u00e1tica discreta para Computa\u00e7\u00e3o e Inform\u00e1tica. Porto Alegre, Sagra-Luzzatto. Instituto […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[2],"tags":[],"class_list":["post-13","post","type-post","status-publish","format-standard","hentry","category-logica"],"_links":{"self":[{"href":"https:\/\/www.uniessa.hiperlogic.com.br\/index.php?rest_route=\/wp\/v2\/posts\/13","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.uniessa.hiperlogic.com.br\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.uniessa.hiperlogic.com.br\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.uniessa.hiperlogic.com.br\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.uniessa.hiperlogic.com.br\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=13"}],"version-history":[{"count":1,"href":"https:\/\/www.uniessa.hiperlogic.com.br\/index.php?rest_route=\/wp\/v2\/posts\/13\/revisions"}],"predecessor-version":[{"id":14,"href":"https:\/\/www.uniessa.hiperlogic.com.br\/index.php?rest_route=\/wp\/v2\/posts\/13\/revisions\/14"}],"wp:attachment":[{"href":"https:\/\/www.uniessa.hiperlogic.com.br\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=13"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.uniessa.hiperlogic.com.br\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=13"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.uniessa.hiperlogic.com.br\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=13"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}