<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0" xmlns:cc="http://cyber.law.harvard.edu/rss/creativeCommonsRssModule.html">
    <channel>
        <title><![CDATA[Stories by justaguy on Medium]]></title>
        <description><![CDATA[Stories by justaguy on Medium]]></description>
        <link>https://medium.com/@LavishFairyTales?source=rss-b66dd8106aa3------2</link>
        <image>
            <url>https://cdn-images-1.medium.com/fit/c/150/150/1*rEudct4brOvVGWCzVwbh-Q.jpeg</url>
            <title>Stories by justaguy on Medium</title>
            <link>https://medium.com/@LavishFairyTales?source=rss-b66dd8106aa3------2</link>
        </image>
        <generator>Medium</generator>
        <lastBuildDate>Wed, 18 Nov 2026 11:24:07 GMT</lastBuildDate>
        <atom:link href="https://medium.com/@LavishFairyTales/feed" rel="self" type="application/rss+xml"/>
        <webMaster><![CDATA[yourfriends@medium.com]]></webMaster>
        <atom:link href="http://medium.superfeedr.com/" rel="hub"/>
        <item>
            <title><![CDATA[my notes on Propositional logic]]></title>
            <link>https://medium.com/@LavishFairyTales/my-notes-on-propositional-logic-f23617608433?source=rss-b66dd8106aa3------2</link>
            <guid isPermaLink="false">https://medium.com/p/f23617608433</guid>
            <category><![CDATA[notes]]></category>
            <category><![CDATA[logic]]></category>
            <dc:creator><![CDATA[justaguy]]></dc:creator>
            <pubDate>Fri, 24 Oct 2025 22:56:18 GMT</pubDate>
            <atom:updated>2025-10-24T22:56:18.538Z</atom:updated>
            <content:encoded><![CDATA[<p>(book is forall x and i used ai to fix mess ups) so to start we must ask first what is a proposition, atomic sentences? A <strong>proposition</strong> is a <strong>statement that can be either true or false, atomic sentences are basic statement</strong> in logic that <strong>cannot be broken down into smaller statements (like P, Q) and </strong>it has <strong>no logical connectives </strong>(like “and,” “or,” “not,” “if…then…”) now for</p><ol><li>Truth Value, Every proposition is either <strong>true (T)</strong> or <strong>false (F) </strong>Example: “It is raining.” → True or False, “2 + 2 = 5” → False.</li></ol><p>2. Distinction Between Atomic and Compound Sentences, as you know <strong>Atomic sentences are</strong>: basic, indivisible, no connectives. were <strong>Compound sentences</strong>: built from atomic sentences using <strong>connectives</strong></p><p>3. Symbolic Representation, Atomic sentences are usually represented by <strong>capital letters(like P, Q) as show before, </strong>Using symbols helps to <strong>abstract away the meaning</strong> and focus on the <strong>logical structure</strong>.</p><p>finally for the preliminaries</p><p>4. Why Propositional Logic Matters, it matters because Helps analyze arguments <strong>formally and </strong>Allows us to determine whether reasoning is <strong>valid</strong>, <strong>sound</strong>, or leads to <strong>contradictions</strong>.</p><p>now connectives:</p><ol><li>Negation “¬” it is used like “it is not the case that” or “not” so lets say we have a Example: P = the sky is blue, ¬P this translates in natural language to “it is not the case that the sky is blue” simple enough</li><li>Conjunction “∧” it is used like “and” or “both” so lets say we have a Example: P = Socrates is a philosopher. Q = Aristotle is a philosopher then we say P ∧ Q. this translates into natural language “Socrates is a philosopher and Aristotle is a philosopher” or “ both Socrates and Aristotle are philosophers”</li><li>Disjunction “∨” it is used like “or” so lets say we have a Example: P = the sky is blue. Q = trees are magenta P ∨ Q, it translate to natural language as the sky is blue or trees are magenta seems easy so far right?</li><li>conditional “→” it is used like “If, then” this is a material conditional a Example would be: P = it rained today, Q = the street is wet, P→Q, it translates to “if it rained today then the street is wet”</li><li>biconditional “↔” it is used like “if and only if” also “iff”(which stands for the same thing) using a example would be like: P = You can enter the club, Q = You are 21 or older, P↔Q it translates to “you can enter the club if and only if you are 21 or older” or “you can enter the club iff you are 21 or older) they mean the same thing i just want to stress it</li></ol><p>now that we are finished with connectives, we will move on to more stuff</p><p><strong>SENTENCES</strong>: Well-Formed vs. Gibberish Expressions, well formed expressions look like “(A ∧ B)”, gibberish sentences look like (¬)¬)(↔)(B).We need rules to define which expressions count as proper sentences.</p><p><strong>Building Compound Sentences</strong>: Using logical connectives, we can build more complex sentences like (A ∧ B) or (A↔B), (P ∧ Q) ∧ (¬B → C)</p><p><strong>Inductive Definition of Sentences</strong>: things like <strong>Base:</strong> Every sentence letter is a sentence. Inductive clauses: 1. Every sentence letter is a sentence. 2. If A is a sentence, then ¬A is a sentence. 3. If A and B are sentences, then (A∧ B) is a sentence. 4. If A and B are sentences, then (A∨ B) is a sentence. 5. If A and B are sentences, then (A→ B) is a sentence. 6. If A and B are sentences, then (A↔ B) is a sentence. 7. Nothing else is a sentence. Definitions like this are called <strong>inductive</strong>. <strong>Nothing else</strong> counts as a sentence. This is called an <strong>inductive definition</strong>: start with simple elements, then build more complex ones step by step.</p><p><strong>Main Logical Operator: </strong>In any compound sentence, the <strong>main logical operator</strong> is the last operator introduced when constructing the sentence. Examples: ¬¬¬D → main operator: <strong>first. </strong>(P ∧ ¬(¬Q ∨ R) → main operator: ∧.(¬E ∨ F) → ¬¬G → main operator: →. <strong>Finding main operator</strong>: If first symbol is ¬, that’s the main operator. Otherwise, count brackets: first operator reached when bracket count = 1 is the main operator</p><p><strong>Scope of a Connective: </strong>The scope of a connective (like ¬) is the subsentence for which it is the main logical operator. <strong>Example</strong>: (P ∧ (¬(R ∧ B) ↔ Q)). Scope of ¬ is ¬(R ∧ B).</p><p><strong>Purpose of Inductive Structure: </strong>Allows decomposition of complex sentences into simpler parts.Helps determine <strong>truth values</strong> systematically, starting from atomic sentences and working outward. Helps determine <strong>truth values</strong> systematically, starting from atomic sentences and working outward.</p><p><strong>Importance of Brackets: </strong>Brackets are essential to show the structure of a sentence. Example: ¬(Q ∧ R) is different from ¬Q ∧ R (the placement of brackets changes meaning).Without brackets, Q ∧ R is just an expression, not a full sentence.</p><p><strong>Convenient Conventions Omit outermost brackets</strong>: You can write Q ∧ R instead of (Q ∧ R).But if embedding in a bigger sentence, put brackets back.Use square brackets for readability: [P ∨ Q] is the same as (P ∨ Q).These conventions make long sentences easier to <strong>read</strong></p><p><strong>Example of Improved Readability: </strong>Original: (((H → I) ∨ (I → H)) ∧ (J ∨ K)) Using conventions: [(H → I) ∨ (I → H)] ∧ (J ∨ K). Now the <strong>scope of each connective</strong> is easier to see.</p><h3>Ambiguity</h3><p><strong>Ambiguity</strong> occurs when a sentence can have <strong>more than one meaning</strong>. Sources of ambiguity: Lexical ambiguity Words have multiple meanings. <strong>Structural ambiguity:</strong> Sentence can be interpreted differently depending on structure Usually, <strong>context</strong> or <strong>stress</strong> clarifies the intended meaning. Ambiguity is different from <strong>vagueness</strong>: Vagueness: unclear boundaries of terms like “tall” or “rich” Ambiguity: multiple discrete meanings</p><p><strong>Ambiguity in TFL. Goal:</strong> Avoid ambiguity in symbolization. Each sentence letter must be either true or false. TFL sentences <strong>cannot be structurally ambiguous </strong>every sentence has <strong>one reading</strong>. TFL can help <strong>disambiguate English sentences</strong> by making different readings explicit.</p><p><strong>Scope Ambiguities: </strong>Ambiguities often arise from <strong>connectives (and, or, not)</strong> in English. Examples: “Avengers: Endgame is not long and boring” Reading 1: ¬(L ∧ B) → not both long and boring Reading 2: ¬L ∧ B → not long but boring</p><p><strong>Key Points. </strong>English sentences can be ambiguous; TFL sentences <strong>cannot</strong>. Ambiguity can be clarified with <strong>symbolization keys</strong> and formal logic. Symbolization forces precision, avoiding misinterpretation, crucial in law, philosophy, math, and programming</p><h3>Use and Mention</h3><p><strong>Use vs. Mention Use</strong>: Talking about the object itself. Example: Aristotle is the founding father of logic. → talking about the man. Mention: Talking about the word or expression. Example: ‘Aristotle’ is composed of one uppercase letter and eight lowercase letters. → talking about the name. Quotation marks or other conventions indicate that a word is being mentioned, not used.</p><p><strong>Object Language and Metalanguage: </strong>so for <strong>Object language it is :</strong> The language being studied, and for <strong>Metalanguage:</strong> The language used to <strong>talk about</strong> the object language (here, <strong>English + conventions</strong>).</p><p><strong>Metavariables: </strong>Sometimes we want to refer to <strong>any sentence of TFL</strong>, not a specific one. Use metavariables (like A, B, C) in the metalanguage. Example (inductive definition): “If A is a sentence, then ¬A is a sentence.” Here, A is a metavariable, representing an arbitrary TFL sentence. Metavariables allow concise discussion without quoting every possible sentence</p><p><strong>Handling Concatenation </strong>Expressions like ¬A, (A ∧ B), (A ∨ B) are shorthand: They mean: “concatenate the connective symbol with the sentence(s) represented by the metavariables.” This avoids long-winded phrasing while remaining precise</p><p><strong>Quotation Conventions for Arguments: </strong>TFL can symbolize English arguments, but it cannot inherently flag premises vs. conclusions. Use ∴ in the metalanguage to indicate the conclusion: Example: A, A → B ∴ B Premises: A and A → B Conclusion: B Quotation marks are unnecessary here due to stipulated conventions.</p><p><strong>Key Takeaways</strong> is that we should Always distinguish between using a sentence and mentioning it. The object language (TFL) is what we study; the metalanguage (English) is what we use to talk about it. Metavariables allow talking about arbitrary sentences. Concatenation shorthand (¬A, (A ∧ B)) makes rules concise. Use ∴ in metalanguage to indicate arguments clearly.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=f23617608433" width="1" height="1" alt="">]]></content:encoded>
        </item>
    </channel>
</rss>