{"id":25118,"date":"2021-01-18T00:00:14","date_gmt":"2021-01-18T00:00:14","guid":{"rendered":"http:\/\/toposuranos.com\/material\/?p=25118"},"modified":"2024-08-28T19:16:13","modified_gmt":"2024-08-28T19:16:13","slug":"the-language-of-propositional-logic","status":"publish","type":"post","link":"http:\/\/toposuranos.com\/material\/en\/the-language-of-propositional-logic\/","title":{"rendered":"The Language of Propositional Logic"},"content":{"rendered":"<h1 style=\"text-align: center;\">The Language of Propositional Logic<\/h1>\n<h4 style=\"text-align: center;\">Summary<\/h4>\n<p style=\"text-align: center;\"><em>This note reviews the language of propositional logic as a metalanguage used to obtain valid expressions from the base language formed by two symbols. It explains the syntax rules, the concepts of propositional variables and connectors, and also introduces joint negation, the use of parentheses, and reordering to facilitate the reading of expressions. Additionally, the vocalization of propositional logic expressions is mentioned. Finally, the language of propositional logic is synthesized as a fundamental tool in mathematics and logic, and the possibility of finding a \u00abbase language of the base\u00bb from which everything else could be reconstructed is reflected upon.<\/em><\/p>\n<h4 style=\"text-align: center;\">Learning Objectives:<\/h4>\n<p style=\"text-align: justify;\"><em>Upon completing this section, the student is expected to be able to:<\/em><\/p>\n<ol style=\"text-align: justify;\">\n<li><strong>Understand<\/strong> the concept of metalanguage and its application in propositional logic.<\/li>\n<li><strong>Comprehend<\/strong> the syntax rules of the language of propositional logic.<\/li>\n<li><strong>Know<\/strong> the concept of propositional variables and their use in constructing expressions.<\/li>\n<li><strong>Understand<\/strong> the use of the connector and joint negation in the language of propositional logic.<\/li>\n<li><strong>Learn<\/strong> to use parentheses and reordering to facilitate the reading of expressions.<\/li>\n<li><strong>Know<\/strong> the vocalizations of propositional logic expressions.<\/li>\n<li><strong>Synthesize<\/strong> the language of propositional logic as a fundamental tool in mathematics and logic.<\/li>\n<li><strong>Reflect<\/strong> on the possibility of finding a \u00abbase language of the base\u00bb from which everything else could be reconstructed.<\/li>\n<li><strong>Apply<\/strong> the learned concepts in constructing propositional logic expressions.<\/li>\n<li><strong>Use<\/strong> the language of propositional logic to understand and solve mathematical and logical problems.<\/li>\n<\/ol>\n<h4 style=\"text-align: center;\">Table of Contents<\/h4>\n<p style=\"text-align:center;\">\n<a href=\"#1\"><strong>THE LANGUAGE OF PROPOSITIONAL LOGIC: ALPHABETS AND SYMBOL CHAINS<\/strong><\/a><br \/>\n<a href=\"#2\">LET\u2019S START WITH A SINGLE SYMBOL<\/a><br \/>\n<a href=\"#3\">LET&#8217;S THEN ADD A SECOND SYMBOL<\/a><br \/>\n<a href=\"#4\"><strong>THE LANGUAGE OF PROPOSITIONAL LOGIC: SYNTAX<\/strong><\/a><br \/>\n<a href=\"#5\">EXAMPLES OF SYNTAX REVIEW<\/a><br \/>\n<a href=\"#6\"><strong>NOTATION CONVENTIONS<\/strong><\/a><br \/>\n<a href=\"#7\">METAVARIABLES AND THE CONNECTOR <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\downarrow<\/span><\/span><\/a><br \/>\n<a href=\"#8\">EXAMPLES OF THE USE OF JOINT NEGATION<\/a><br \/>\n<a href=\"#9\">REORDERING AND PARENTHESES<\/a><br \/>\n<a href=\"#10\"><strong>DERIVED CONNECTORS<\/strong><\/a><br \/>\n<a href=\"#11\">VOCALIZATION OF PROPOSITIONAL LOGIC EXPRESSIONS<\/a><br \/>\n<a href=\"#12\"><strong>SYNTHESIS AND REFLECTIONS ON THE LANGUAGE OF PROPOSITIONAL LOGIC<\/strong><\/a><br \/>\n<a href=\"#13\">THE MATRIX BEHIND THE MATRIX BEHIND THE UNDERSTANDING OF ALL THINGS<\/a>\n<\/p>\n<p><iframe class=\"lazyload\" width=\"560\" height=\"315\" data-src=\"https:\/\/www.youtube.com\/embed\/WwBKcSXIznA\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture\" allowfullscreen=\"allowfullscreen\"><\/iframe><\/p>\n<p><a name=\"1\"><\/a><\/p>\n<h2>The Language of Propositional Logic: Alphabets and Symbol Chains<\/h2>\n<p><a name=\"2\"><\/a><\/p>\n<h3>Let\u2019s Start with a Single Symbol<\/h3>\n<p style=\"text-align: justify;\"><a href=\"https:\/\/www.youtube.com\/watch?v=WwBKcSXIznA&amp;t=37s\" target=\"_blank\" rel=\"noopener\"><strong>To build the Language of Propositional Logic<\/strong><\/a>, we will start our study with the simplest alphabet: one that has a single symbol. The shape of the symbol doesn\u2019t matter; the important thing is that it\u2019s unique. If we write using such an alphabet, the only thing that distinguishes one symbol chain from another is the number of times that symbol is repeated. Therefore, if we can write symbol chains of up to length <span class=\"katex-eq\" data-katex-display=\"false\">N<\/span>, we can only write <span class=\"katex-eq\" data-katex-display=\"false\">N<\/span> different chains. As you can see, this alphabet is quite limited, and there\u2019s not much more to say about it.<\/p>\n<p><a name=\"3\"><\/a><\/p>\n<h3>Let\u2019s Then Add a Second Symbol<\/h3>\n<p style=\"text-align: justify;\">If we add a second symbol to our alphabet, the writing becomes richer than in the previous alphabet. Now we can appreciate the way the symbols are arranged; for example, if <span class=\"katex-eq\" data-katex-display=\"false\">0<\/span> and <span class=\"katex-eq\" data-katex-display=\"false\">1<\/span> are our symbols, we can distinguish between <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">01<\/span><\/span> and <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">10<\/span><\/span>. Both chains involve the same symbols but in different orders. If the longest chain we can write is of length <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">N =1,2,3,\\cdots<\/span><\/span>, then we can write <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">2^1=2<\/span><\/span> chains of length <span class=\"katex-eq\" data-katex-display=\"false\">1<\/span>, <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">2^2=4<\/span><\/span> chains of length <span class=\"katex-eq\" data-katex-display=\"false\">2<\/span>, <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">2^3=8<\/span><\/span> chains of length <span class=\"katex-eq\" data-katex-display=\"false\">3<\/span>, and so on, in general <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">2^N<\/span><\/span> distinct chains of length <span class=\"katex-eq\" data-katex-display=\"false\">N<\/span>.<\/p>\n<p style=\"text-align: justify;\"><strong>Exercise:<\/strong> Write on a sheet of paper all the different chains that can be written with between <span class=\"katex-eq\" data-katex-display=\"false\">1<\/span> and <span class=\"katex-eq\" data-katex-display=\"false\">N<\/span> symbols. How many chains are written in total?<\/p>\n<p style=\"text-align: justify;\"><span style=\"color: #0000aa;\"><strong>Solution:<\/strong><\/span><br \/>\nIf <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">S_N<\/span><\/span> is the sum of all chains, of lengths <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">1, 2, 3, <\/span><\/span> and so on up to <span class=\"katex-eq\" data-katex-display=\"false\">N<\/span>, then we have already seen that:<\/p>\n<p style=\"text-align: justify;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\displaystyle S_N=2^1 + 2^2 + \\cdots +2^{N-1} + 2^N <\/span><\/span><\/p>\n<p style=\"text-align: justify;\">Multiplying the previous expression by 2, we have:<\/p>\n<p style=\"text-align: justify;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\displaystyle 2 S_N=2^2 + 2^3 + \\cdots + 2^N + 2^{N+1} <\/span><\/span><\/p>\n<p style=\"text-align: justify;\">And therefore:<\/p>\n<p style=\"text-align: justify;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\displaystyle S_N=2 S_N - S_N = 2^N-1 <\/span><\/span><\/p>\n<p style=\"text-align: justify;\">As a result, the total number of chains written on the sheet will be <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">2^N-1<\/span><\/span>.<\/p>\n<p><a name=\"4\"><\/a><\/p>\n<h2>The Language of Propositional Logic: Syntax<\/h2>\n<p style=\"text-align: justify;\"><a href=\"https:\/\/www.youtube.com\/watch?v=WwBKcSXIznA&amp;t=295s\" target=\"_blank\" rel=\"noopener\"><strong>We have seen that, with two symbols, we can distinguish one chain from another by their length and by the order in which they are arranged.<\/strong><\/a> This is important because it allows us to define a syntax for the alphabet we have built. A syntax is a set of rules that separates symbol chains into two categories: Expressions and Non-Expressions. If <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\mathcal{L}_2<\/span><\/span> is the set of all chains that can be constructed with the symbols <span class=\"katex-eq\" data-katex-display=\"false\">0<\/span> and <span class=\"katex-eq\" data-katex-display=\"false\">1<\/span>, then the syntax of <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\mathcal{L}_2<\/span><\/span> is a subset <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\mathcal{SL}_2\\subset\\mathcal{L}_2<\/span><\/span>.<\/p>\n<p style=\"text-align: justify;\">We can define the set <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\mathcal{SL}_2<\/span><\/span> with the following recursive rules:<\/p>\n<ol>\n<li style=\"text-align: justify;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">00, 11 \\in \\mathcal{SL}_2<\/span><\/span><\/li>\n<li style=\"text-align: justify;\">If <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\alpha, \\beta \\in \\mathcal{SL}_2<\/span><\/span>, then <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">01\\alpha\\beta \\in \\mathcal{SL}_2<\/span><\/span><\/li>\n<\/ol>\n<p style=\"text-align: justify;\">With these two rules, we can construct expressions of the language and verify whether a given chain is an expression of the language. A language is an alphabet with an associated syntax. The language presented here will be called the <em>\u00abBase Language of Two Symbols,\u00bb<\/em> or <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\mathcal{B}_2<\/span><\/span>.<\/p>\n<p><a name=\"5\"><\/a><\/p>\n<h3>Examples of Syntax Review<\/h3>\n<p style=\"text-align: justify;\">To make these ideas easier to understand, let&#8217;s review the following examples:<\/p>\n<p style=\"text-align: justify;\"><strong>Example:<\/strong> Given that <span style=\"color: #FF4500;\"><span class=\"katex-eq\" data-katex-display=\"false\">0000<\/span><\/span> and <span style=\"color: #DAA520;\"><span class=\"katex-eq\" data-katex-display=\"false\">1111<\/span><\/span> are contained in <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\mathcal{SL}_2<\/span><\/span>, it follows that <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">01<\/span><\/span><span style=\"color: #FF4500;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">00000100<\/span><\/span><\/span><span style=\"color: #DAA520;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">110111<\/span><\/span><\/span><span style=\"color: #FF4500;\"><span class=\"katex-eq\" data-katex-display=\"false\">0000<\/span><\/span> and <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">01<\/span><\/span><span style=\"color: #DAA520;\"><span class=\"katex-eq\" data-katex-display=\"false\">1111<\/span><\/span><span style=\"color: #DAA520;\"><span class=\"katex-eq\" data-katex-display=\"false\">1111<\/span><\/span> are in <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\mathcal{SL}_2<\/span><\/span>; therefore, they are expressions of <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\mathcal{B}_2<\/span><\/span>. This is demonstrated by applying the rules we have just introduced.<\/p>\n<p>End of the example <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\blacksquare<\/span><\/span><\/p>\n<p><strong>Exercise:<\/strong> In the previous example, we have seen how to construct expressions from two elementary expressions. While this is not a particularly complicated task, the reverse process, which involves demonstrating whether a certain expression is an expression, might be a bit more challenging.<\/p>\n<p style=\"text-align: justify;\"><span>Determine, using the syntax rules, whether the following chains are expressions of <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\mathcal{B}_2<\/span><\/span>:<\/span><\/p>\n<ol>\n<li>\n<p style=\"text-align: justify;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">012100<\/span><\/span><\/p>\n<\/li>\n<li>\n<p style=\"text-align: justify;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">101100<\/span><\/span><\/p>\n<\/li>\n<li>\n<p style=\"text-align: justify;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">0100010000<\/span><\/span><\/p>\n<\/li>\n<li>\n<p style=\"text-align: justify;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">0101000011<\/span><\/span><\/p>\n<\/li>\n<li>\n<p style=\"text-align: justify;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">01010000010000<\/span><\/span><\/p>\n<\/li>\n<li>\n<p style=\"text-align: justify;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">01010010000100101000011<\/span><\/span><\/p>\n<\/li>\n<\/ol>\n<p style=\"text-align: justify;\"><span style=\"color: #0000aa;\"><strong>Solution:<\/strong><\/span> Before looking at the solution, I recommend that you try it on your own first and then compare the results. If you&#8217;ve already done that, then go ahead \ud83d\udc4d<\/p>\n<ol>\n<li>\n<p style=\"text-align: justify;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">01<\/span><\/span><span class=\"katex-eq\" data-katex-display=\"false\">2<\/span><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">100<\/span><\/span>.<\/p>\n<p style=\"text-align: justify;\">As we can see, this includes the symbol <span class=\"katex-eq\" data-katex-display=\"false\">2<\/span>, which is not contained in <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\mathcal{L}_2<\/span><\/span>; therefore, this chain cannot be contained in <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\mathcal{SL}_2<\/span><\/span> and is not an expression of <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\mathcal{B}_2<\/span><\/span>.<\/p>\n<\/li>\n<li>\n<p style=\"text-align: justify;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">10<\/span><\/span><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">1100<\/span><\/span>.<\/p>\n<p style=\"text-align: justify;\">Here, we see that this chain starts with <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">10<\/span><\/span>. From the syntax rules, we can infer that all chains longer than 2 must, by necessity, start with <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">01<\/span><\/span>; therefore, it cannot be an expression of <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\mathcal{B}_2<\/span><\/span>.<\/p>\n<\/li>\n<li>\n<p style=\"text-align: justify;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">0100010000<\/span><\/span><\/p>\n<p style=\"text-align: justify;\">This chain starts with <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">01<\/span><\/span>, so it passes the first test. To be an expression of <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\mathcal{L}_2<\/span><\/span>, it is necessary that the part marked in blue can be uniquely decomposed into two expressions.<span><\/span><\/p>\n<p style=\"text-align: center;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">01<\/span><\/span><span style=\"color: #007ACC;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">00010000<\/span><\/span><\/span><\/p>\n<p style=\"text-align: justify;\"><span>If the decomposition is not unique even while complying with the syntax laws, then the defined syntax is ambiguous and needs to be corrected.<\/span><\/p>\n<p style=\"text-align: justify;\">Analyzing the blue part, the following possible separations are obtained:<\/p>\n<table>\n<tbody>\n<tr>\n<td><span style=\"color: #DAA520;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">0<\/span><\/span><\/span><span style=\"color: #007ACC;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">0010000<\/span><\/span><\/span><\/td>\n<td><span style=\"color: #DAA520;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">00<\/span><\/span><\/span><span style=\"color: #007ACC;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">010000<\/span><\/span><\/span><\/td>\n<td><span style=\"color: #DAA520;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">000<\/span><\/span><\/span><span style=\"color: #007ACC;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">10000<\/span><\/span><\/span><\/td>\n<\/tr>\n<tr>\n<td><span style=\"color: #DAA520;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">0001<\/span><\/span><\/span><span style=\"color: #007ACC;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">0000<\/span><\/span><\/span><\/td>\n<td><span style=\"color: #DAA520;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">00010<\/span><\/span><\/span><span style=\"color: #007ACC;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">000<\/span><\/span><\/span><\/td>\n<td><span style=\"color: #DAA520;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">000100<\/span><\/span><\/span><span style=\"color: #007ACC;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">00<\/span><\/span><\/span><\/td>\n<\/tr>\n<tr>\n<td><span style=\"color: #DAA520;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">0001000<\/span><\/span><\/span><span style=\"color: #007ACC;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">0<\/span><\/span><\/span><\/td>\n<td><\/td>\n<td><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p style=\"text-align: justify;\">In this part, we must note that if the golden part is not <span class=\"katex-eq\" data-katex-display=\"false\">0000<\/span> or <span class=\"katex-eq\" data-katex-display=\"false\">1111<\/span>, then the corresponding blue part must start with <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">01<\/span><\/span> for the entire chain to be an expression. Therefore, the following eliminations can be made:<\/p>\n<table>\n<tbody>\n<tr>\n<td><span style=\"color: #DAA520;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">0<\/span><\/span><\/span><span style=\"color: #007ACC;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">0010000<\/span><\/span><\/span>\u274c<\/td>\n<td><span style=\"color: #DAA520;\"><span class=\"katex-eq\" data-katex-display=\"false\">00<\/span><\/span><span style=\"color: #007ACC;\" dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">010000<\/span><\/span>\u2705<\/td>\n<td><span style=\"color: #DAA520;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">000<\/span><\/span><\/span><span style=\"color: #007ACC;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">10000<\/span><\/span><\/span>\u274c<\/td>\n<\/tr>\n<tr>\n<td><span style=\"color: #DAA520;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">0001<\/span><\/span><\/span><span style=\"color: #007ACC;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">0000<\/span><\/span><\/span>\u274c<\/td>\n<td><span style=\"color: #DAA520;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">00010<\/span><\/span><\/span><span style=\"color: #007ACC;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">000<\/span><\/span><\/span>\u274c<\/td>\n<td><span style=\"color: #DAA520;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">000100<\/span><\/span><\/span><span style=\"color: #007ACC;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">00<\/span><\/span><\/span>\u274c<\/td>\n<\/tr>\n<tr>\n<td><span style=\"color: #DAA520;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">0001000<\/span><\/span><\/span><span style=\"color: #007ACC;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">0<\/span><\/span><\/span>\u274c<\/td>\n<td><\/td>\n<td><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p style=\"text-align: justify;\">This is why the only separation that survives this analysis is <span style=\"color: #DAA520;\"><span class=\"katex-eq\" data-katex-display=\"false\">00<\/span><\/span><span style=\"color: #007ACC;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">010000<\/span><\/span><\/span>, where the golden part is an expression and the blue part is uniquely and consistently separated according to the syntax. Finally, the chain <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">0100010000<\/span><\/span> admits a unique and consistent decomposition with the syntax, which is <span class=\"katex-eq\" data-katex-display=\"false\">01<\/span><span style=\"color: #DAA520;\"><span class=\"katex-eq\" data-katex-display=\"false\">00<\/span><\/span><span style=\"color: #007ACC;\" dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">010000<\/span><\/span>, and therefore is an expression of the language <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\mathcal{B}_2<\/span><\/span>.<\/p>\n<\/li>\n<li>\n<p style=\"text-align: justify;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">0101000011<\/span><\/span><\/p>\n<p style=\"text-align: justify;\">For this chain, we can make the following separation, which I will mark with colors:<\/p>\n<p style=\"text-align: center;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">01<\/span><\/span><span style=\"color: #007ACC;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">010000<\/span><\/span><\/span><span style=\"color: #DAA520;\"><span class=\"katex-eq\" data-katex-display=\"false\">1111<\/span><\/span><\/p>\n<p style=\"text-align: justify;\">According to the syntax rules, for a chain longer than 2 to be an expression, it must begin with <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">01<\/span><\/span>, and after that, there must follow two expressions, which I have marked in blue and gold. It is easy to see that this separation is unique because if the blue or gold areas change length, any such change would mean that both parts would no longer be expressions simultaneously.<\/p>\n<\/li>\n<li>\n<p style=\"text-align: justify;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">01010000010000<\/span><\/span><\/p>\n<p style=\"text-align: justify;\">Reviewing from right to left, we can find the following separation:<\/p>\n<p style=\"text-align: center;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\underbrace{01\\underbrace{01\\overbrace{00}\\overbrace{00}}_{{expression}}\\underbrace{01\\overbrace{00}\\overbrace{00}}_{{expression}}}_{{expression}}<\/span><\/span><\/p>\n<\/li>\n<li>\n<p style=\"text-align: justify;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">01010010000100101000011<\/span><\/span><\/p>\n<p style=\"text-align: justify;\">A sharp eye will notice that this chain has a length of 23 and that it is impossible to construct a chain of odd length through the syntax laws of <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\mathcal{L}_2<\/span><\/span>, which constructs expressions by juxtaposing chains of even length. All chains of <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\mathcal{SL}_2<\/span><\/span> have an even length; therefore, <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">01010010000100101000011<\/span><\/span> is not an expression of <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\mathcal{B}_2<\/span><\/span>.<\/p>\n<\/li>\n<\/ol>\n<p>End of the exercise <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\blacksquare<\/span><\/span><\/p>\n<figure id=\"attachment_25115\" aria-describedby=\"caption-attachment-25115\" style=\"width: 600px\" class=\"wp-caption aligncenter\"><img decoding=\"async\" src=\"data:image\/gif;base64,R0lGODlhAQABAIAAAAAAAP\/\/\/yH5BAEAAAAALAAAAAABAAEAAAIBRAA7\" data-src=\"http:\/\/toposuranos.com\/material\/wp-content\/uploads\/2023\/11\/simbolos.jpg\" alt=\"a tablet with many decoded symbols\" width=\"1081\" height=\"399\" class=\"size-full wp-image-25115 lazyload\" \/><figcaption id=\"caption-attachment-25115\" class=\"wp-caption-text\"><noscript><img decoding=\"async\" src=\"http:\/\/toposuranos.com\/material\/wp-content\/uploads\/2023\/11\/simbolos.jpg\" alt=\"a tablet with many decoded symbols\" width=\"1081\" height=\"399\" class=\"size-full wp-image-25115 lazyload\" srcset=\"http:\/\/toposuranos.com\/material\/wp-content\/uploads\/2023\/11\/simbolos.jpg 1081w, http:\/\/toposuranos.com\/material\/wp-content\/uploads\/2023\/11\/simbolos-300x111.jpg 300w, http:\/\/toposuranos.com\/material\/wp-content\/uploads\/2023\/11\/simbolos-1024x378.jpg 1024w, http:\/\/toposuranos.com\/material\/wp-content\/uploads\/2023\/11\/simbolos-768x283.jpg 768w\" sizes=\"(max-width: 1081px) 100vw, 1081px\" \/><\/noscript><\/figcaption><\/figure>\n<p><a name=\"6\"><\/a><\/p>\n<h2>Notation Conventions<\/h2>\n<p style=\"text-align: justify;\"><a href=\"https:\/\/www.youtube.com\/watch?v=WwBKcSXIznA&amp;t=918s\" target=\"_blank\" rel=\"noopener\"><strong>Working with zeros and ones can be confusing to our perception<\/strong><\/a> and can lead us to make mistakes. To make the process more friendly to the way humans interpret things, we can use notation conventions and some metasymbols.<\/p>\n<p><a name=\"7\"><\/a><\/p>\n<h3>Metavariables and the Connector <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\downarrow<\/span><\/span><\/h3>\n<p style=\"text-align: justify;\"><a href=\"https:\/\/www.youtube.com\/watch?v=WwBKcSXIznA&amp;t=950s\" target=\"_blank\" rel=\"noopener\"><strong>A metasymbol is a symbol used to represent chains of symbols from a target language.<\/strong><\/a> For example, when defining the syntax <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\mathcal{SL}_2<\/span><\/span> of <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\mathcal{L}_2<\/span><\/span>, the symbols <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\alpha<\/span><\/span> and <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\beta<\/span><\/span> were used to represent expressions of <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\mathcal{B}_2<\/span><\/span>. These symbols are called <strong>metavariables of <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\mathcal{B}_2<\/span><\/span>:<\/strong> metasymbols that, when all replaced by expressions of the language, generate another expression of the language through syntax, as established by the second rule on the elements of <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\mathcal{SL}_2<\/span><\/span>:<\/p>\n<p style=\"text-align: center;\">If <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\alpha,\\beta \\in \\mathcal{SL}_2<\/span><\/span>, then <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">01\\alpha\\beta \\in\\mathcal{SL}_2<\/span><\/span><\/p>\n<p style=\"text-align: justify;\">For this reason, these metavariables are called <strong>metaexpressions of <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\mathcal{B}_2<\/span><\/span>.<\/strong><\/p>\n<p style=\"text-align: justify;\">To facilitate our writing from now on, we will use the metasymbol <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\downarrow<\/span><\/span> to represent the chain <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">01<\/span><\/span>. This metasymbol is what we call a <strong>connector<\/strong> and is known as <strong>Joint Negation<\/strong> for semantic reasons.<\/p>\n<p style=\"text-align: justify;\">With this, we can express the syntax <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\mathcal{SL}_2<\/span><\/span> in a metalanguage through the following recursive rules:<\/p>\n<ol>\n<li>\n<p style=\"text-align: justify;\">All metavariables of <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\mathcal{B}_2<\/span><\/span> are metaexpressions of <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\mathcal{B}_2<\/span><\/span>.<\/p>\n<\/li>\n<li>\n<p style=\"text-align: justify;\">If <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\alpha<\/span><\/span> and <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\beta<\/span><\/span> are metavariables of <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\mathcal{B}_2<\/span><\/span>, then <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\downarrow\\alpha\\beta<\/span><\/span> is a metaexpression of <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\mathcal{B}_2<\/span><\/span>.<\/p>\n<\/li>\n<\/ol>\n<p style=\"text-align: justify;\">With these rules, we can write metaexpressions that, when all their metavariables are replaced by expressions and <strong>connectors<\/strong> in their form represented by zeros and ones, yield an expression of <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\mathcal{B}_2<\/span><\/span>. Each metaexpression of this type refers to an infinite family of expressions of <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\mathcal{B}_2<\/span><\/span>: the set of all expressions of <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\mathcal{B}_2<\/span><\/span> that can be represented by that structure. This is precisely what it means to have a formal language.<\/p>\n<p><a name=\"8\"><\/a><\/p>\n<h4>Examples of the Use of Joint Negation<\/h4>\n<p style=\"text-align: justify;\"><strong>Example:<\/strong> <span> From the metaexpression <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\downarrow\\alpha\\downarrow\\beta\\gamma<\/span><\/span>, the following expressions can be obtained through substitutions:<\/span><\/p>\n<ol>\n<li>\n<p style=\"text-align: justify;\">Replacing <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\alpha := 00<\/span><\/span>, <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\beta := 011100<\/span><\/span> and <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\gamma := 010011<\/span><\/span><\/p>\n<p style=\"text-align: justify;\">Leads to the expression:<\/p>\n<p style=\"text-align: center;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">010001011100010011<\/span><\/span><\/p>\n<\/li>\n<li>\n<p style=\"text-align: justify;\">If we substitute <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\alpha := 011100<\/span><\/span>, <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\beta := 0111011100<\/span><\/span> and <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\gamma := 0111010011<\/span><\/span><\/p>\n<p style=\"text-align: justify;\">It generates:<\/p>\n<p style=\"text-align: center;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">010111000101110111000111010011<\/span><\/span><\/p>\n<\/li>\n<\/ol>\n<p style=\"text-align: justify;\">The metaexpression <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\downarrow\\alpha\\downarrow\\beta\\gamma<\/span><\/span> is not only easier to assimilate than any other expression that satisfies its form, but it also represents all the expressions that can be obtained by replacing its metavariables with expressions.<\/p>\n<p>End of the example <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\blacksquare<\/span><\/span><\/p>\n<p style=\"text-align: justify;\">When replacing a metavariable, it is replaced in all places where it appears.<\/p>\n<p style=\"text-align: justify;\"><strong>Example:<\/strong> <span> Consider the metaexpression <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\downarrow\\downarrow\\alpha\\beta\\downarrow\\alpha\\gamma<\/span><\/span>.<\/span><\/p>\n<ol>\n<li>If we replace <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\alpha:=11<\/span><\/span>, we get:\n<p style=\"text-align: center;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\downarrow\\downarrow 11\\beta\\downarrow 11\\gamma<\/span><\/span><\/p>\n<\/li>\n<li>If we now set <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\beta:=011100<\/span><\/span>, the result will be:\n<p style=\"text-align: center;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\downarrow\\downarrow 11011100\\downarrow 11\\gamma<\/span><\/span><\/p>\n<\/li>\n<li>And if we now make the change <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\gamma:=011111<\/span><\/span>, we will have:\n<p style=\"text-align: center;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\downarrow\\downarrow 11011100\\downarrow 11011111<\/span><\/span><\/p>\n<\/li>\n<li>Finally, by changing <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\downarrow:=01<\/span><\/span>, we will conclude with this expression:\n<p style=\"text-align: center;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">0101110111000111011111<\/span><\/span><\/p>\n<\/li>\n<\/ol>\n<p>End of the example <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\blacksquare<\/span><\/span><\/p>\n<p><a name=\"9\"><\/a><\/p>\n<h3>Reordering and Parentheses<\/h3>\n<p style=\"text-align: justify;\">Verifying that this is a metaexpression is not particularly difficult, but it does require constant attention to the number of metasymbols and the scope of the connector <span class=\"katex-eq\" data-katex-display=\"false\">\\downarrow<\/span>. This difficulty rapidly increases with the length of the metaexpression. This raises the valid question of whether there is a way to represent these things in a way that is easier to verify, and the answer is yes; indeed, we can use parentheses and appropriate reordering for the metaexpression that better aligns with our natural way of grouping things. To establish this point, let&#8217;s examine the following metaexpression:<\/p>\n<p style=\"text-align: center;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\downarrow\\alpha\\downarrow\\downarrow\\alpha\\beta\\alpha<\/span><\/span><\/p>\n<p style=\"text-align: justify;\">It turns out that, while it is not particularly difficult to verify that this is a metaexpression, it is not something we can do without having to count symbols and risking losing track in the process, and the risk grows rapidly as the length of the metaexpression increases. Is there a way to represent the same thing in a more readable manner? The fact is that such a method exists and it aligns with our natural way of grouping things. For this, we introduce parentheses and reordering through the following notation convention:<\/p>\n<p style=\"text-align: center;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\downarrow\\alpha\\beta:=(\\alpha\\downarrow\\beta)<\/span><\/span><\/p>\n<p style=\"text-align: justify;\"><strong>Example:<\/strong> Consider the metaexpression <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\downarrow\\alpha\\downarrow\\downarrow\\beta\\gamma\\delta<\/span><\/span>. If we apply the introduction of parentheses and reordering, then it will transform as follows:<\/p>\n<table>\n<tbody>\n<tr>\n<td><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\downarrow\\alpha\\downarrow<\/span><\/span><span style=\"color: #FF4500;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\downarrow\\beta\\gamma<\/span><\/span><\/span><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\delta<\/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\">\\downarrow\\alpha\\downarrow<\/span><\/span><span style=\"color: #FF4500;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">(\\beta\\downarrow \\gamma)<\/span><\/span><\/span><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\delta<\/span><\/span><\/td>\n<\/tr>\n<tr>\n<td><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\downarrow\\alpha<\/span><\/span><span style=\"color: #FF4500;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\downarrow(\\beta\\downarrow \\gamma)\\delta<\/span><\/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\">\\downarrow\\alpha<\/span><\/span><span style=\"color: #FF4500;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">((\\beta\\downarrow \\gamma)\\downarrow\\delta)<\/span><\/span><\/span><\/td>\n<\/tr>\n<tr>\n<td><span style=\"color: #FF4500;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\downarrow\\alpha((\\beta\\downarrow \\gamma)\\downarrow\\delta)<\/span><\/span><\/span><\/td>\n<td><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">:=<\/span><\/span><\/td>\n<td><span style=\"color: #FF4500;\"><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">(\\alpha \\downarrow((\\beta\\downarrow \\gamma)\\downarrow\\delta))<\/span><\/span><\/span> \u2705<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p style=\"text-align: justify;\">This final metaexpression is much easier to read and verify than the original, because each block of parentheses is a metaexpression that is composed of easily distinguishable elements: a joint negation in the center and a metaexpression on each side.<\/p>\n<p>End of the example <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\blacksquare<\/span><\/span><\/p>\n<p><a name=\"10\"><\/a><\/p>\n<h3>Derived Connectors<\/h3>\n<p style=\"text-align: justify;\"><a href=\"https:\/\/www.youtube.com\/watch?v=WwBKcSXIznA&amp;t=1478s\" target=\"_blank\" rel=\"noopener\"><strong>Both in logic and in the rest of mathematics,<\/strong><\/a> certain combinations of connectors are frequently used. For this reason, to make writing even more convenient (for humans), derived connectors are introduced through the following notation conventions:<\/p>\n<table>\n<tbody>\n<tr>\n<td><strong>Negation:<\/strong><\/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>Inclusive Disjunction:<\/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>Conjunction:<\/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>Implication:<\/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>Biconditional:<\/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>Exclusive Disjunction:<\/strong><\/td>\n<td><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">(\\alpha \\veebar \\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;\">This metalanguage we have constructed on the <strong>base language of two symbols<\/strong> is what is known as the <strong>Zero-Order Language of Propositional Logic.<\/strong> Through this language, all expressions of propositional logic are represented in a precise and unambiguous manner.<\/p>\n<p><a name=\"11\"><\/a><\/p>\n<h2>Vocalization of Propositional Logic Expressions<\/h2>\n<p style=\"text-align: justify;\">Although it is not necessary for doing logic, it is important to remember that our communication is not based solely on written symbols; we also have a natural tendency to vocalize things in our natural language. Therefore, for the expressions of the language of propositional logic, there are vocalizations that evoke ideas similar to those treated by their counterparts in propositional logic. These vocalizations are as follows:<\/p>\n<table>\n<tbody>\n<tr>\n<td><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">(\\alpha \\downarrow \\beta)<\/span><\/span><\/td>\n<td>Neither <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\alpha<\/span><\/span> nor <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\beta<\/span><\/span><\/td>\n<\/tr>\n<tr>\n<td><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\neg \\alpha<\/span><\/span><\/td>\n<td>Negation of <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\alpha<\/span><\/span><\/td>\n<\/tr>\n<tr>\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\">\\alpha<\/span><\/span> or <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\beta<\/span><\/span><\/td>\n<\/tr>\n<tr>\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\">\\alpha<\/span><\/span> and <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\beta<\/span><\/span><\/td>\n<\/tr>\n<tr>\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\">\\alpha<\/span><\/span> implies <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\beta<\/span><\/span><\/td>\n<\/tr>\n<tr>\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\">\\alpha<\/span><\/span> if and only if <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\beta<\/span><\/span><\/td>\n<\/tr>\n<tr>\n<td><span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">(\\alpha \\veebar \\beta)<\/span><\/span><\/td>\n<td>Either <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\alpha<\/span><\/span> or <span dir=\"ltr\"><span class=\"katex-eq\" data-katex-display=\"false\">\\beta<\/span><\/span>, but not both<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p><a name=\"12\"><\/a><\/p>\n<h2>Synthesis and Reflections on the Language of Propositional Logic<\/h2>\n<p style=\"text-align: justify;\">With this final part, the construction of the language of propositional logic concludes, which we can summarize as a metalanguage that allows us to obtain valid expressions in the base language of two symbols. The language of propositional logic is a formal language since it defines the structure (or form) of the expressions in the base language, and each of its expressions determines the form of an infinite family of expressions in the base language. As mentioned earlier, the syntax of a formal language is extremely rigid, but in exchange, it is precise and exact: it has no ambiguity.<\/p>\n<p><a name=\"13\"><\/a><\/p>\n<h3>The Matrix Behind the Matrix Behind the Understanding of All Things<\/h3>\n<p style=\"text-align: justify;\"><span style=\"\">One last thing. Propositional logic and mathematics rely heavily on propositional logic, which, in turn, is built upon a base language formed by ones and zeros. Does this mean that through this, we have reached the \u00abMatrix\u00bb behind logic and mathematics? It is possible. But it is also possible to consider a base language for the base language, from which it would be possible to reconstruct everything else; however, to find such a language, we would need to find notions even more fundamental than the concepts of order and quantity (which were used to establish the first base language). Finding a base language for the base involves reflecting on the most fundamental aspects of what it means to \u00abunderstand things.\u00bb If you dig deeper, if you manage to reach the bottom, we could say that you have managed to see \u00abthe Matrix behind the Matrix behind the understanding of all things,\u00bb and it is possible that this foundational process can be continued infinitely, providing a new layer of depth of knowledge with each foundational step.<\/span><\/p>\n","protected":false},"excerpt":{"rendered":"<p>The Language of Propositional Logic Summary This note reviews the language of propositional logic as a metalanguage used to obtain valid expressions from the base language formed by two symbols. It explains the syntax rules, the concepts of propositional variables and connectors, and also introduces joint negation, the use of parentheses, and reordering to facilitate [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":25112,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"iawp_total_views":15,"footnotes":""},"categories":[605,567,619],"tags":[],"class_list":["post-25118","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-mathematical-logic","category-mathematics","category-propositional-logic"],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v27.4 - https:\/\/yoast.com\/product\/yoast-seo-wordpress\/ -->\n<title>The Language of Propositional Logic - toposuranos.com\/material<\/title>\n<meta name=\"description\" content=\"Detailed exploration of the language of propositional logic, including concepts of metalanguage, syntax, propositional variables, and connectors.\" \/>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"http:\/\/toposuranos.com\/material\/en\/the-language-of-propositional-logic\/\" \/>\n<meta property=\"og:locale\" content=\"es_ES\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"The Language of Propositional Logic\" \/>\n<meta property=\"og:description\" content=\"Detailed exploration of the language of propositional logic, including concepts of metalanguage, syntax, propositional variables, and connectors.\" \/>\n<meta property=\"og:url\" content=\"http:\/\/toposuranos.com\/material\/en\/the-language-of-propositional-logic\/\" \/>\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-01-18T00:00:14+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2024-08-28T19:16:13+00:00\" \/>\n<meta property=\"og:image\" content=\"http:\/\/toposuranos.com\/material\/wp-content\/uploads\/2023\/11\/lenguajedelalogicaproposicional-1.jpg\" \/>\n\t<meta property=\"og:image:width\" content=\"1081\" \/>\n\t<meta property=\"og:image:height\" content=\"399\" \/>\n\t<meta property=\"og:image:type\" content=\"image\/jpeg\" \/>\n<meta name=\"author\" content=\"giorgio.reveco\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:title\" content=\"The Language of Propositional Logic\" \/>\n<meta name=\"twitter:description\" content=\"Detailed exploration of the language of propositional logic, including concepts of metalanguage, syntax, propositional variables, and connectors.\" \/>\n<meta name=\"twitter:image\" content=\"http:\/\/toposuranos.com\/material\/wp-content\/uploads\/2023\/11\/lenguajedelalogicaproposicional-1.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=\"14 minutos\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\\\/\\\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"http:\\\/\\\/toposuranos.com\\\/material\\\/en\\\/the-language-of-propositional-logic\\\/#article\",\"isPartOf\":{\"@id\":\"http:\\\/\\\/toposuranos.com\\\/material\\\/en\\\/the-language-of-propositional-logic\\\/\"},\"author\":{\"name\":\"giorgio.reveco\",\"@id\":\"http:\\\/\\\/toposuranos.com\\\/material\\\/#\\\/schema\\\/person\\\/e15164361c3f9a2a02cf6c234cf7fdc1\"},\"headline\":\"The Language of Propositional Logic\",\"datePublished\":\"2021-01-18T00:00:14+00:00\",\"dateModified\":\"2024-08-28T19:16:13+00:00\",\"mainEntityOfPage\":{\"@id\":\"http:\\\/\\\/toposuranos.com\\\/material\\\/en\\\/the-language-of-propositional-logic\\\/\"},\"wordCount\":3122,\"commentCount\":0,\"publisher\":{\"@id\":\"http:\\\/\\\/toposuranos.com\\\/material\\\/#organization\"},\"image\":{\"@id\":\"http:\\\/\\\/toposuranos.com\\\/material\\\/en\\\/the-language-of-propositional-logic\\\/#primaryimage\"},\"thumbnailUrl\":\"http:\\\/\\\/toposuranos.com\\\/material\\\/wp-content\\\/uploads\\\/2023\\\/11\\\/lenguajedelalogicaproposicional.jpg\",\"articleSection\":[\"Mathematical Logic\",\"Mathematics\",\"Propositional Logic\"],\"inLanguage\":\"es\",\"potentialAction\":[{\"@type\":\"CommentAction\",\"name\":\"Comment\",\"target\":[\"http:\\\/\\\/toposuranos.com\\\/material\\\/en\\\/the-language-of-propositional-logic\\\/#respond\"]}]},{\"@type\":\"WebPage\",\"@id\":\"http:\\\/\\\/toposuranos.com\\\/material\\\/en\\\/the-language-of-propositional-logic\\\/\",\"url\":\"http:\\\/\\\/toposuranos.com\\\/material\\\/en\\\/the-language-of-propositional-logic\\\/\",\"name\":\"The Language of Propositional Logic - toposuranos.com\\\/material\",\"isPartOf\":{\"@id\":\"http:\\\/\\\/toposuranos.com\\\/material\\\/#website\"},\"primaryImageOfPage\":{\"@id\":\"http:\\\/\\\/toposuranos.com\\\/material\\\/en\\\/the-language-of-propositional-logic\\\/#primaryimage\"},\"image\":{\"@id\":\"http:\\\/\\\/toposuranos.com\\\/material\\\/en\\\/the-language-of-propositional-logic\\\/#primaryimage\"},\"thumbnailUrl\":\"http:\\\/\\\/toposuranos.com\\\/material\\\/wp-content\\\/uploads\\\/2023\\\/11\\\/lenguajedelalogicaproposicional.jpg\",\"datePublished\":\"2021-01-18T00:00:14+00:00\",\"dateModified\":\"2024-08-28T19:16:13+00:00\",\"description\":\"Detailed exploration of the language of propositional logic, including concepts of metalanguage, syntax, propositional variables, and connectors.\",\"breadcrumb\":{\"@id\":\"http:\\\/\\\/toposuranos.com\\\/material\\\/en\\\/the-language-of-propositional-logic\\\/#breadcrumb\"},\"inLanguage\":\"es\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"http:\\\/\\\/toposuranos.com\\\/material\\\/en\\\/the-language-of-propositional-logic\\\/\"]}]},{\"@type\":\"ImageObject\",\"inLanguage\":\"es\",\"@id\":\"http:\\\/\\\/toposuranos.com\\\/material\\\/en\\\/the-language-of-propositional-logic\\\/#primaryimage\",\"url\":\"http:\\\/\\\/toposuranos.com\\\/material\\\/wp-content\\\/uploads\\\/2023\\\/11\\\/lenguajedelalogicaproposicional.jpg\",\"contentUrl\":\"http:\\\/\\\/toposuranos.com\\\/material\\\/wp-content\\\/uploads\\\/2023\\\/11\\\/lenguajedelalogicaproposicional.jpg\",\"width\":1081,\"height\":399,\"caption\":\"toposuranos.com\"},{\"@type\":\"BreadcrumbList\",\"@id\":\"http:\\\/\\\/toposuranos.com\\\/material\\\/en\\\/the-language-of-propositional-logic\\\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Portada\",\"item\":\"http:\\\/\\\/toposuranos.com\\\/material\\\/es\\\/cursos-de-matematica-y-fisica\\\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"The Language of Propositional Logic\"}]},{\"@type\":\"WebSite\",\"@id\":\"http:\\\/\\\/toposuranos.com\\\/material\\\/#website\",\"url\":\"http:\\\/\\\/toposuranos.com\\\/material\\\/\",\"name\":\"toposuranos.com\\\/material\",\"description\":\"\",\"publisher\":{\"@id\":\"http:\\\/\\\/toposuranos.com\\\/material\\\/#organization\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"http:\\\/\\\/toposuranos.com\\\/material\\\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"es\"},{\"@type\":\"Organization\",\"@id\":\"http:\\\/\\\/toposuranos.com\\\/material\\\/#organization\",\"name\":\"toposuranos.com\\\/material\",\"url\":\"http:\\\/\\\/toposuranos.com\\\/material\\\/\",\"logo\":{\"@type\":\"ImageObject\",\"inLanguage\":\"es\",\"@id\":\"http:\\\/\\\/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\":\"http:\\\/\\\/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\":\"http:\\\/\\\/toposuranos.com\\\/material\\\/#\\\/schema\\\/person\\\/e15164361c3f9a2a02cf6c234cf7fdc1\",\"name\":\"giorgio.reveco\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"es\",\"@id\":\"http:\\\/\\\/toposuranos.com\\\/material\\\/wp-content\\\/uploads\\\/2023\\\/10\\\/1694478625378-96x96.jpeg\",\"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\":\"http:\\\/\\\/toposuranos.com\\\/material\\\/author\\\/giorgio-reveco\\\/\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"The Language of Propositional Logic - toposuranos.com\/material","description":"Detailed exploration of the language of propositional logic, including concepts of metalanguage, syntax, propositional variables, and connectors.","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":"http:\/\/toposuranos.com\/material\/en\/the-language-of-propositional-logic\/","og_locale":"es_ES","og_type":"article","og_title":"The Language of Propositional Logic","og_description":"Detailed exploration of the language of propositional logic, including concepts of metalanguage, syntax, propositional variables, and connectors.","og_url":"http:\/\/toposuranos.com\/material\/en\/the-language-of-propositional-logic\/","og_site_name":"toposuranos.com\/material","article_publisher":"https:\/\/www.facebook.com\/groups\/toposuranos","article_published_time":"2021-01-18T00:00:14+00:00","article_modified_time":"2024-08-28T19:16:13+00:00","og_image":[{"width":1081,"height":399,"url":"http:\/\/toposuranos.com\/material\/wp-content\/uploads\/2023\/11\/lenguajedelalogicaproposicional-1.jpg","type":"image\/jpeg"}],"author":"giorgio.reveco","twitter_card":"summary_large_image","twitter_title":"The Language of Propositional Logic","twitter_description":"Detailed exploration of the language of propositional logic, including concepts of metalanguage, syntax, propositional variables, and connectors.","twitter_image":"http:\/\/toposuranos.com\/material\/wp-content\/uploads\/2023\/11\/lenguajedelalogicaproposicional-1.jpg","twitter_creator":"@topuranos","twitter_site":"@topuranos","twitter_misc":{"Escrito por":"giorgio.reveco","Tiempo de lectura":"14 minutos"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"http:\/\/toposuranos.com\/material\/en\/the-language-of-propositional-logic\/#article","isPartOf":{"@id":"http:\/\/toposuranos.com\/material\/en\/the-language-of-propositional-logic\/"},"author":{"name":"giorgio.reveco","@id":"http:\/\/toposuranos.com\/material\/#\/schema\/person\/e15164361c3f9a2a02cf6c234cf7fdc1"},"headline":"The Language of Propositional Logic","datePublished":"2021-01-18T00:00:14+00:00","dateModified":"2024-08-28T19:16:13+00:00","mainEntityOfPage":{"@id":"http:\/\/toposuranos.com\/material\/en\/the-language-of-propositional-logic\/"},"wordCount":3122,"commentCount":0,"publisher":{"@id":"http:\/\/toposuranos.com\/material\/#organization"},"image":{"@id":"http:\/\/toposuranos.com\/material\/en\/the-language-of-propositional-logic\/#primaryimage"},"thumbnailUrl":"http:\/\/toposuranos.com\/material\/wp-content\/uploads\/2023\/11\/lenguajedelalogicaproposicional.jpg","articleSection":["Mathematical Logic","Mathematics","Propositional Logic"],"inLanguage":"es","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["http:\/\/toposuranos.com\/material\/en\/the-language-of-propositional-logic\/#respond"]}]},{"@type":"WebPage","@id":"http:\/\/toposuranos.com\/material\/en\/the-language-of-propositional-logic\/","url":"http:\/\/toposuranos.com\/material\/en\/the-language-of-propositional-logic\/","name":"The Language of Propositional Logic - toposuranos.com\/material","isPartOf":{"@id":"http:\/\/toposuranos.com\/material\/#website"},"primaryImageOfPage":{"@id":"http:\/\/toposuranos.com\/material\/en\/the-language-of-propositional-logic\/#primaryimage"},"image":{"@id":"http:\/\/toposuranos.com\/material\/en\/the-language-of-propositional-logic\/#primaryimage"},"thumbnailUrl":"http:\/\/toposuranos.com\/material\/wp-content\/uploads\/2023\/11\/lenguajedelalogicaproposicional.jpg","datePublished":"2021-01-18T00:00:14+00:00","dateModified":"2024-08-28T19:16:13+00:00","description":"Detailed exploration of the language of propositional logic, including concepts of metalanguage, syntax, propositional variables, and connectors.","breadcrumb":{"@id":"http:\/\/toposuranos.com\/material\/en\/the-language-of-propositional-logic\/#breadcrumb"},"inLanguage":"es","potentialAction":[{"@type":"ReadAction","target":["http:\/\/toposuranos.com\/material\/en\/the-language-of-propositional-logic\/"]}]},{"@type":"ImageObject","inLanguage":"es","@id":"http:\/\/toposuranos.com\/material\/en\/the-language-of-propositional-logic\/#primaryimage","url":"http:\/\/toposuranos.com\/material\/wp-content\/uploads\/2023\/11\/lenguajedelalogicaproposicional.jpg","contentUrl":"http:\/\/toposuranos.com\/material\/wp-content\/uploads\/2023\/11\/lenguajedelalogicaproposicional.jpg","width":1081,"height":399,"caption":"toposuranos.com"},{"@type":"BreadcrumbList","@id":"http:\/\/toposuranos.com\/material\/en\/the-language-of-propositional-logic\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Portada","item":"http:\/\/toposuranos.com\/material\/es\/cursos-de-matematica-y-fisica\/"},{"@type":"ListItem","position":2,"name":"The Language of Propositional Logic"}]},{"@type":"WebSite","@id":"http:\/\/toposuranos.com\/material\/#website","url":"http:\/\/toposuranos.com\/material\/","name":"toposuranos.com\/material","description":"","publisher":{"@id":"http:\/\/toposuranos.com\/material\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"http:\/\/toposuranos.com\/material\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"es"},{"@type":"Organization","@id":"http:\/\/toposuranos.com\/material\/#organization","name":"toposuranos.com\/material","url":"http:\/\/toposuranos.com\/material\/","logo":{"@type":"ImageObject","inLanguage":"es","@id":"http:\/\/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":"http:\/\/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":"http:\/\/toposuranos.com\/material\/#\/schema\/person\/e15164361c3f9a2a02cf6c234cf7fdc1","name":"giorgio.reveco","image":{"@type":"ImageObject","inLanguage":"es","@id":"http:\/\/toposuranos.com\/material\/wp-content\/uploads\/2023\/10\/1694478625378-96x96.jpeg","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":"http:\/\/toposuranos.com\/material\/author\/giorgio-reveco\/"}]}},"_links":{"self":[{"href":"http:\/\/toposuranos.com\/material\/wp-json\/wp\/v2\/posts\/25118","targetHints":{"allow":["GET"]}}],"collection":[{"href":"http:\/\/toposuranos.com\/material\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/toposuranos.com\/material\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/toposuranos.com\/material\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"http:\/\/toposuranos.com\/material\/wp-json\/wp\/v2\/comments?post=25118"}],"version-history":[{"count":0,"href":"http:\/\/toposuranos.com\/material\/wp-json\/wp\/v2\/posts\/25118\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"http:\/\/toposuranos.com\/material\/wp-json\/wp\/v2\/media\/25112"}],"wp:attachment":[{"href":"http:\/\/toposuranos.com\/material\/wp-json\/wp\/v2\/media?parent=25118"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/toposuranos.com\/material\/wp-json\/wp\/v2\/categories?post=25118"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/toposuranos.com\/material\/wp-json\/wp\/v2\/tags?post=25118"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}