Last Sync: 2022-08-20 13:00:04

2022-08-20 13:00:04 +01:00 · 2022-08-20 13:00:04 +01:00 · d33f92aabc
commit d33f92aabc
parent fc5e97fb77
35 changed files with 105 additions and 144 deletions
--- a/Logic/Atomic_and_molecular_sentences.md
+++ b/Logic/Atomic_and_molecular_sentences.md
@ -1,7 +1,7 @@
 ---
-tags:
+categories:
  - Logic 
-  - propositional-logic
+tags: [propositional_logic]
 ---

 Sentences or propositions (we will use 'sentences' for consistency) are expressions **that have truth values**, either true or false.
--- a/Logic/Conjunction_Elimination.md
+++ b/Logic/Conjunction_Elimination.md
@ -1,10 +1,10 @@
 ---
-tags:
+categories:
  - Logic 
-  - propositional-logic
-  - derivation-rules
+tags: [propositional_logic]
 ---

+
 If a conjunction exists, it means that both conjuncts are the case; therefore we can legitimately extract either one of them. Also known as *Simplification*.

 ![conjunc-elim.png](../img/conjunc-elim.png)
--- a/Logic/Conjunction_Introduction.md
+++ b/Logic/Conjunction_Introduction.md
@ -1,8 +1,7 @@
 ---
-tags:
+categories:
  - Logic 
-  - propositional-logic
-  - derivation-rules
+tags: [propositional_logic]
 ---

 If two conjuncts have each been independently derived then they can be conjoined. Also known more simply as *Conjunction*
--- a/Logic/Consistency.md
+++ b/Logic/Consistency.md
@ -1,10 +1,8 @@
 ---
-tags:
+categories:
  - Logic 
-  - propositional-logic
-  - consistency
+tags: [propositional_logic]
 ---
-
 ## Informal definition

 A set of sentences is consistent if and only if **it is possible for all the members of the set to be true at the same time**. A set of sentences is inconsistent if and only if it is not consistent.
--- a/Logic/Corresponding_material_and_biconditional.md
+++ b/Logic/Corresponding_material_and_biconditional.md
@ -1,9 +1,8 @@
 ---
-tags:
+categories:
  - Logic 
-  - propositional-logic
+tags: [propositional_logic]
 ---
-
 ## Corresponding material conditional to show validity

 To demonstrate *truth-functional validity* we have to construct a truth-table which contains each of the premises and the conclusion and then review each row to see if there is an assignment where both the premises and the conclusion are true.
--- a/Logic/DeMorgan's_Laws.md
+++ b/Logic/DeMorgan's_Laws.md
@ -1,9 +1,7 @@
 ---
-tags:
+categories:
  - Logic 
-  - propositional-logic
-  - derivation-rules
-  - theorems-axioms-laws
+tags: [propositional_logic]
 ---

 DeMorgan's laws express some fundamental equivalences that obtain between the Boolean [connectives](Truth-functional%20connectives.md):
--- a/Logic/Disjunction_Elimination.md
+++ b/Logic/Disjunction_Elimination.md
@ -1,8 +1,7 @@
 ---
-tags:
+categories:
  - Logic 
-  - propositional-logic
-  - derivation-rules
+tags: [propositional_logic]
 ---

 This rule is sometimes also referred to as *Constructive Dilemma*. This can be a bit tricky to understand because the goal is to derive or *introduce* a new proposition separate from the disjunction you start out with. This may be disjunction, a single proposition or a proposition containing any other logical connective. You do this by constructing two sub-proofs, one for each of the disjuncts comprising the disjunction you start out with. If you can derive your target proposition as the conclusion of each subproof then you may invoke the conclusion in the main proof and take it to be derived. 
--- a/Logic/Disjunction_Introduction.md
+++ b/Logic/Disjunction_Introduction.md
@ -1,8 +1,7 @@
 ---
-tags:
+categories:
  - Logic 
-  - propositional-logic
-  - derivation-rules
+tags: [propositional_logic]
 ---

 This rule can seem a little odd: like we are randomly introducing an additional proposition without giving any justification. However this is just a consequence of the fact if $P$ is true, so is $P \lor Q$ since disjunction is not the same as conjunction: only one disjunct needs to be true for the compound disjunction to be true. This is represented in the context of [truth-trees](Truth-trees.md#disjunction-decomposition) by the fact that truth can pass up via either branch of a disjunction pattern. 
--- a/Logic/Formal_proofs_in_propositional_logic.md
+++ b/Logic/Formal_proofs_in_propositional_logic.md
@ -1,8 +1,7 @@
 ---
-tags:
+categories:
  - Logic 
-  - propositional-logic
-  - proofs
+tags: [propositional_logic]
 ---

 When we construct a formal proof in logic we are seeking to show that a certain proposition is **derivable** from other propositions. We use the words *derivation* and *proof* interchangeably.
--- a/Logic/Indeterminacy.md
+++ b/Logic/Indeterminacy.md
@ -1,7 +1,7 @@
 ---
-tags:
+categories:
  - Logic 
-  - propositional-logic
+tags: [propositional_logic]
 ---

 The vast majority of sentences in natural and formal logical languages are neither [ logically true](Logical%20truth%20and%20falsity.md#logical-truth) or [\| logically false](Logical%20truth%20and%20falsity.md#logical-falsity). This makes sense because sentences of this form are all either tautologies or contradictions and as such do not express information about the state of events in the world. We call sentences that are neither logically true or logically false, logically indeterminate sentences.
--- a/Logic/Law_of_Non-Contradiction.md
+++ b/Logic/Law_of_Non-Contradiction.md
@ -1,12 +1,10 @@
 ---
-tags:
+categories:
  - Logic 
-  - propositional-logic
-  - theorems-axioms-laws
+tags: [propositional_logic]
 ---


- > 
 > A proposition cannot be true and false at the same time. 
 > $$
 > \\sim (P & \sim P)
--- a/Logic/Law_of_the_Excluded_Middle.md
+++ b/Logic/Law_of_the_Excluded_Middle.md
@ -1,11 +1,9 @@
 ---
-tags:
+categories:
  - Logic 
-  - propositional-logic
-  - theorems-axioms-laws
+tags: [propositional_logic]
 ---

-
 > 
 > Every proposition has to be either true or false. There can be no middle ground.
 > $$
--- a/Logic/Logical_equivalence.md
+++ b/Logic/Logical_equivalence.md
@ -1,10 +1,9 @@
 ---
-tags:
+categories:
  - Logic 
-  - propositional-logic
+tags: [propositional_logic]
 ---

-
 > 
 > Two sentences, P and Q, are truth-functionally equivalent if and only if there is no truth assignment in which P is true and Q is false

--- a/Logic/Logical_possibility_and_necessity.md
+++ b/Logic/Logical_possibility_and_necessity.md
@ -1,11 +1,8 @@
 ---
-tags:
+categories:
  - Logic 
-  - Philosophy
-  - propositional-logic
-  - modality
+tags: [propositional_logic]
 ---
-
 ## Logical possibility

 In distinguishing the properties of [logical consistency](Consistency.md) and [validity](Validity%20and%20entailment.md#validity) we make tacit use of the notion of **possibility**. This is because when we consider the validity of an argument we are assessing truth-conditions and this consists in asking ourselves what could or could not be the case: were it such that *P*, then it would be the case that *Q*. It is important to understand what possibility means in the context of logic and how it differs from what we might mean ordinarily when we use the term.
--- a/Logic/Logical_truth_and_falsity.md
+++ b/Logic/Logical_truth_and_falsity.md
@ -1,7 +1,7 @@
 ---
-tags:
+categories:
  - Logic 
-  - propositional-logic
+tags: [propositional_logic]
 ---

 We say of certain sentences that they are logically true or logically false.
--- a/Logic/Negation_Elimination.md
+++ b/Logic/Negation_Elimination.md
@ -1,8 +1,7 @@
 ---
-tags:
+categories:
  - Logic 
-  - propositional-logic
-  - derivation-rules
+tags: [propositional_logic]
 ---

 ![negate-elim 1.png](../img/negate-elim%201.png) 
--- a/Logic/Negation_Introduction.md
+++ b/Logic/Negation_Introduction.md
@ -1,8 +1,7 @@
 ---
-tags:
+categories:
  - Logic 
-  - propositional-logic
-  - derivation-rules
+tags: [propositional_logic]
 ---

 This is also known as *proof by contradiction*. You start with an assumption declared in a subproof. If you can derive a contradiction from this assumption (typically from the introduction of another proposition and its negation), then you are permitted to derive the negation of the auxiliary assumption in the main proof. 
--- a/Logic/Object_language_and_meta-language.md
+++ b/Logic/Object_language_and_meta-language.md
@ -1,9 +1,10 @@
 ---
-tags:
+categories:
  - Logic 
-  - propositional-logic
+tags: [propositional_logic]
 ---

+
 ## Object and metalanguages

 When we talk about a language we call that language the **object language**. A **metalanguage** is a language used to describe some object language.
--- a/Logic/Reiteration.md
+++ b/Logic/Reiteration.md
@ -1,8 +1,7 @@
 ---
-tags:
+categories:
  - Logic 
-  - propositional-logic
-  - derivation-rules
+tags: [propositional_logic]
 ---

 **Reiteration (R)** allows us to restate any proposition already in the proof within the main proof or a more deeply nested subproof. Reiteration allows us to reuse any assumptions, or propositions derived from assumptions, without having to introduce a new dependency with another assumption.
--- a/Logic/Soundness.md
+++ b/Logic/Soundness.md
@ -1,7 +1,7 @@
 ---
-tags:
+categories:
  - Logic 
-  - propositional-logic
+tags: [propositional_logic]
 ---

 ### Soundness
--- a/Logic/Strategies_for_constructing_proofs.md
+++ b/Logic/Strategies_for_constructing_proofs.md
@ -1,8 +1,7 @@
 ---
-tags:
+categories:
  - Logic 
-  - propositional-logic
-  - proofs
+tags: [propositional_logic]
 ---

 ## General strategy
--- a/Logic/Syllogism.md
+++ b/Logic/Syllogism.md
@ -1,7 +1,7 @@
 ---
-tags:
+categories:
  - Logic 
-  - propositional-logic
+tags: [propositional_logic]
 ---

 In order to make assertions about the relative [consistency](Consistency.md) or inconsistency of a set of propositions we advance arguments. Consider everyday life: if we are having an argument with someone, we believe that they are wrong. A more logical way to say this is that we believe that their beliefs are inconsistent. In order to change their viewpoint or point out why they are wrong we advance an argument intended to show that belief A conflicts with belief B. Or if C is true, then you cannot believe that D.
--- a/Logic/Syntax_of_sentential_logic.md
+++ b/Logic/Syntax_of_sentential_logic.md
@ -1,9 +1,8 @@
 ---
-tags:
+categories:
  - Logic 
-  - propositional-logic
+tags: [propositional_logic]
 ---
-
 ## Syntax of formal languages versus semantics

 > 
--- a/Logic/Theorems_and_empty_sets.md
+++ b/Logic/Theorems_and_empty_sets.md
@ -1,9 +1,7 @@
 ---
-tags:
+categories:
  - Logic 
-  - propositional-logic
-  - proofs
-  - theorems-axioms-laws
+tags: [propositional_logic]
 ---

 We know that when we construct a [derivation](Formal%20proofs%20in%20propositional%20logic.md#constructing-proofs) we start from a set of assumptions and then attempt to reach a proposition that is a consequence of the starting assumptions. However it does not always have to be the case that the starting set contains members. The set can in fact be empty.
--- a/Logic/Truth-functional_connectives.md
+++ b/Logic/Truth-functional_connectives.md
@ -1,10 +1,8 @@
 ---
-tags:
+categories:
  - Logic 
-  - propositional-logic
-  - truth-tables
+tags: [propositional_logic]
 ---
-
 ## Truth-functional connectives

 Sentences generated from other (simple) sentences by means of sentential connectives are [compound sentences](Atomic%20and%20molecular%20sentences.md).
--- a/Logic/Truth-tables.md
+++ b/Logic/Truth-tables.md
@ -1,9 +1,7 @@
 ---
-tags:
+categories:
  - Logic 
-  - propositional-logic
-  - recursion
-  - truth-tables
+tags: [propositional_logic]
 ---

 # Truth-tables
--- a/Logic/Truth-trees.md
+++ b/Logic/Truth-trees.md
@ -1,9 +1,8 @@
 ---
-tags:
+categories:
  - Logic 
-  - propositional-logic
+tags: [propositional_logic]
 ---
-
 ## Rationale

 Like [truth-tables](Truth-tables.md), truth-trees are a means of graphically representing the logical relationships that may obtain between propositions. Truth-trees and truth-tables complement each other and which method you choose depends on which logical property you are seeking to derive.
--- a/Logic/Validity_and_entailment.md
+++ b/Logic/Validity_and_entailment.md
@ -1,11 +1,8 @@
 ---
-tags:
+categories:
  - Logic 
-  - propositional-logic
-  - validity
-  - entailment
+tags: [propositional_logic]
 ---
-
 ## Validity

 ### Informal definition
--- a/Mathematics/Algebra/Algebra_key_terms.md
+++ b/Mathematics/Algebra/Algebra_key_terms.md
@ -1,7 +1,7 @@
 ---
-tags:
+categories:
  - Mathematics 
-  - Algebra
+tags: [algebra]
 ---

 * **Variable**
--- a/Mathematics/Algebra/Equivalent_equations.md
+++ b/Mathematics/Algebra/Equivalent_equations.md
@ -1,9 +1,8 @@
 ---
-tags:
+categories:
  - Mathematics 
-  - Algebra
+tags: [algebra]
 ---
-
 ## Equivalent equations

 > 
--- a/Mathematics/Algebra/Exponents.md
+++ b/Mathematics/Algebra/Exponents.md
@ -1,10 +1,8 @@
 ---
-tags:
+categories:
  - Mathematics 
-  - Algebra
-  - exponents
+tags: [algebra, exponents]
 ---
-
 ## Equivalent equations

 > 
--- a/Mathematics/Algebra/Logarithms.md
+++ b/Mathematics/Algebra/Logarithms.md
@ -1,10 +1,8 @@
 ---
-tags:
+categories:
  - Mathematics 
-  - Algebra
-  - logarithms
+tags: [algebra]
 ---
-
 Most simply a logarithm is a way of answering the question:

 > 
--- a/Mathematics/Algebra/Negative_exponents.md
+++ b/Mathematics/Algebra/Negative_exponents.md
@ -1,8 +1,7 @@
 ---
-tags:
+categories:
  - Mathematics 
-  - Algebra
-  - exponents
+tags: [algebra, exponents]
 ---

 When calculating the exponents of a negative number the answer will always will be positive:
--- a/Mathematics/Algebra/Solving_equations.md
+++ b/Mathematics/Algebra/Solving_equations.md
@ -1,10 +1,8 @@
 ---
-tags:
+categories:
  - Mathematics 
-  - Algebra
-  - operators
+tags: [algebra]
 ---
-
 ## Use inversion of operators

 When solving equations we frequently make use of the [ operator inversion rules](../Prealgebra/Inversion%20of%20operators.md) to find the solutions.
--- a/Programming_Languages/Shell_Scripting/Cron.md
+++ b/Programming_Languages/Shell_Scripting/Cron.md
@ -2,7 +2,7 @@
 tags:
  - Programming_Languages
  - shell
-  - abra
+  - abracadabra
 ---
 # Cron