{"id":28006,"date":"2021-02-19T13:00:00","date_gmt":"2021-02-19T13:00:00","guid":{"rendered":"http:\/\/toposuranos.com\/material\/?p=28006"},"modified":"2024-08-16T04:18:06","modified_gmt":"2024-08-16T04:18:06","slug":"semantica-da-logica-proposicional","status":"publish","type":"post","link":"https:\/\/toposuranos.com\/material\/pt\/semantica-da-logica-proposicional\/","title":{"rendered":"Sem\u00e2ntica da L\u00f3gica Proposicional"},"content":{"rendered":"<div style=\"background-color:#F3F3F3; padding:20px;\">\n<center><\/p>\n<h1>Sem\u00e2ntica da L\u00f3gica Proposicional<\/h1>\n<p><\/p>\n<p style=\"text-align:center;\"><strong>RESUMO<\/strong><br \/><em>Nesta aula, estudamos a sem\u00e2ntica da l\u00f3gica proposicional, especificamente a atribui\u00e7\u00e3o de valores de verdade a uma express\u00e3o e como esses valores se propagam de uma express\u00e3o para outra atrav\u00e9s dos conectores l\u00f3gicos. Introduz-se a no\u00e7\u00e3o de tabelas de verdade e s\u00e3o apresentadas as tabelas de verdade dos conectores derivados, tais como nega\u00e7\u00e3o, disjun\u00e7\u00e3o, conjun\u00e7\u00e3o, implica\u00e7\u00e3o, dupla implica\u00e7\u00e3o e disjun\u00e7\u00e3o exclusiva. Al\u00e9m disso, apresenta-se a defini\u00e7\u00e3o de uma atribui\u00e7\u00e3o sobre um conjunto de express\u00f5es at\u00f4micas e explica-se como ela se estende naturalmente a todas as express\u00f5es que podem ser constru\u00eddas a partir desse conjunto. Finalmente, estabelecem-se as defini\u00e7\u00f5es de express\u00f5es v\u00e1lidas, satisfat\u00edveis e insatisfat\u00edveis, e apresentam-se exemplos de tautologias e contradi\u00e7\u00f5es. No entanto, reconhece-se que o c\u00e1lculo das tabelas de verdade para express\u00f5es complexas pode ser ineficiente, por isso menciona-se a busca por m\u00e9todos alternativos para resolver problemas de validade ou satisfatibilidade.<\/em><\/p>\n<p><\/center><br \/>\n<\/p>\n<p style=\"text-align:center;\"><strong>OBJETIVOS DE APRENDIZAGEM:<\/strong><br \/>\nAo final desta aula, o estudante ser\u00e1 capaz de\n<\/p>\n<ol>\n<li><strong>Explicar<\/strong> a sem\u00e2ntica da l\u00f3gica proposicional<\/li>\n<li><strong>Usar<\/strong> tabelas de verdade para representar as atribui\u00e7\u00f5es de valores de verdade das express\u00f5es na l\u00f3gica proposicional<\/li>\n<li><strong>Modelar<\/strong> uma express\u00e3o com uma atribui\u00e7\u00e3o na l\u00f3gica proposicional<\/li>\n<li><strong>Aplicar<\/strong> as regras sem\u00e2nticas da l\u00f3gica proposicional para determinar se uma express\u00e3o \u00e9 tautologia, contradi\u00e7\u00e3o ou conting\u00eancia<\/li>\n<\/ol>\n<p style=\"text-align:center;\"><strong>\u00cdNDICE<\/strong><br \/>\n<a href=\"#1\">SOBRE AS ATRIBUI\u00c7\u00d5ES DOS VALORES DE VERDADE<\/a><br \/>\n<a href=\"#2\">SEM\u00c2NTICA DOS CONECTORES DA L\u00d3GICA PROPOSICIONAL<\/a><br \/>\n<a href=\"#3\">ATRIBUI\u00c7\u00d5ES NA L\u00d3GICA PROPOSICIONAL<\/a><br \/>\n<a href=\"#4\">MODELOS NA L\u00d3GICA PROPOSICIONAL<\/a><br \/>\n<a href=\"#5\">UM PROBLEMA DE EFICI\u00caNCIA NA SEM\u00c2NTICA DA L\u00d3GICA PROPOSICIONAL<\/a><\/p>\n<p><center><iframe class=\"lazyload\" width=\"560\" height=\"315\" data-src=\"https:\/\/www.youtube.com\/embed\/tX_JVhn-wl0\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture\" allowfullscreen=\"allowfullscreen\"><\/iframe><\/center><\/div>\n<p><a name=\"1\"><\/a><br \/>\n<\/br><\/br><\/p>\n<h2>Sobre as Atribui\u00e7\u00f5es dos Valores de Verdade<\/h2>\n<p style=\"text-align: justify; color: #000000;\"><a href=\"https:\/\/www.youtube.com\/watch?v=tX_JVhn-wl0&amp;t=7s\" target=\"_blank\" rel=\"noopener\"><strong><span style=\"color: #ff0000;\">Anteriormente revisamos<\/span><\/strong><\/a> a sintaxe e os sistemas dedutivos da l\u00f3gica proposicional. Embora isso nos tenha servido para revisar a forma como podemos obter uma express\u00e3o a partir de outra, at\u00e9 agora n\u00e3o falamos nada sobre a atribui\u00e7\u00e3o dos valores de verdade. Como j\u00e1 dissemos tudo o que h\u00e1 para dizer sobre as t\u00e9cnicas de dedu\u00e7\u00e3o na l\u00f3gica proposicional, come\u00e7aremos nosso estudo sobre a sem\u00e2ntica da l\u00f3gica proposicional, onde revisaremos a forma como as atribui\u00e7\u00f5es dos valores de verdade se propagam de uma express\u00e3o para outra.<\/p>\n<p><a name=\"2\"><\/a><br \/>\n<\/br><\/br><\/p>\n<h2>Sem\u00e2ntica dos Conectores da L\u00f3gica Proposicional<\/h2>\n<p style=\"text-align: justify; color: #000000;\">A sem\u00e2ntica dos conectores \u00e9 introduzida atrav\u00e9s das <strong>tabelas de verdade,<\/strong> pois elas fornecem uma forma simples e ordenada de representar todas as atribui\u00e7\u00f5es poss\u00edveis sobre uma express\u00e3o.<\/p>\n<h3>Tabela de Verdade da Nega\u00e7\u00e3o Conjunta<\/h3>\n<p style=\"text-align: justify; color: #000000;\"><a href=\"https:\/\/www.youtube.com\/watch?v=tX_JVhn-wl0&amp;t=282s\" target=\"_blank\" rel=\"noopener\"><strong><span style=\"color: #ff0000;\">Em primeiro lugar, come\u00e7aremos<\/span><\/strong><\/a> com o conector mais fundamental de todos, que \u00e9 a nega\u00e7\u00e3o conjunta. Sua tabela de verdade \u00e9 a seguinte:<\/p>\n<table style=\"color: #000000;\">\n<tbody>\n<tr>\n<td style=\"text-align: center; background-color: #88ff88;\"><strong><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\alpha<\/span><\/span><\/strong><\/td>\n<td style=\"text-align: center; background-color: #88ff88;\"><strong><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\beta<\/span><\/span><\/strong><\/td>\n<td style=\"text-align: center; background-color: #88ff88;\"><strong><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">(\\alpha\\downarrow\\beta)<\/span><\/span><\/strong><\/td>\n<\/tr>\n<tr>\n<td style=\"text-align: center;\">0<\/td>\n<td style=\"text-align: center;\">0<\/td>\n<td style=\"text-align: center; background-color: #ccffcc;\">1<\/td>\n<\/tr>\n<tr>\n<td style=\"text-align: center;\">0<\/td>\n<td style=\"text-align: center;\">1<\/td>\n<td style=\"text-align: center; background-color: #ccffcc;\">0<\/td>\n<\/tr>\n<tr>\n<td style=\"text-align: center;\">1<\/td>\n<td style=\"text-align: center;\">0<\/td>\n<td style=\"text-align: center; background-color: #ccffcc;\">0<\/td>\n<\/tr>\n<tr>\n<td style=\"text-align: center;\">1<\/td>\n<td style=\"text-align: center;\">1<\/td>\n<td style=\"text-align: center; background-color: #ccffcc;\">0<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p style=\"text-align: justify; color: #000000;\">Os valores \u00ab1\u00bb e \u00ab0\u00bb correspondem a \u00abVerdadeiro\u00bb e \u00abFalso\u00bb, respectivamente. Cada linha na tabela de verdade \u00e9 uma poss\u00edvel atribui\u00e7\u00e3o sobre as vari\u00e1veis (ou express\u00f5es at\u00f4micas) que comp\u00f5em a express\u00e3o (ou express\u00f5es) a serem estudadas. Da mesma forma, cada coluna onde se encontra uma express\u00e3o formada por essas vari\u00e1veis tem os poss\u00edveis resultados dessas atribui\u00e7\u00f5es. Desta forma, a interpreta\u00e7\u00e3o desta tabela nos diz que <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\alpha\\downarrow\\beta<\/span><\/span> \u00e9 verdadeiro apenas quando <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\alpha<\/span><\/span> e <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\beta<\/span><\/span> s\u00e3o ambos falsos ao mesmo tempo, e falso em outro caso. Por essa raz\u00e3o, o conector <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\downarrow<\/span><\/span> recebe o nome de <strong>nega\u00e7\u00e3o conjunta.<\/strong><\/p>\n<h3>Tabelas de Verdade dos Conectores Derivados<\/h3>\n<p style=\"text-align: justify; color: #000000;\">A partir da sem\u00e2ntica da nega\u00e7\u00e3o conjunta, \u00e9 poss\u00edvel obter a dos demais conectores atrav\u00e9s de suas defini\u00e7\u00f5es. Estas s\u00e3o:<\/p>\n<table style=\"color: #000000;\">\n<tbody>\n<tr>\n<td><span><strong>Nega\u00e7\u00e3o:<\/strong><\/span><\/td>\n<td><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\neg \\alpha<\/span><\/span><\/td>\n<td><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">:=<\/span><\/span><\/td>\n<td><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">(\\alpha\\downarrow\\alpha)<\/span><\/span><\/td>\n<\/tr>\n<tr>\n<td><strong>Disjun\u00e7\u00e3o Inclusiva:<\/strong><\/td>\n<td><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">(\\alpha \\vee \\beta)<\/span><\/span><\/td>\n<td><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">:=<\/span><\/span><\/td>\n<td><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\neg(\\alpha\\downarrow\\beta)<\/span><\/span><\/td>\n<\/tr>\n<tr>\n<td><strong>Conjun\u00e7\u00e3o:<\/strong><\/td>\n<td><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">(\\alpha \\wedge \\beta)<\/span><\/span><\/td>\n<td><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">:=<\/span><\/span><\/td>\n<td><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\neg(\\neg\\alpha\\vee \\neg\\beta)<\/span><\/span><\/td>\n<\/tr>\n<tr>\n<td><strong>Implica\u00e7\u00e3o:<\/strong><\/td>\n<td><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">(\\alpha \\rightarrow \\beta)<\/span><\/span><\/td>\n<td><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">:=<\/span><\/span><\/td>\n<td><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">(\\neg\\alpha\\vee \\beta)<\/span><\/span><\/td>\n<\/tr>\n<tr>\n<td><strong>Dupla Implica\u00e7\u00e3o:<\/strong><\/td>\n<td><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">(\\alpha \\leftrightarrow \\beta)<\/span><\/span><\/td>\n<td><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">:=<\/span><\/span><\/td>\n<td><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">((\\alpha\\rightarrow \\beta)\\wedge(\\beta \\rightarrow \\alpha))<\/span><\/span><\/td>\n<\/tr>\n<tr>\n<td><strong>Disjun\u00e7\u00e3o Exclusiva:<\/strong><\/td>\n<td><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">(\\alpha \\underline{\\vee} \\beta)<\/span><\/span><\/td>\n<td><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">:=<\/span><\/span><\/td>\n<td><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\neg(\\alpha\\leftrightarrow \\beta)<\/span><\/span><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p style=\"text-align: justify; color: #000000;\">A partir dessas defini\u00e7\u00f5es, \u00e9 poss\u00edvel calcular as tabelas de verdade dos demais conectores:<\/p>\n<h4>Nega\u00e7\u00e3o<\/h4>\n<table style=\"color: #000000;\">\n<tbody>\n<tr>\n<td style=\"text-align: center; background-color: #88ff88;\"><strong><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\alpha<\/span><\/span><\/strong><\/td>\n<td style=\"text-align: center; background-color: #88ff88;\"><strong><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\neg \\alpha<\/span><\/span><\/strong><\/td>\n<\/tr>\n<tr>\n<td style=\"text-align: center;\">0<\/td>\n<td style=\"text-align: center; background-color: #ccffcc;\">1<\/td>\n<\/tr>\n<tr>\n<td style=\"text-align: center;\">1<\/td>\n<td style=\"text-align: center; background-color: #ccffcc;\">0<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p style=\"text-align: justify; color: #000000;\"><a href=\"https:\/\/www.youtube.com\/watch?v=tX_JVhn-wl0&amp;t=335s\" target=\"_blank\" rel=\"noopener\"><strong><span style=\"color: #ff0000;\">Daqui vem<\/span><\/strong><\/a> o fato de que o conector de nega\u00e7\u00e3o tem a propriedade de inverter o valor de verdade da express\u00e3o sobre a qual \u00e9 aplicado.<\/p>\n<h4>Disjun\u00e7\u00e3o Inclusiva<\/h4>\n<table style=\"color: #000000;\">\n<tbody>\n<tr>\n<td style=\"text-align: center; background-color: #88ff88;\"><strong><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\alpha<\/span><\/span><\/strong><\/td>\n<td style=\"text-align: center; background-color: #88ff88;\"><strong><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\beta<\/span><\/span><\/strong><\/td>\n<td style=\"text-align: center; background-color: #88ff88;\"><strong><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">(\\alpha\\vee\\beta)<\/span><\/span><\/strong><\/td>\n<\/tr>\n<tr>\n<td style=\"text-align: center;\">0<\/td>\n<td style=\"text-align: center;\">0<\/td>\n<td style=\"text-align: center; background-color: #ccffcc;\">0<\/td>\n<\/tr>\n<tr>\n<td style=\"text-align: center;\">0<\/td>\n<td style=\"text-align: center;\">1<\/td>\n<td style=\"text-align: center; background-color: #ccffcc;\">1<\/td>\n<\/tr>\n<tr>\n<td style=\"text-align: center;\">1<\/td>\n<td style=\"text-align: center;\">0<\/td>\n<td style=\"text-align: center; background-color: #ccffcc;\">1<\/td>\n<\/tr>\n<tr>\n<td style=\"text-align: center;\">1<\/td>\n<td style=\"text-align: center;\">1<\/td>\n<td style=\"text-align: center; background-color: #ccffcc;\">1<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p style=\"text-align: justify; color: #000000;\"><a href=\"https:\/\/www.youtube.com\/watch?v=tX_JVhn-wl0&amp;t=383s\" target=\"_blank\" rel=\"noopener\"><strong><span style=\"color: #ff0000;\">\u00c9 por isso que<\/span><\/strong><\/a> a disjun\u00e7\u00e3o inclusiva (ou simplesmente \u00abdisjun\u00e7\u00e3o\u00bb) entre duas express\u00f5es \u00e9 verdadeira se pelo menos uma das express\u00f5es for verdadeira, e \u00e9 falsa quando ambas as express\u00f5es forem falsas ao mesmo tempo.<\/p>\n<h4>Conjun\u00e7\u00e3o<\/h4>\n<table style=\"color: #000000;\">\n<tbody>\n<tr>\n<td style=\"text-align: center; background-color: #88ff88;\"><strong><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\alpha<\/span><\/span><\/strong><\/td>\n<td style=\"text-align: center; background-color: #88ff88;\"><strong><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\beta<\/span><\/span><\/strong><\/td>\n<td style=\"text-align: center; background-color: #88ff88;\"><strong><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">(\\alpha\\wedge\\beta)<\/span><\/span><\/strong><\/td>\n<\/tr>\n<tr>\n<td style=\"text-align: center;\">0<\/td>\n<td style=\"text-align: center;\">0<\/td>\n<td style=\"text-align: center; background-color: #ccffcc;\">0<\/td>\n<\/tr>\n<tr>\n<td style=\"text-align: center;\">0<\/td>\n<td style=\"text-align: center;\">1<\/td>\n<td style=\"text-align: center; background-color: #ccffcc;\">0<\/td>\n<\/tr>\n<tr>\n<td style=\"text-align: center;\">1<\/td>\n<td style=\"text-align: center;\">0<\/td>\n<td style=\"text-align: center; background-color: #ccffcc;\">0<\/td>\n<\/tr>\n<tr>\n<td style=\"text-align: center;\">1<\/td>\n<td style=\"text-align: center;\">1<\/td>\n<td style=\"text-align: center; background-color: #ccffcc;\">1<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p style=\"text-align: justify; color: #000000;\"><a href=\"https:\/\/www.youtube.com\/watch?v=tX_JVhn-wl0&amp;t=444s\" target=\"_blank\" rel=\"noopener\"><strong><span style=\"color: #ff0000;\">Como resultado,<\/span><\/strong><\/a> a conjun\u00e7\u00e3o entre duas express\u00f5es \u00e9 verdadeira apenas se ambas as express\u00f5es forem verdadeiras ao mesmo tempo, e falsa em outro caso. Por isso, um nome adequado para este conector tamb\u00e9m pode ser \u00abafirma\u00e7\u00e3o conjunta\u00bb.<\/p>\n<h4>Implica\u00e7\u00e3o<\/h4>\n<table style=\"color: #000000;\">\n<tbody>\n<tr>\n<td style=\"text-align: center; background-color: #88ff88;\"><strong><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\alpha<\/span><\/span><\/strong><\/td>\n<td style=\"text-align: center; background-color: #88ff88;\"><strong><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\beta<\/span><\/span><\/strong><\/td>\n<td style=\"text-align: center; background-color: #88ff88;\"><strong><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">(\\alpha\\rightarrow\\beta)<\/span><\/span><\/strong><\/td>\n<\/tr>\n<tr>\n<td style=\"text-align: center;\">0<\/td>\n<td style=\"text-align: center;\">0<\/td>\n<td style=\"text-align: center; background-color: #ccffcc;\">1<\/td>\n<\/tr>\n<tr>\n<td style=\"text-align: center;\">0<\/td>\n<td style=\"text-align: center;\">1<\/td>\n<td style=\"text-align: center; background-color: #ccffcc;\">1<\/td>\n<\/tr>\n<tr>\n<td style=\"text-align: center;\">1<\/td>\n<td style=\"text-align: center;\">0<\/td>\n<td style=\"text-align: center; background-color: #ccffcc;\">0<\/td>\n<\/tr>\n<tr>\n<td style=\"text-align: center;\">1<\/td>\n<td style=\"text-align: center;\">1<\/td>\n<td style=\"text-align: center; background-color: #ccffcc;\">1<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p style=\"text-align: justify; color: #000000;\"><a href=\"https:\/\/www.youtube.com\/watch?v=tX_JVhn-wl0&amp;t=555s\" target=\"_blank\" rel=\"noopener\"><strong><span style=\"color: #ff0000;\">Assim,<\/span><\/strong><\/a> a tabela de verdade da implica\u00e7\u00e3o resume a no\u00e7\u00e3o de que uma express\u00e3o verdadeira s\u00f3 pode implicar uma express\u00e3o verdadeira, mas uma falsa pode implicar qualquer coisa.<\/p>\n<h4>Dupla Implica\u00e7\u00e3o<\/h4>\n<table style=\"color: #000000;\">\n<tbody>\n<tr>\n<td style=\"text-align: center; background-color: #88ff88;\"><strong><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\alpha<\/span><\/span><\/strong><\/td>\n<td style=\"text-align: center; background-color: #88ff88;\"><strong><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\beta<\/span><\/span><\/strong><\/td>\n<td style=\"text-align: center; background-color: #88ff88;\"><strong><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">(\\alpha\\leftrightarrow\\beta)<\/span><\/span><\/strong><\/td>\n<\/tr>\n<tr>\n<td style=\"text-align: center;\">0<\/td>\n<td style=\"text-align: center;\">0<\/td>\n<td style=\"text-align: center; background-color: #ccffcc;\">1<\/td>\n<\/tr>\n<tr>\n<td style=\"text-align: center;\">0<\/td>\n<td style=\"text-align: center;\">1<\/td>\n<td style=\"text-align: center; background-color: #ccffcc;\">0<\/td>\n<\/tr>\n<tr>\n<td style=\"text-align: center;\">1<\/td>\n<td style=\"text-align: center;\">0<\/td>\n<td style=\"text-align: center; background-color: #ccffcc;\">0<\/td>\n<\/tr>\n<tr>\n<td style=\"text-align: center;\">1<\/td>\n<td style=\"text-align: center;\">1<\/td>\n<td style=\"text-align: center; background-color: #ccffcc;\">1<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p style=\"text-align: justify; color: #000000;\"><a href=\"https:\/\/www.youtube.com\/watch?v=tX_JVhn-wl0&amp;t=641s\" target=\"_blank\" rel=\"noopener\"><strong><span style=\"color: #ff0000;\">A dupla implica\u00e7\u00e3o<\/span><\/strong><\/a> forma uma express\u00e3o verdadeira sempre que as duas express\u00f5es que a formam t\u00eam os mesmos valores de verdade, e \u00e9 falsa em outro caso.<\/p>\n<h4>Disjun\u00e7\u00e3o Exclusiva<\/h4>\n<table style=\"color: #000000;\">\n<tbody>\n<tr>\n<td style=\"text-align: center; background-color: #88ff88;\"><strong><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\alpha<\/span><\/span><\/strong><\/td>\n<td style=\"text-align: center; background-color: #88ff88;\"><strong><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\beta<\/span><\/span><\/strong><\/td>\n<td style=\"text-align: center; background-color: #88ff88;\"><strong><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">(\\alpha\\underline{\\vee}\\beta)<\/span><\/span><\/strong><\/td>\n<\/tr>\n<tr>\n<td style=\"text-align: center;\">0<\/td>\n<td style=\"text-align: center;\">0<\/td>\n<td style=\"text-align: center; background-color: #ccffcc;\">0<\/td>\n<\/tr>\n<tr>\n<td style=\"text-align: center;\">0<\/td>\n<td style=\"text-align: center;\">1<\/td>\n<td style=\"text-align: center; background-color: #ccffcc;\">1<\/td>\n<\/tr>\n<tr>\n<td style=\"text-align: center;\">1<\/td>\n<td style=\"text-align: center;\">0<\/td>\n<td style=\"text-align: center; background-color: #ccffcc;\">1<\/td>\n<\/tr>\n<tr>\n<td style=\"text-align: center;\">1<\/td>\n<td style=\"text-align: center;\">1<\/td>\n<td style=\"text-align: center; background-color: #ccffcc;\">0<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p style=\"text-align: justify; color: #000000;\"><a href=\"https:\/\/www.youtube.com\/watch?v=tX_JVhn-wl0&amp;t=702s\" target=\"_blank\" rel=\"noopener\"><strong><span style=\"color: #ff0000;\">A disjun\u00e7\u00e3o exclusiva<\/span><\/strong><\/a> entre duas express\u00f5es \u00e9 verdadeira quando uma, e apenas uma das express\u00f5es \u00e9 verdadeira, e falsa em outro caso.<\/p>\n<p><a name=\"3\"><\/a><br \/>\n<\/br><\/br><\/p>\n<h2>Atribui\u00e7\u00f5es na l\u00f3gica proposicional<\/h2>\n<p style=\"text-align: justify; color: #000000;\"><a href=\"https:\/\/www.youtube.com\/watch?v=tX_JVhn-wl0&amp;t=857s\" target=\"_blank\" rel=\"noopener\"><strong><span style=\"color: #ff0000;\">Com o que foi descrito anteriormente<\/span><\/strong><\/a> temos uma no\u00e7\u00e3o simples do que \u00e9 uma atribui\u00e7\u00e3o; no entanto, para os desenvolvimentos que veremos mais adiante, precisaremos de algo mais preciso. Se <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">S=\\{A_1, A_2, \\cdots, A_n\\}<\/span><\/span> \u00e9 um conjunto de express\u00f5es at\u00f4micas e <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\mathcal{F}(S)<\/span><\/span> o conjunto de todas as express\u00f5es que podem ser constru\u00eddas a partir das express\u00f5es de <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">S<\/span><\/span>, ent\u00e3o temos a seguinte defini\u00e7\u00e3o:<\/p>\n<p><\/br><\/p>\n<p style=\"text-align: justify; color: #000000;\"><span style=\"color: #880000;\"><strong>DEFINI\u00c7\u00c3O:<\/strong><\/span> Uma <strong>atribui\u00e7\u00e3o<\/strong> sobre <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">S<\/span><\/span> \u00e9 uma fun\u00e7\u00e3o <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\mathcal{A}: S \\longrightarrow \\{0,1\\}<\/span><\/span><\/p>\n<p><\/br><\/p>\n<p style=\"text-align: justify; color: #000000;\">Em outras palavras, uma atribui\u00e7\u00e3o sobre <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">S<\/span><\/span> fornece um valor de verdade a cada express\u00e3o at\u00f4mica de <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">S<\/span><\/span>. Uma atribui\u00e7\u00e3o <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\mathcal{A}<\/span><\/span> de <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">S<\/span><\/span> se estende naturalmente a todos os elementos de <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\mathcal{F}(S)<\/span><\/span>. Se temos uma express\u00e3o <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">F\\in \\mathcal{F}(S)<\/span><\/span>, ent\u00e3o uma atribui\u00e7\u00e3o <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\mathcal{A}<\/span><\/span> sobre <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">S<\/span><\/span> corresponde a uma \u00fanica linha na tabela de verdade de <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">F<\/span><\/span> e diz-se que <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\mathcal{A}(F)<\/span><\/span> \u00e9 o valor de verdade de <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">F<\/span><\/span> nessa linha.<\/p>\n<p style=\"text-align: justify; color: #000000;\">Uma atribui\u00e7\u00e3o <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\mathcal{A}<\/span><\/span> de <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">S<\/span><\/span> tamb\u00e9m pode se estender a certas express\u00f5es que n\u00e3o est\u00e3o em <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\mathcal{F}(S)<\/span><\/span>. Se <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">F_0<\/span><\/span> \u00e9 uma express\u00e3o que n\u00e3o est\u00e1 em <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\mathcal{F}(S)<\/span><\/span> e <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">S_0<\/span><\/span> \u00e9 o conjunto de subf\u00f3rmulas at\u00f4micas de <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">F_0<\/span><\/span>, ent\u00e3o se todas as extens\u00f5es de <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\mathcal{A}<\/span><\/span> para <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">S\\cup S_0<\/span><\/span> tiverem o mesmo valor para <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">F_0<\/span><\/span>, ent\u00e3o define-se <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\mathcal{A}(F_0)<\/span><\/span> como esse valor.<\/p>\n<p style=\"text-align: justify; color: #000000;\"><span style=\"color: #000088;\">EXEMPLO:<\/span> Se <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">A<\/span><\/span> e <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">B<\/span><\/span> s\u00e3o express\u00f5es at\u00f4micas e <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\mathcal{A}<\/span><\/span> \u00e9 uma atribui\u00e7\u00e3o sobre <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\{A,B\\}<\/span><\/span> definida por <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\mathcal{A}(A)=1<\/span><\/span> e <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\mathcal{A}(B)=0<\/span><\/span>, ent\u00e3o teremos:<\/p>\n<p style=\"text-align: center; color: #000000;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\mathcal{A}(A\\wedge B)=0<\/span><\/span> e <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\mathcal{A}(A\\vee B)=1<\/span><\/span><\/p>\n<p style=\"text-align: justify; color: #000000;\">E apesar de n\u00e3o haver uma atribui\u00e7\u00e3o estabelecida sobre uma vari\u00e1vel <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">C<\/span><\/span>, pode-se dizer que:<\/p>\n<p style=\"text-align: center; color: #000000;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\mathcal{A}(A\\wedge (C\\vee \\neg C))=1<\/span><\/span> e <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\mathcal{A}(B\\vee (C\\wedge \\neg C))=0<\/span><\/span><\/p>\n<p style=\"text-align: justify; color: #000000;\">Isso acontece com as duas \u00faltimas express\u00f5es porque, independentemente da atribui\u00e7\u00e3o de <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">C<\/span><\/span>, sempre ocorrer\u00e1 que<\/p>\n<p style=\"text-align: center; color: #000000;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\mathcal{A}(C\\vee\\neg C)=1<\/span><\/span> e <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\mathcal{A}(C\\wedge\\neg C)=0<\/span><\/span><\/p>\n<p style=\"text-align: justify; color: #000000;\">Coisa que podemos revisar rapidamente calculando suas tabelas de verdade.<\/p>\n<table style=\"color: #000000;\">\n<tbody>\n<tr>\n<td style=\"text-align: center; background-color: #88ff88;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">C<\/span><\/span><\/td>\n<td style=\"text-align: center; background-color: #88ff88;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\neg C<\/span><\/span><\/td>\n<td style=\"text-align: center; background-color: #88ff88;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">(C\\wedge \\neg C)<\/span><\/span><\/td>\n<td style=\"text-align: center; background-color: #88ff88;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">(C \\vee \\neg C)<\/span><\/span><\/td>\n<\/tr>\n<tr>\n<td style=\"text-align: center;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">0<\/span><\/span><\/td>\n<td style=\"text-align: center;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">1<\/span><\/span><\/td>\n<td style=\"text-align: center;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">0<\/span><\/span><\/td>\n<td style=\"text-align: center;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">1<\/span><\/span><\/td>\n<\/tr>\n<tr>\n<td style=\"text-align: center;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">1<\/span><\/span><\/td>\n<td style=\"text-align: center;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">0<\/span><\/span><\/td>\n<td style=\"text-align: center;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">0<\/span><\/span><\/td>\n<td style=\"text-align: center;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">1<\/span><\/span><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p>\u25a0 Fim do Exemplo<\/p>\n<p><a name=\"4\"><\/a><br \/>\n<\/br><\/br><\/p>\n<h2>Modelos na L\u00f3gica Proposicional<\/h2>\n<p style=\"text-align: justify; color: #000000;\"><a href=\"https:\/\/www.youtube.com\/watch?v=tX_JVhn-wl0&amp;t=1323s\" target=\"_blank\" rel=\"noopener\"><strong><span style=\"color: #ff0000;\">Consideremos uma atribui\u00e7\u00e3o<\/span><\/strong><\/a> <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\mathcal{A}<\/span><\/span> sobre um conjunto de express\u00f5es <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">S<\/span><\/span>. Se <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">F\\in S<\/span><\/span> for tal que <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\mathcal{A}(F)=1<\/span><\/span>, ent\u00e3o diz-se que a atribui\u00e7\u00e3o <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\mathcal{A}<\/span><\/span> modela <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">F<\/span><\/span>, ou que a express\u00e3o <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">F<\/span><\/span> \u00e9 sustentada pela atribui\u00e7\u00e3o <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\mathcal{A}<\/span><\/span> e representamos isso atrav\u00e9s da escrita<\/p>\n<p style=\"text-align: center; color: #000000;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\mathcal{A}\\models F<\/span><\/span>.<\/p>\n<p style=\"text-align: justify; color: #000000;\">E, a partir disso, estabelecem-se as seguintes defini\u00e7\u00f5es:<\/p>\n<p><\/br><\/p>\n<p style=\"text-align: justify; color: #000000;\"><span style=\"color: #880000;\"><strong>DEFINI\u00c7\u00c3O:<\/strong><\/span> Diz-se que uma express\u00e3o \u00e9 <strong>v\u00e1lida<\/strong> quando \u00e9 sustentada por qualquer atribui\u00e7\u00e3o. Se <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">F<\/span><\/span> for v\u00e1lida, ent\u00e3o escreve-se <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\models F <\/span><\/span>. As express\u00f5es v\u00e1lidas tamb\u00e9m s\u00e3o chamadas de <strong>tautologia.<\/strong><\/p>\n<p><\/br><\/p>\n<p style=\"text-align: justify; color: #000000;\"><span style=\"color: #000088;\">EXEMPLO:<\/span> A express\u00e3o <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">(C\\vee \\neg C)<\/span><\/span>, que j\u00e1 vimos, \u00e9 uma <strong>tautologia.<\/strong><\/p>\n<p>\u25a0 Fim do Exemplo<\/p>\n<p><\/br><\/p>\n<p style=\"text-align: justify; color: #000000;\"><span style=\"color: #880000;\"><strong>DEFINI\u00c7\u00c3O:<\/strong><\/span> Diz-se que uma express\u00e3o \u00e9 <strong>satisfat\u00edvel<\/strong> se for sustentada por alguma atribui\u00e7\u00e3o. As express\u00f5es satisfat\u00edveis que n\u00e3o s\u00e3o tautologias s\u00e3o chamadas de <strong>conting\u00eancias.<\/strong><\/p>\n<p><\/br><\/p>\n<p><\/br><\/p>\n<p style=\"text-align: justify; color: #000000;\"><span style=\"color: #880000;\"><strong>DEFINI\u00c7\u00c3O:<\/strong><\/span> Diz-se que uma express\u00e3o \u00e9 <strong>insatisfat\u00edvel<\/strong> se n\u00e3o for sustentada por nenhuma atribui\u00e7\u00e3o. As express\u00f5es insatisfat\u00edveis s\u00e3o chamadas de <strong>contradi\u00e7\u00f5es.<\/strong> Se <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">F<\/span><\/span> for uma contradi\u00e7\u00e3o, ent\u00e3o escreve-se <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\not\\models F <\/span><\/span>.<\/p>\n<p><\/br><\/p>\n<p style=\"text-align: justify; color: #000000;\"><span style=\"color: #000088;\">EXEMPLO:<\/span> A express\u00e3o <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">(C\\wedge \\neg C)<\/span><\/span>, que j\u00e1 vimos, \u00e9 uma <strong>contradi\u00e7\u00e3o.<\/strong>.<\/p>\n<p>\u25a0 Fim do Exemplo<\/p>\n<h3>Exemplos de Tautologias e Contradi\u00e7\u00f5es<\/h3>\n<p style=\"text-align: justify; color: #000000;\">Suponhamos que queremos ver se uma express\u00e3o \u00e9 v\u00e1lida ou n\u00e3o. Isso que acabamos de expor \u00e9 um <strong>problema de decis\u00e3o<\/strong> dentro da Sem\u00e2ntica da L\u00f3gica Proposicional. Um problema de decis\u00e3o \u00e9 qualquer problema que, dada uma determinada entrada, resulta em um \u00absim\u00bb ou \u00abn\u00e3o\u00bb. Se nos derem uma express\u00e3o <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">F<\/span><\/span> e perguntarmos se \u00e9 ou n\u00e3o v\u00e1lida, ent\u00e3o estamos diante de um problema de decis\u00e3o que chamamos de <strong>problema de validade.<\/strong> Da mesma forma, se perguntarmos se \u00e9 ou n\u00e3o satisfat\u00edvel, estamos diante de um <strong>problema de satisfatibilidade.<\/strong> Na l\u00f3gica proposicional, as tabelas de verdade oferecem uma abordagem sistem\u00e1tica para resolver esses problemas de decis\u00e3o: se todos os valores de verdade poss\u00edveis de <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">F<\/span><\/span> forem \u00ab1\u00bb, ent\u00e3o <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">F<\/span><\/span> \u00e9 v\u00e1lida; se apenas alguns forem \u00ab1\u00bb, ent\u00e3o \u00e9 satisfat\u00edvel; e finalmente, se todos forem \u00ab0\u00bb, ent\u00e3o \u00e9 insatisfat\u00edvel.<\/p>\n<p style=\"text-align: justify; color: #000000;\"><span style=\"color: #000088;\">EXEMPLO:<\/span> Consideremos a express\u00e3o <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">((A\\wedge (A \\rightarrow B)) \\rightarrow B)<\/span><\/span>. Para determinar se essa express\u00e3o \u00e9 v\u00e1lida, satisfat\u00edvel ou contradit\u00f3ria, fazemos sua tabela de verdade.<\/p>\n<table style=\"color: #000000;\">\n<tbody>\n<tr>\n<td style=\"text-align: center; background-color: #eeeeee;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">A<\/span><\/span><\/td>\n<td style=\"text-align: center; background-color: #eeeeee;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">B<\/span><\/span><\/td>\n<td style=\"text-align: center; background-color: #eeeeee;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">(A\\rightarrow B)<\/span><\/span><\/td>\n<td style=\"text-align: center; background-color: #eeeeee;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">(A\\wedge(A\\rightarrow B))<\/span><\/span><\/td>\n<td style=\"text-align: center; background-color: #88ff88;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">((A\\wedge(A\\rightarrow B))\\rightarrow B)<\/span><\/span><\/td>\n<\/tr>\n<tr>\n<td style=\"text-align: center;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">0<\/span><\/span><\/td>\n<td style=\"text-align: center;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">0<\/span><\/span><\/td>\n<td style=\"text-align: center;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">1<\/span><\/span><\/td>\n<td style=\"text-align: center;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">0<\/span><\/span><\/td>\n<td style=\"text-align: center; background-color: #aaffaa;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">1<\/span><\/span><\/td>\n<\/tr>\n<tr>\n<td style=\"text-align: center;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">0<\/span><\/span><\/td>\n<td style=\"text-align: center;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">1<\/span><\/span><\/td>\n<td style=\"text-align: center;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">1<\/span><\/span><\/td>\n<td style=\"text-align: center;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">0<\/span><\/span><\/td>\n<td style=\"text-align: center; background-color: #aaffaa;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">1<\/span><\/span><\/td>\n<\/tr>\n<tr>\n<td style=\"text-align: center;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">1<\/span><\/span><\/td>\n<td style=\"text-align: center;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">0<\/span><\/span><\/td>\n<td style=\"text-align: center;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">0<\/span><\/span><\/td>\n<td style=\"text-align: center;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">0<\/span><\/span><\/td>\n<td style=\"text-align: center; background-color: #aaffaa;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">1<\/span><\/span><\/td>\n<\/tr>\n<tr>\n<td style=\"text-align: center;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">1<\/span><\/span><\/td>\n<td style=\"text-align: center;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">1<\/span><\/span><\/td>\n<td style=\"text-align: center;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">1<\/span><\/span><\/td>\n<td style=\"text-align: center;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">1<\/span><\/span><\/td>\n<td style=\"text-align: center; background-color: #aaffaa;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">1<\/span><\/span><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p style=\"text-align: justify; color: #000000;\">Com isso, vemos que <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">((A\\wedge(A\\rightarrow B))\\rightarrow B)<\/span><\/span> tem valor de verdade \u00ab1\u00bb para todas as atribui\u00e7\u00f5es poss\u00edveis, de modo que a express\u00e3o resulta ser uma tautologia.<\/p>\n<p>\u25a0 Fim do Exemplo<\/p>\n<p style=\"text-align: justify; color: #000000;\"><span style=\"color: #000088;\">EXEMPLO:<\/span> Consideremos agora a express\u00e3o <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">(((A\\rightarrow B)\\rightarrow A)\\wedge \\neg A)<\/span><\/span>. O c\u00e1lculo da tabela de verdade nos d\u00e1 o que \u00e9 mostrado abaixo:<\/p>\n<table style=\"color: #000000;\">\n<tbody>\n<tr>\n<td style=\"text-align: center; background-color: #eeeeee;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">A<\/span><\/span><\/td>\n<td style=\"text-align: center; background-color: #eeeeee;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">B<\/span><\/span><\/td>\n<td style=\"text-align: center; background-color: #eeeeee;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">(A\\rightarrow B)<\/span><\/span><\/td>\n<td style=\"text-align: center; background-color: #eeeeee;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">((A\\rightarrow B)\\rightarrow A)<\/span><\/span><\/td>\n<td style=\"text-align: center; background-color: #eeeeee;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\neg A<\/span><\/span><\/td>\n<td style=\"text-align: center; background-color: #88ff88;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">(((A\\rightarrow B)\\rightarrow A)\\wedge \\neg A)<\/span><\/span><\/td>\n<\/tr>\n<tr>\n<td style=\"text-align: center;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">0<\/span><\/span><\/td>\n<td style=\"text-align: center;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">0<\/span><\/span><\/td>\n<td style=\"text-align: center;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">1<\/span><\/span><\/td>\n<td style=\"text-align: center;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">0<\/span><\/span><\/td>\n<td style=\"text-align: center;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">1<\/span><\/span><\/td>\n<td style=\"text-align: center; background-color: #aaffaa;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">0<\/span><\/span><\/td>\n<\/tr>\n<tr>\n<td style=\"text-align: center;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">0<\/span><\/span><\/td>\n<td style=\"text-align: center;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">1<\/span><\/span><\/td>\n<td style=\"text-align: center;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">1<\/span><\/span><\/td>\n<td style=\"text-align: center;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">0<\/span><\/span><\/td>\n<td style=\"text-align: center;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">1<\/span><\/span><\/td>\n<td style=\"text-align: center; background-color: #aaffaa;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">0<\/span><\/span><\/td>\n<\/tr>\n<tr>\n<td style=\"text-align: center;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">1<\/span><\/span><\/td>\n<td style=\"text-align: center;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">0<\/span><\/span><\/td>\n<td style=\"text-align: center;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">0<\/span><\/span><\/td>\n<td style=\"text-align: center;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">1<\/span><\/span><\/td>\n<td style=\"text-align: center;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">0<\/span><\/span><\/td>\n<td style=\"text-align: center; background-color: #aaffaa;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">0<\/span><\/span><\/td>\n<\/tr>\n<tr>\n<td style=\"text-align: center;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">1<\/span><\/span><\/td>\n<td style=\"text-align: center;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">1<\/span><\/span><\/td>\n<td style=\"text-align: center;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">1<\/span><\/span><\/td>\n<td style=\"text-align: center;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">1<\/span><\/span><\/td>\n<td style=\"text-align: center;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">0<\/span><\/span><\/td>\n<td style=\"text-align: center; background-color: #aaffaa;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">0<\/span><\/span><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p style=\"text-align: justify; color: #000000;\">Desta forma, o resultado \u00e9 uma contradi\u00e7\u00e3o.<\/p>\n<p>\u25a0 Fim do Exemplo<\/p>\n<p><a name=\"5\"><\/a><br \/>\n<\/br><\/br><\/p>\n<h2>Um Problema de Efici\u00eancia na Sem\u00e2ntica da L\u00f3gica Proposicional<\/h2>\n<p style=\"text-align: justify; color: #000000;\">Em teoria, podemos determinar se uma express\u00e3o \u00e9 v\u00e1lida, contingente ou insatisfat\u00edvel simplesmente calculando sua tabela de verdade, o que n\u00e3o \u00e9 especialmente dif\u00edcil; infelizmente, a facilidade de execu\u00e7\u00e3o tem um custo em termos de efici\u00eancia. Se temos uma express\u00e3o <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">F<\/span><\/span> composta por <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">n<\/span><\/span> express\u00f5es at\u00f4micas, ent\u00e3o teremos que calcular uma tabela de verdade com <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">2^n<\/span><\/span> linhas; assim, se, por exemplo, <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">F<\/span><\/span> for composta por 23 express\u00f5es at\u00f4micas, sua tabela de verdade ter\u00e1 8.388.608 linhas que precisam ser calculadas. Procedendo desta maneira, embora mec\u00e2nica e f\u00e1cil de realizar, a execu\u00e7\u00e3o rapidamente se torna impratic\u00e1vel \u00e0 medida que a complexidade das express\u00f5es aumenta. Devido a isso, um de nossos objetivos futuros ser\u00e1 encontrar uma maneira de resolver problemas de validade ou satisfatibilidade sem a necessidade de calcular tabelas de verdade. A busca por tais m\u00e9todos \u00e9 um dos problemas centrais de qualquer l\u00f3gica.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Sem\u00e2ntica da L\u00f3gica Proposicional RESUMONesta aula, estudamos a sem\u00e2ntica da l\u00f3gica proposicional, especificamente a atribui\u00e7\u00e3o de valores de verdade a uma express\u00e3o e como esses valores se propagam de uma express\u00e3o para outra atrav\u00e9s dos conectores l\u00f3gicos. Introduz-se a no\u00e7\u00e3o de tabelas de verdade e s\u00e3o apresentadas as tabelas de verdade dos conectores derivados, tais [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":28002,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"iawp_total_views":6,"footnotes":""},"categories":[607,621,571],"tags":[],"class_list":["post-28006","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-logica-matematica-pt","category-logica-proposicional-pt","category-matematica-pt"],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v26.7 - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>Sem\u00e2ntica da L\u00f3gica Proposicional - toposuranos.com\/material<\/title>\n<meta name=\"description\" content=\"Aprenda a sem\u00e2ntica da l\u00f3gica proposicional com este post. Explore atribui\u00e7\u00f5es de valores de verdade, tabelas de verdade para conectores l\u00f3gicos como nega\u00e7\u00e3o e conjun\u00e7\u00e3o, e descubra m\u00e9todos eficientes para determinar a validade ou satisfatibilidade de express\u00f5es l\u00f3gicas.\" \/>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/toposuranos.com\/material\/pt\/semantica-da-logica-proposicional\/\" \/>\n<meta property=\"og:locale\" content=\"es_ES\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Sem\u00e2ntica da L\u00f3gica Proposicional\" \/>\n<meta property=\"og:description\" content=\"Aprenda a sem\u00e2ntica da l\u00f3gica proposicional com este post. Explore atribui\u00e7\u00f5es de valores de verdade, tabelas de verdade para conectores l\u00f3gicos como nega\u00e7\u00e3o e conjun\u00e7\u00e3o, e descubra m\u00e9todos eficientes para determinar a validade ou satisfatibilidade de express\u00f5es l\u00f3gicas.\" \/>\n<meta property=\"og:url\" content=\"https:\/\/toposuranos.com\/material\/pt\/semantica-da-logica-proposicional\/\" \/>\n<meta property=\"og:site_name\" content=\"toposuranos.com\/material\" \/>\n<meta property=\"article:publisher\" content=\"https:\/\/www.facebook.com\/groups\/toposuranos\" \/>\n<meta property=\"article:published_time\" content=\"2021-02-19T13:00:00+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2024-08-16T04:18:06+00:00\" \/>\n<meta property=\"og:image\" content=\"http:\/\/toposuranos.com\/material\/wp-content\/uploads\/2021\/02\/semantica-1024x441.jpg\" \/>\n<meta name=\"author\" content=\"giorgio.reveco\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:title\" content=\"Sem\u00e2ntica da L\u00f3gica Proposicional\" \/>\n<meta name=\"twitter:description\" content=\"Aprenda a sem\u00e2ntica da l\u00f3gica proposicional com este post. Explore atribui\u00e7\u00f5es de valores de verdade, tabelas de verdade para conectores l\u00f3gicos como nega\u00e7\u00e3o e conjun\u00e7\u00e3o, e descubra m\u00e9todos eficientes para determinar a validade ou satisfatibilidade de express\u00f5es l\u00f3gicas.\" \/>\n<meta name=\"twitter:image\" content=\"https:\/\/toposuranos.com\/material\/wp-content\/uploads\/2021\/02\/semantica.jpg\" \/>\n<meta name=\"twitter:creator\" content=\"@topuranos\" \/>\n<meta name=\"twitter:site\" content=\"@topuranos\" \/>\n<meta name=\"twitter:label1\" content=\"Escrito por\" \/>\n\t<meta name=\"twitter:data1\" content=\"giorgio.reveco\" \/>\n\t<meta name=\"twitter:label2\" content=\"Tiempo de lectura\" \/>\n\t<meta name=\"twitter:data2\" content=\"9 minutos\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\/\/toposuranos.com\/material\/pt\/semantica-da-logica-proposicional\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/toposuranos.com\/material\/pt\/semantica-da-logica-proposicional\/\"},\"author\":{\"name\":\"giorgio.reveco\",\"@id\":\"https:\/\/toposuranos.com\/material\/#\/schema\/person\/e15164361c3f9a2a02cf6c234cf7fdc1\"},\"headline\":\"Sem\u00e2ntica da L\u00f3gica Proposicional\",\"datePublished\":\"2021-02-19T13:00:00+00:00\",\"dateModified\":\"2024-08-16T04:18:06+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/toposuranos.com\/material\/pt\/semantica-da-logica-proposicional\/\"},\"wordCount\":2348,\"commentCount\":0,\"publisher\":{\"@id\":\"https:\/\/toposuranos.com\/material\/#organization\"},\"image\":{\"@id\":\"https:\/\/toposuranos.com\/material\/pt\/semantica-da-logica-proposicional\/#primaryimage\"},\"thumbnailUrl\":\"https:\/\/toposuranos.com\/material\/wp-content\/uploads\/2021\/02\/semantica.jpg\",\"articleSection\":[\"L\u00f3gica Matem\u00e1tica\",\"L\u00f3gica Proposicional\",\"Matem\u00e1tica\"],\"inLanguage\":\"es\",\"potentialAction\":[{\"@type\":\"CommentAction\",\"name\":\"Comment\",\"target\":[\"https:\/\/toposuranos.com\/material\/pt\/semantica-da-logica-proposicional\/#respond\"]}]},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/toposuranos.com\/material\/pt\/semantica-da-logica-proposicional\/\",\"url\":\"https:\/\/toposuranos.com\/material\/pt\/semantica-da-logica-proposicional\/\",\"name\":\"Sem\u00e2ntica da L\u00f3gica Proposicional - toposuranos.com\/material\",\"isPartOf\":{\"@id\":\"https:\/\/toposuranos.com\/material\/#website\"},\"primaryImageOfPage\":{\"@id\":\"https:\/\/toposuranos.com\/material\/pt\/semantica-da-logica-proposicional\/#primaryimage\"},\"image\":{\"@id\":\"https:\/\/toposuranos.com\/material\/pt\/semantica-da-logica-proposicional\/#primaryimage\"},\"thumbnailUrl\":\"https:\/\/toposuranos.com\/material\/wp-content\/uploads\/2021\/02\/semantica.jpg\",\"datePublished\":\"2021-02-19T13:00:00+00:00\",\"dateModified\":\"2024-08-16T04:18:06+00:00\",\"description\":\"Aprenda a sem\u00e2ntica da l\u00f3gica proposicional com este post. Explore atribui\u00e7\u00f5es de valores de verdade, tabelas de verdade para conectores l\u00f3gicos como nega\u00e7\u00e3o e conjun\u00e7\u00e3o, e descubra m\u00e9todos eficientes para determinar a validade ou satisfatibilidade de express\u00f5es l\u00f3gicas.\",\"breadcrumb\":{\"@id\":\"https:\/\/toposuranos.com\/material\/pt\/semantica-da-logica-proposicional\/#breadcrumb\"},\"inLanguage\":\"es\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/toposuranos.com\/material\/pt\/semantica-da-logica-proposicional\/\"]}]},{\"@type\":\"ImageObject\",\"inLanguage\":\"es\",\"@id\":\"https:\/\/toposuranos.com\/material\/pt\/semantica-da-logica-proposicional\/#primaryimage\",\"url\":\"https:\/\/toposuranos.com\/material\/wp-content\/uploads\/2021\/02\/semantica.jpg\",\"contentUrl\":\"https:\/\/toposuranos.com\/material\/wp-content\/uploads\/2021\/02\/semantica.jpg\",\"width\":1317,\"height\":567},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/toposuranos.com\/material\/pt\/semantica-da-logica-proposicional\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Portada\",\"item\":\"https:\/\/toposuranos.com\/material\/es\/cursos-de-matematica-y-fisica\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Sem\u00e2ntica da L\u00f3gica Proposicional\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/toposuranos.com\/material\/#website\",\"url\":\"https:\/\/toposuranos.com\/material\/\",\"name\":\"toposuranos.com\/material\",\"description\":\"\",\"publisher\":{\"@id\":\"https:\/\/toposuranos.com\/material\/#organization\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/toposuranos.com\/material\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"es\"},{\"@type\":\"Organization\",\"@id\":\"https:\/\/toposuranos.com\/material\/#organization\",\"name\":\"toposuranos.com\/material\",\"url\":\"https:\/\/toposuranos.com\/material\/\",\"logo\":{\"@type\":\"ImageObject\",\"inLanguage\":\"es\",\"@id\":\"https:\/\/toposuranos.com\/material\/#\/schema\/logo\/image\/\",\"url\":\"http:\/\/toposuranos.com\/material\/wp-content\/uploads\/2023\/10\/logo.png\",\"contentUrl\":\"http:\/\/toposuranos.com\/material\/wp-content\/uploads\/2023\/10\/logo.png\",\"width\":2400,\"height\":2059,\"caption\":\"toposuranos.com\/material\"},\"image\":{\"@id\":\"https:\/\/toposuranos.com\/material\/#\/schema\/logo\/image\/\"},\"sameAs\":[\"https:\/\/www.facebook.com\/groups\/toposuranos\",\"https:\/\/x.com\/topuranos\",\"https:\/\/www.youtube.com\/channel\/UC16yDm12cPcrwsE0fAM7X1g\",\"https:\/\/www.linkedin.com\/company\/69429190\"]},{\"@type\":\"Person\",\"@id\":\"https:\/\/toposuranos.com\/material\/#\/schema\/person\/e15164361c3f9a2a02cf6c234cf7fdc1\",\"name\":\"giorgio.reveco\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"es\",\"@id\":\"https:\/\/toposuranos.com\/material\/#\/schema\/person\/image\/\",\"url\":\"http:\/\/toposuranos.com\/material\/wp-content\/uploads\/2023\/10\/1694478625378-96x96.jpeg\",\"contentUrl\":\"http:\/\/toposuranos.com\/material\/wp-content\/uploads\/2023\/10\/1694478625378-96x96.jpeg\",\"caption\":\"giorgio.reveco\"},\"description\":\"Soy Licenciado en F\u00edsica, Magister en Ingenier\u00eda Industrial y Docente Universitario. Me dedico a desmitificar la f\u00edsica y las matem\u00e1ticas. Mi objetivo es hacer que estos campos sean f\u00e1cilmente comprensibles para todos, proporcionando las herramientas para explorar no solo el mundo que nos rodea, sino tambi\u00e9n las profundidades de nuestra propia existencia y el orden natural que nos conecta con el cosmos.\",\"sameAs\":[\"http:\/\/toposuranos.com\/material\"],\"url\":\"https:\/\/toposuranos.com\/material\/author\/giorgio-reveco\/\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Sem\u00e2ntica da L\u00f3gica Proposicional - toposuranos.com\/material","description":"Aprenda a sem\u00e2ntica da l\u00f3gica proposicional com este post. Explore atribui\u00e7\u00f5es de valores de verdade, tabelas de verdade para conectores l\u00f3gicos como nega\u00e7\u00e3o e conjun\u00e7\u00e3o, e descubra m\u00e9todos eficientes para determinar a validade ou satisfatibilidade de express\u00f5es l\u00f3gicas.","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/toposuranos.com\/material\/pt\/semantica-da-logica-proposicional\/","og_locale":"es_ES","og_type":"article","og_title":"Sem\u00e2ntica da L\u00f3gica Proposicional","og_description":"Aprenda a sem\u00e2ntica da l\u00f3gica proposicional com este post. Explore atribui\u00e7\u00f5es de valores de verdade, tabelas de verdade para conectores l\u00f3gicos como nega\u00e7\u00e3o e conjun\u00e7\u00e3o, e descubra m\u00e9todos eficientes para determinar a validade ou satisfatibilidade de express\u00f5es l\u00f3gicas.","og_url":"https:\/\/toposuranos.com\/material\/pt\/semantica-da-logica-proposicional\/","og_site_name":"toposuranos.com\/material","article_publisher":"https:\/\/www.facebook.com\/groups\/toposuranos","article_published_time":"2021-02-19T13:00:00+00:00","article_modified_time":"2024-08-16T04:18:06+00:00","og_image":[{"url":"http:\/\/toposuranos.com\/material\/wp-content\/uploads\/2021\/02\/semantica-1024x441.jpg","type":"","width":"","height":""}],"author":"giorgio.reveco","twitter_card":"summary_large_image","twitter_title":"Sem\u00e2ntica da L\u00f3gica Proposicional","twitter_description":"Aprenda a sem\u00e2ntica da l\u00f3gica proposicional com este post. Explore atribui\u00e7\u00f5es de valores de verdade, tabelas de verdade para conectores l\u00f3gicos como nega\u00e7\u00e3o e conjun\u00e7\u00e3o, e descubra m\u00e9todos eficientes para determinar a validade ou satisfatibilidade de express\u00f5es l\u00f3gicas.","twitter_image":"https:\/\/toposuranos.com\/material\/wp-content\/uploads\/2021\/02\/semantica.jpg","twitter_creator":"@topuranos","twitter_site":"@topuranos","twitter_misc":{"Escrito por":"giorgio.reveco","Tiempo de lectura":"9 minutos"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/toposuranos.com\/material\/pt\/semantica-da-logica-proposicional\/#article","isPartOf":{"@id":"https:\/\/toposuranos.com\/material\/pt\/semantica-da-logica-proposicional\/"},"author":{"name":"giorgio.reveco","@id":"https:\/\/toposuranos.com\/material\/#\/schema\/person\/e15164361c3f9a2a02cf6c234cf7fdc1"},"headline":"Sem\u00e2ntica da L\u00f3gica Proposicional","datePublished":"2021-02-19T13:00:00+00:00","dateModified":"2024-08-16T04:18:06+00:00","mainEntityOfPage":{"@id":"https:\/\/toposuranos.com\/material\/pt\/semantica-da-logica-proposicional\/"},"wordCount":2348,"commentCount":0,"publisher":{"@id":"https:\/\/toposuranos.com\/material\/#organization"},"image":{"@id":"https:\/\/toposuranos.com\/material\/pt\/semantica-da-logica-proposicional\/#primaryimage"},"thumbnailUrl":"https:\/\/toposuranos.com\/material\/wp-content\/uploads\/2021\/02\/semantica.jpg","articleSection":["L\u00f3gica Matem\u00e1tica","L\u00f3gica Proposicional","Matem\u00e1tica"],"inLanguage":"es","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/toposuranos.com\/material\/pt\/semantica-da-logica-proposicional\/#respond"]}]},{"@type":"WebPage","@id":"https:\/\/toposuranos.com\/material\/pt\/semantica-da-logica-proposicional\/","url":"https:\/\/toposuranos.com\/material\/pt\/semantica-da-logica-proposicional\/","name":"Sem\u00e2ntica da L\u00f3gica Proposicional - toposuranos.com\/material","isPartOf":{"@id":"https:\/\/toposuranos.com\/material\/#website"},"primaryImageOfPage":{"@id":"https:\/\/toposuranos.com\/material\/pt\/semantica-da-logica-proposicional\/#primaryimage"},"image":{"@id":"https:\/\/toposuranos.com\/material\/pt\/semantica-da-logica-proposicional\/#primaryimage"},"thumbnailUrl":"https:\/\/toposuranos.com\/material\/wp-content\/uploads\/2021\/02\/semantica.jpg","datePublished":"2021-02-19T13:00:00+00:00","dateModified":"2024-08-16T04:18:06+00:00","description":"Aprenda a sem\u00e2ntica da l\u00f3gica proposicional com este post. Explore atribui\u00e7\u00f5es de valores de verdade, tabelas de verdade para conectores l\u00f3gicos como nega\u00e7\u00e3o e conjun\u00e7\u00e3o, e descubra m\u00e9todos eficientes para determinar a validade ou satisfatibilidade de express\u00f5es l\u00f3gicas.","breadcrumb":{"@id":"https:\/\/toposuranos.com\/material\/pt\/semantica-da-logica-proposicional\/#breadcrumb"},"inLanguage":"es","potentialAction":[{"@type":"ReadAction","target":["https:\/\/toposuranos.com\/material\/pt\/semantica-da-logica-proposicional\/"]}]},{"@type":"ImageObject","inLanguage":"es","@id":"https:\/\/toposuranos.com\/material\/pt\/semantica-da-logica-proposicional\/#primaryimage","url":"https:\/\/toposuranos.com\/material\/wp-content\/uploads\/2021\/02\/semantica.jpg","contentUrl":"https:\/\/toposuranos.com\/material\/wp-content\/uploads\/2021\/02\/semantica.jpg","width":1317,"height":567},{"@type":"BreadcrumbList","@id":"https:\/\/toposuranos.com\/material\/pt\/semantica-da-logica-proposicional\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Portada","item":"https:\/\/toposuranos.com\/material\/es\/cursos-de-matematica-y-fisica\/"},{"@type":"ListItem","position":2,"name":"Sem\u00e2ntica da L\u00f3gica Proposicional"}]},{"@type":"WebSite","@id":"https:\/\/toposuranos.com\/material\/#website","url":"https:\/\/toposuranos.com\/material\/","name":"toposuranos.com\/material","description":"","publisher":{"@id":"https:\/\/toposuranos.com\/material\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/toposuranos.com\/material\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"es"},{"@type":"Organization","@id":"https:\/\/toposuranos.com\/material\/#organization","name":"toposuranos.com\/material","url":"https:\/\/toposuranos.com\/material\/","logo":{"@type":"ImageObject","inLanguage":"es","@id":"https:\/\/toposuranos.com\/material\/#\/schema\/logo\/image\/","url":"http:\/\/toposuranos.com\/material\/wp-content\/uploads\/2023\/10\/logo.png","contentUrl":"http:\/\/toposuranos.com\/material\/wp-content\/uploads\/2023\/10\/logo.png","width":2400,"height":2059,"caption":"toposuranos.com\/material"},"image":{"@id":"https:\/\/toposuranos.com\/material\/#\/schema\/logo\/image\/"},"sameAs":["https:\/\/www.facebook.com\/groups\/toposuranos","https:\/\/x.com\/topuranos","https:\/\/www.youtube.com\/channel\/UC16yDm12cPcrwsE0fAM7X1g","https:\/\/www.linkedin.com\/company\/69429190"]},{"@type":"Person","@id":"https:\/\/toposuranos.com\/material\/#\/schema\/person\/e15164361c3f9a2a02cf6c234cf7fdc1","name":"giorgio.reveco","image":{"@type":"ImageObject","inLanguage":"es","@id":"https:\/\/toposuranos.com\/material\/#\/schema\/person\/image\/","url":"http:\/\/toposuranos.com\/material\/wp-content\/uploads\/2023\/10\/1694478625378-96x96.jpeg","contentUrl":"http:\/\/toposuranos.com\/material\/wp-content\/uploads\/2023\/10\/1694478625378-96x96.jpeg","caption":"giorgio.reveco"},"description":"Soy Licenciado en F\u00edsica, Magister en Ingenier\u00eda Industrial y Docente Universitario. Me dedico a desmitificar la f\u00edsica y las matem\u00e1ticas. Mi objetivo es hacer que estos campos sean f\u00e1cilmente comprensibles para todos, proporcionando las herramientas para explorar no solo el mundo que nos rodea, sino tambi\u00e9n las profundidades de nuestra propia existencia y el orden natural que nos conecta con el cosmos.","sameAs":["http:\/\/toposuranos.com\/material"],"url":"https:\/\/toposuranos.com\/material\/author\/giorgio-reveco\/"}]}},"_links":{"self":[{"href":"https:\/\/toposuranos.com\/material\/wp-json\/wp\/v2\/posts\/28006","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/toposuranos.com\/material\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/toposuranos.com\/material\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/toposuranos.com\/material\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/toposuranos.com\/material\/wp-json\/wp\/v2\/comments?post=28006"}],"version-history":[{"count":0,"href":"https:\/\/toposuranos.com\/material\/wp-json\/wp\/v2\/posts\/28006\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/toposuranos.com\/material\/wp-json\/wp\/v2\/media\/28002"}],"wp:attachment":[{"href":"https:\/\/toposuranos.com\/material\/wp-json\/wp\/v2\/media?parent=28006"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/toposuranos.com\/material\/wp-json\/wp\/v2\/categories?post=28006"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/toposuranos.com\/material\/wp-json\/wp\/v2\/tags?post=28006"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}