diff --git a/Data_Structures/Arrays.md b/Data_Structures/Arrays.md index 286b0fb..5850778 100644 --- a/Data_Structures/Arrays.md +++ b/Data_Structures/Arrays.md @@ -1,5 +1,8 @@ --- -tags: [data-structures] +categories: + - DSA +tags: + - data-structures --- # Arrays diff --git a/Data_Structures/Patterns/Factory_pattern.md b/Data_Structures/Patterns/Factory_pattern.md index 9f4619b..f5457ea 100644 --- a/Data_Structures/Patterns/Factory_pattern.md +++ b/Data_Structures/Patterns/Factory_pattern.md @@ -1,8 +1,8 @@ --- +categories: + - DSA tags: - - Data Structures - - patterns - - oop + - OOP --- # Factory pattern diff --git a/Data_Structures/Patterns/Frequency_counters.md b/Data_Structures/Patterns/Frequency_counters.md index c6b25d6..5096b36 100644 --- a/Data_Structures/Patterns/Frequency_counters.md +++ b/Data_Structures/Patterns/Frequency_counters.md @@ -1,7 +1,7 @@ --- -tags: - - Data_Structures - - patterns +categories: + - DSA +tags: [] --- # Frequency counters diff --git a/Data_Structures/Patterns/Module_pattern.md b/Data_Structures/Patterns/Module_pattern.md index d4c3cc9..289ffcd 100644 --- a/Data_Structures/Patterns/Module_pattern.md +++ b/Data_Structures/Patterns/Module_pattern.md @@ -1,10 +1,8 @@ --- -tags: - - Data_Structures - - patterns - - oop +categories: + - DSA +tags: [OOP] --- - # Module pattern > Come back and compare this with learning from Node.js diff --git a/Data_Structures/Patterns/Multiple_pointers.md b/Data_Structures/Patterns/Multiple_pointers.md index 0d60796..5d1d258 100644 --- a/Data_Structures/Patterns/Multiple_pointers.md +++ b/Data_Structures/Patterns/Multiple_pointers.md @@ -1,9 +1,8 @@ --- -tags: - - Data_Structures - - patterns +categories: + - DSA +tags: [] --- - # Multiple pointers The multiple pointers pattern can be useful for moving through an array and comparing elements against each other in a time-efficient manner and without costly multiple loops. diff --git a/Data_Structures/Patterns/Observer_pattern.md b/Data_Structures/Patterns/Observer_pattern.md index 4de105d..d287ef1 100644 --- a/Data_Structures/Patterns/Observer_pattern.md +++ b/Data_Structures/Patterns/Observer_pattern.md @@ -1,8 +1,7 @@ --- -tags: - - Data_Structures - - patterns - - oop +categories: + - DSA +tags: [OOP] --- # Observer pattern diff --git a/Data_Structures/Patterns/Singleton_pattern.md b/Data_Structures/Patterns/Singleton_pattern.md index 1410158..7f13582 100644 --- a/Data_Structures/Patterns/Singleton_pattern.md +++ b/Data_Structures/Patterns/Singleton_pattern.md @@ -1,10 +1,8 @@ --- -tags: - - Data_Structures - - patterns - - oop +categories: + - DSA +tags: [OOP] --- - # Singleton pattern As the name suggests, the Singleton pattern is best used in scenarios where you only want to use a single, unique instance of a class. This is for functionality that should only be executed once in the lifecycle of an application. The canonical case would be some kind of bootstrapping process required at initialisation, or initial configuration for an app. diff --git a/Data_Structures/Patterns/Sliding_window.md b/Data_Structures/Patterns/Sliding_window.md index 88de969..5e514f3 100644 --- a/Data_Structures/Patterns/Sliding_window.md +++ b/Data_Structures/Patterns/Sliding_window.md @@ -1,9 +1,8 @@ --- -tags: - - Data_Structures - - patterns +categories: + - DSA +tags: [] --- - # Sliding window Whereas the [multiple pointer](Multiple_pointers.md) pattern works by keeping two array indices running at once and comparing their values on each iteration, the sliding window diff --git a/Data_Structures/Queue.md b/Data_Structures/Queue.md index f5d6819..c8e1cf0 100644 --- a/Data_Structures/Queue.md +++ b/Data_Structures/Queue.md @@ -1,7 +1,9 @@ --- -tags: [data-structures] +categories: + - DSA +tags: + - data-structures --- - # Queues _Visualization of the queue data structure_ diff --git a/Data_Structures/Recursion.md b/Data_Structures/Recursion.md index aa606f0..ee34ce4 100644 --- a/Data_Structures/Recursion.md +++ b/Data_Structures/Recursion.md @@ -1,5 +1,9 @@ --- -tags: [algorithms, recursion] +categories: + - DSA +tags: + - algorithms + - recursion --- > A recursive function is a function that calls itself in its definition. diff --git a/Data_Structures/Stacks.md b/Data_Structures/Stacks.md index 0efeae2..26f9300 100644 --- a/Data_Structures/Stacks.md +++ b/Data_Structures/Stacks.md @@ -1,7 +1,8 @@ --- -tags: [data-structures] +categories: + - DSA +tags: --- - _A stack visualised vertically_ ![stack2.svg](../img/stack2.svg) diff --git a/Databases/Primary_key.md b/Databases/Primary_key.md index 20c66c8..dfaa9b2 100644 --- a/Databases/Primary_key.md +++ b/Databases/Primary_key.md @@ -1,7 +1,7 @@ --- categories: - Databases -tags: [relational_databases] +tags: [relational-databases] --- # Primary key diff --git a/Databases/Relational_database_architecture.md b/Databases/Relational_database_architecture.md index bef1932..b77f5a1 100644 --- a/Databases/Relational_database_architecture.md +++ b/Databases/Relational_database_architecture.md @@ -1,7 +1,7 @@ --- categories: - Databases -tags: [relational_databases] +tags: [relational-databases] --- # Relational database architecture diff --git a/Databases/SQL/0_Demonstration_database.md b/Databases/SQL/0_Demonstration_database.md index 74b7063..070034f 100644 --- a/Databases/SQL/0_Demonstration_database.md +++ b/Databases/SQL/0_Demonstration_database.md @@ -1,7 +1,7 @@ --- categories: - Databases - - Programming_Languages + - Programming Languages tags: [SQL] --- diff --git a/Databases/SQL/10_Joins.md b/Databases/SQL/10_Joins.md index 8420cea..0b2f7db 100644 --- a/Databases/SQL/10_Joins.md +++ b/Databases/SQL/10_Joins.md @@ -1,7 +1,7 @@ --- categories: - Databases - - Programming_Languages + - Programming Languages tags: [SQL] --- diff --git a/Databases/SQL/11_Aggregate_functions.md b/Databases/SQL/11_Aggregate_functions.md index ab9a616..dbf0d04 100644 --- a/Databases/SQL/11_Aggregate_functions.md +++ b/Databases/SQL/11_Aggregate_functions.md @@ -1,7 +1,7 @@ --- categories: - Databases - - Programming_Languages + - Programming Languages tags: [SQL] --- diff --git a/Databases/SQL/1_Language_structure.md b/Databases/SQL/1_Language_structure.md index 126ea6f..f0d14b7 100644 --- a/Databases/SQL/1_Language_structure.md +++ b/Databases/SQL/1_Language_structure.md @@ -1,7 +1,7 @@ --- categories: - Databases - - Programming_Languages + - Programming Languages tags: [SQL] --- diff --git a/Databases/SQL/2_SELECT.md b/Databases/SQL/2_SELECT.md index 04fbae8..a4a4d1e 100644 --- a/Databases/SQL/2_SELECT.md +++ b/Databases/SQL/2_SELECT.md @@ -1,7 +1,7 @@ --- categories: - Databases - - Programming_Languages + - Programming Languages tags: [SQL] --- diff --git a/Databases/SQL/3_INSERT.md b/Databases/SQL/3_INSERT.md index 59275d8..a373cc6 100644 --- a/Databases/SQL/3_INSERT.md +++ b/Databases/SQL/3_INSERT.md @@ -1,7 +1,7 @@ --- categories: - Databases - - Programming_Languages + - Programming Languages tags: [SQL] --- diff --git a/Databases/SQL/4_WHERE.md b/Databases/SQL/4_WHERE.md index 73499a6..c7bf4a9 100644 --- a/Databases/SQL/4_WHERE.md +++ b/Databases/SQL/4_WHERE.md @@ -1,7 +1,7 @@ --- categories: - Databases - - Programming_Languages + - Programming Languages tags: [SQL] --- diff --git a/Databases/SQL/5_UPDATE.md b/Databases/SQL/5_UPDATE.md index 047cc0b..cb5bf71 100644 --- a/Databases/SQL/5_UPDATE.md +++ b/Databases/SQL/5_UPDATE.md @@ -1,7 +1,7 @@ --- categories: - Databases - - Programming_Languages + - Programming Languages tags: [SQL] --- diff --git a/Databases/SQL/6_DELETE.md b/Databases/SQL/6_DELETE.md index 731839a..4c48ab1 100644 --- a/Databases/SQL/6_DELETE.md +++ b/Databases/SQL/6_DELETE.md @@ -1,7 +1,7 @@ --- categories: - Databases - - Programming_Languages + - Programming Languages tags: [SQL] --- diff --git a/Databases/SQL/7_ALTER.md b/Databases/SQL/7_ALTER.md index d455949..eeb921c 100644 --- a/Databases/SQL/7_ALTER.md +++ b/Databases/SQL/7_ALTER.md @@ -1,7 +1,7 @@ --- categories: - Databases - - Programming_Languages + - Programming Languages tags: [SQL] --- diff --git a/Databases/SQL/8_CREATE.md b/Databases/SQL/8_CREATE.md index 26bb1f3..4ccb66a 100644 --- a/Databases/SQL/8_CREATE.md +++ b/Databases/SQL/8_CREATE.md @@ -1,7 +1,7 @@ --- categories: - Databases - - Programming_Languages + - Programming Languages tags: [SQL] --- diff --git a/Databases/SQL/9_Utilising_foreign_keys.md b/Databases/SQL/9_Utilising_foreign_keys.md index fb8e4ee..28ee17d 100644 --- a/Databases/SQL/9_Utilising_foreign_keys.md +++ b/Databases/SQL/9_Utilising_foreign_keys.md @@ -1,7 +1,7 @@ --- categories: - Databases - - Programming_Languages + - Programming Languages tags: [SQL] --- diff --git a/Hardware/Binary/Binary_arithmetic.md b/Hardware/Binary/Binary_arithmetic.md index f221483..670413e 100644 --- a/Hardware/Binary/Binary_arithmetic.md +++ b/Hardware/Binary/Binary_arithmetic.md @@ -1,7 +1,7 @@ --- categories: - Mathematics - - Computer_Architecture + - Computer Architecture tags: [binary] --- # Binary arithmetic diff --git a/Hardware/Binary/Binary_arithmetic_with_circuits.md b/Hardware/Binary/Binary_arithmetic_with_circuits.md index 1db8e88..da24f3e 100644 --- a/Hardware/Binary/Binary_arithmetic_with_circuits.md +++ b/Hardware/Binary/Binary_arithmetic_with_circuits.md @@ -1,6 +1,6 @@ --- categories: - - Computer_Architecture + - Computer Architecture - Electronics tags: [binary] --- diff --git a/Hardware/Binary/The_binary_number_system.md b/Hardware/Binary/The_binary_number_system.md index 8e27ddb..8dce77f 100644 --- a/Hardware/Binary/The_binary_number_system.md +++ b/Hardware/Binary/The_binary_number_system.md @@ -1,7 +1,7 @@ --- categories: - Mathematics - - Computer_Architecture + - Computer Architecture tags: [binary] --- diff --git a/Hardware/Binary/Why_computers_use_binary.md b/Hardware/Binary/Why_computers_use_binary.md index 0d1af36..0c4b70e 100644 --- a/Hardware/Binary/Why_computers_use_binary.md +++ b/Hardware/Binary/Why_computers_use_binary.md @@ -1,7 +1,7 @@ --- categories: - Mathematics - - Computer_Architecture + - Computer Architecture tags: [binary] --- diff --git a/Hardware/Bus.md b/Hardware/Bus.md index 0b8368d..1ca5da0 100644 --- a/Hardware/Bus.md +++ b/Hardware/Bus.md @@ -1,6 +1,6 @@ --- categories: - - Computer_Architecture + - Computer Architecture - Hardware tags: [motherboard] --- diff --git a/Hardware/CPU/CPU_architecture.md b/Hardware/CPU/CPU_architecture.md index 1c7c037..538d918 100644 --- a/Hardware/CPU/CPU_architecture.md +++ b/Hardware/CPU/CPU_architecture.md @@ -1,6 +1,6 @@ --- categories: - - Computer_Architecture + - Computer Architecture tags: [CPU] --- diff --git a/Hardware/CPU/Fetch_decode_execute.md b/Hardware/CPU/Fetch_decode_execute.md index e685b35..f374a26 100644 --- a/Hardware/CPU/Fetch_decode_execute.md +++ b/Hardware/CPU/Fetch_decode_execute.md @@ -1,6 +1,6 @@ --- categories: - - Computer_Architecture + - Computer Architecture tags: [CPU] --- diff --git a/Hardware/CPU/Introduction.md b/Hardware/CPU/Introduction.md index e3c0260..ffda77f 100644 --- a/Hardware/CPU/Introduction.md +++ b/Hardware/CPU/Introduction.md @@ -1,6 +1,6 @@ --- categories: - - Computer_Architecture + - Computer Architecture tags: [CPU] --- diff --git a/Hardware/CPU/The_Little_Man_computer.md b/Hardware/CPU/The_Little_Man_computer.md index 1cb2a77..02922b8 100644 --- a/Hardware/CPU/The_Little_Man_computer.md +++ b/Hardware/CPU/The_Little_Man_computer.md @@ -1,6 +1,6 @@ --- categories: - - Computer_Architecture + - Computer Architecture tags: [CPU, processors] --- diff --git a/Hardware/Chipset_and_controllers.md b/Hardware/Chipset_and_controllers.md index d31db6c..c894ce5 100644 --- a/Hardware/Chipset_and_controllers.md +++ b/Hardware/Chipset_and_controllers.md @@ -1,6 +1,6 @@ --- categories: - - Computer_Architecture + - Computer Architecture - Hardware tags: [motherboard, chipset] --- diff --git a/Hardware/Logic_Gates/And_gate.md b/Hardware/Logic_Gates/And_gate.md index 3f39392..1717290 100644 --- a/Hardware/Logic_Gates/And_gate.md +++ b/Hardware/Logic_Gates/And_gate.md @@ -1,6 +1,6 @@ --- categories: - - Computer_Architecture + - Computer Architecture - Electronics - Hardware tags: [logic-gates] diff --git a/Hardware/Logic_Gates/Logic_circuits.md b/Hardware/Logic_Gates/Logic_circuits.md index f2564e0..27007e7 100644 --- a/Hardware/Logic_Gates/Logic_circuits.md +++ b/Hardware/Logic_Gates/Logic_circuits.md @@ -1,6 +1,6 @@ --- categories: - - Computer_Architecture + - Computer Architecture - Electronics - Hardware tags: [logic-gates, binary] diff --git a/Hardware/Logic_Gates/Logic_gates.md b/Hardware/Logic_Gates/Logic_gates.md index 2754af8..cfb3f2e 100644 --- a/Hardware/Logic_Gates/Logic_gates.md +++ b/Hardware/Logic_Gates/Logic_gates.md @@ -1,6 +1,6 @@ --- categories: - - Computer_Architecture + - Computer Architecture - Electronics - Hardware tags: [logic-gates, binary] diff --git a/Hardware/Logic_Gates/Nand_gate.md b/Hardware/Logic_Gates/Nand_gate.md index d72b9fe..8a55765 100644 --- a/Hardware/Logic_Gates/Nand_gate.md +++ b/Hardware/Logic_Gates/Nand_gate.md @@ -1,6 +1,6 @@ --- categories: - - Computer_Architecture + - Computer Architecture - Electronics - Hardware tags: [logic-gates, binary] diff --git a/Hardware/Logic_Gates/Not_gate.md b/Hardware/Logic_Gates/Not_gate.md index a545fac..83ca412 100644 --- a/Hardware/Logic_Gates/Not_gate.md +++ b/Hardware/Logic_Gates/Not_gate.md @@ -1,6 +1,6 @@ --- categories: - - Computer_Architecture + - Computer Architecture - Electronics - Hardware tags: [logic-gates, binary] diff --git a/Hardware/Logic_Gates/Or_gate.md b/Hardware/Logic_Gates/Or_gate.md index 4d74440..2df69f5 100644 --- a/Hardware/Logic_Gates/Or_gate.md +++ b/Hardware/Logic_Gates/Or_gate.md @@ -1,6 +1,6 @@ --- categories: - - Computer_Architecture + - Computer Architecture - Electronics - Hardware tags: [logic-gates, binary] diff --git a/Hardware/Logic_Gates/Xor_gate.md b/Hardware/Logic_Gates/Xor_gate.md index 2f5e497..27e6c81 100644 --- a/Hardware/Logic_Gates/Xor_gate.md +++ b/Hardware/Logic_Gates/Xor_gate.md @@ -1,6 +1,6 @@ --- categories: - - Computer_Architecture + - Computer Architecture - Electronics - Hardware tags: [logic-gates, binary] diff --git a/Hardware/Memory/RAM_types.md b/Hardware/Memory/RAM_types.md index 9bd1cb4..112fbc0 100644 --- a/Hardware/Memory/RAM_types.md +++ b/Hardware/Memory/RAM_types.md @@ -1,6 +1,6 @@ --- categories: - - Computer_Architecture + - Computer Architecture - Hardware tags: [memory, motherboard] --- diff --git a/Hardware/Memory/Role_in_computation.md b/Hardware/Memory/Role_in_computation.md index 86c37ca..fb9e696 100644 --- a/Hardware/Memory/Role_in_computation.md +++ b/Hardware/Memory/Role_in_computation.md @@ -1,6 +1,6 @@ --- categories: - - Computer_Architecture + - Computer Architecture tags: [memory] --- diff --git a/Hardware/Motherboard.md b/Hardware/Motherboard.md index f50171f..6aa7529 100644 --- a/Hardware/Motherboard.md +++ b/Hardware/Motherboard.md @@ -1,6 +1,6 @@ --- categories: - - Computer_Architecture + - Computer Architecture - Hardware tags: [motherboard] --- diff --git a/Logic/Atomic_and_molecular_sentences.md b/Logic/Atomic_and_molecular_sentences.md index f919c43..e3b72e0 100644 --- a/Logic/Atomic_and_molecular_sentences.md +++ b/Logic/Atomic_and_molecular_sentences.md @@ -1,7 +1,7 @@ --- categories: - Logic -tags: [propositional_logic] +tags: [propositional-logic] --- Sentences or propositions (we will use 'sentences' for consistency) are expressions **that have truth values**, either true or false. diff --git a/Logic/Biconditional_Elimination.md b/Logic/Biconditional_Elimination.md index 9049a5e..ee681a8 100644 --- a/Logic/Biconditional_Elimination.md +++ b/Logic/Biconditional_Elimination.md @@ -1,7 +1,7 @@ --- categories: - Logic -tags: [propositional_logic] +tags: [propositional-logic] --- Give that the biconditional means that if $P$ is the case, $Q$ is the case and if $Q$ is the case, $P$ must be the case, if we have $P \equiv Q$ and $P$, we can derive $Q$ and vice versa. diff --git a/Logic/Biconditional_Introduction.md b/Logic/Biconditional_Introduction.md index 1a32680..89b1b9c 100644 --- a/Logic/Biconditional_Introduction.md +++ b/Logic/Biconditional_Introduction.md @@ -1,7 +1,7 @@ --- categories: - Logic -tags: [propositional_logic] +tags: [propositional-logic] --- The biconditional means if $P$ is the case, $Q$ is the case and if $Q$ is the case, $P$ must be the case. Thus to introduce this operator we must demonstrate both that $Q$ follows from $P$ and that $P$ follows from $Q$. We do this via two sub-proofs. diff --git a/Logic/Conditional_Elimination.md b/Logic/Conditional_Elimination.md index aaca47f..bfacdb3 100644 --- a/Logic/Conditional_Elimination.md +++ b/Logic/Conditional_Elimination.md @@ -1,7 +1,7 @@ --- categories: - Logic -tags: [propositional_logic] +tags: [propositional-logic] --- If we have a conditional and we have independently derived its antecedent, we may invoke its consequent. This is often referred to as *Modus ponens* (affirming the antecedent). diff --git a/Logic/Conditional_Introduction.md b/Logic/Conditional_Introduction.md index 90d3a45..9681944 100644 --- a/Logic/Conditional_Introduction.md +++ b/Logic/Conditional_Introduction.md @@ -1,7 +1,7 @@ --- categories: - Logic -tags: [propositional_logic] +tags: [propositional-logic] --- If we can show that $Q$ follows from $P$ (typically via a subproof) than we can assert that P implies Q. This is also sometimes known as _Conditional Proof_ diff --git a/Logic/Conjunction_Elimination.md b/Logic/Conjunction_Elimination.md index 7050835..10fc157 100644 --- a/Logic/Conjunction_Elimination.md +++ b/Logic/Conjunction_Elimination.md @@ -1,7 +1,7 @@ --- categories: - Logic -tags: [propositional_logic] +tags: [propositional-logic] --- diff --git a/Logic/Conjunction_Introduction.md b/Logic/Conjunction_Introduction.md index 114e69e..b8d9fad 100644 --- a/Logic/Conjunction_Introduction.md +++ b/Logic/Conjunction_Introduction.md @@ -1,7 +1,7 @@ --- categories: - Logic -tags: [propositional_logic] +tags: [propositional-logic] --- If two conjuncts have each been independently derived then they can be conjoined. Also known more simply as *Conjunction* diff --git a/Logic/Consistency.md b/Logic/Consistency.md index d4ea87e..2f08431 100644 --- a/Logic/Consistency.md +++ b/Logic/Consistency.md @@ -1,7 +1,7 @@ --- categories: - Logic -tags: [propositional_logic] +tags: [propositional-logic] --- ## Informal definition diff --git a/Logic/Corresponding_material_and_biconditional.md b/Logic/Corresponding_material_and_biconditional.md index 5039116..19db1f9 100644 --- a/Logic/Corresponding_material_and_biconditional.md +++ b/Logic/Corresponding_material_and_biconditional.md @@ -1,7 +1,7 @@ --- categories: - Logic -tags: [propositional_logic] +tags: [propositional-logic] --- ## Corresponding material conditional to show validity diff --git a/Logic/DeMorgan's_Laws.md b/Logic/DeMorgan's_Laws.md index 9ef3c7b..1689c28 100644 --- a/Logic/DeMorgan's_Laws.md +++ b/Logic/DeMorgan's_Laws.md @@ -1,7 +1,7 @@ --- categories: - Logic -tags: [propositional_logic] +tags: [propositional-logic] --- DeMorgan's laws express some fundamental equivalences that obtain between the Boolean [connectives](Truth-functional%20connectives.md): diff --git a/Logic/Disjunction_Elimination.md b/Logic/Disjunction_Elimination.md index 3380cd2..23a6fd4 100644 --- a/Logic/Disjunction_Elimination.md +++ b/Logic/Disjunction_Elimination.md @@ -1,7 +1,7 @@ --- categories: - Logic -tags: [propositional_logic] +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. diff --git a/Logic/Disjunction_Introduction.md b/Logic/Disjunction_Introduction.md index 4bf8882..c4e3b47 100644 --- a/Logic/Disjunction_Introduction.md +++ b/Logic/Disjunction_Introduction.md @@ -1,7 +1,7 @@ --- categories: - Logic -tags: [propositional_logic] +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. diff --git a/Logic/Formal_proofs_in_propositional_logic.md b/Logic/Formal_proofs_in_propositional_logic.md index e22db96..646e980 100644 --- a/Logic/Formal_proofs_in_propositional_logic.md +++ b/Logic/Formal_proofs_in_propositional_logic.md @@ -1,7 +1,7 @@ --- categories: - Logic -tags: [propositional_logic] +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. diff --git a/Logic/Indeterminacy.md b/Logic/Indeterminacy.md index 442f2b4..cd39683 100644 --- a/Logic/Indeterminacy.md +++ b/Logic/Indeterminacy.md @@ -1,7 +1,7 @@ --- categories: - Logic -tags: [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. diff --git a/Logic/Law_of_Non-Contradiction.md b/Logic/Law_of_Non-Contradiction.md index 718d762..70d704f 100644 --- a/Logic/Law_of_Non-Contradiction.md +++ b/Logic/Law_of_Non-Contradiction.md @@ -1,7 +1,7 @@ --- categories: - Logic -tags: [propositional_logic] +tags: [propositional-logic] --- diff --git a/Logic/Law_of_the_Excluded_Middle.md b/Logic/Law_of_the_Excluded_Middle.md index c0e7d0a..a0f1608 100644 --- a/Logic/Law_of_the_Excluded_Middle.md +++ b/Logic/Law_of_the_Excluded_Middle.md @@ -1,7 +1,7 @@ --- categories: - Logic -tags: [propositional_logic] +tags: [propositional-logic] --- > diff --git a/Logic/Logical_equivalence.md b/Logic/Logical_equivalence.md index 9b9e8f5..15aca5a 100644 --- a/Logic/Logical_equivalence.md +++ b/Logic/Logical_equivalence.md @@ -1,7 +1,7 @@ --- categories: - Logic -tags: [propositional_logic] +tags: [propositional-logic] --- > diff --git a/Logic/Logical_possibility_and_necessity.md b/Logic/Logical_possibility_and_necessity.md index cc9cfac..a38865b 100644 --- a/Logic/Logical_possibility_and_necessity.md +++ b/Logic/Logical_possibility_and_necessity.md @@ -1,7 +1,7 @@ --- categories: - Logic -tags: [propositional_logic] +tags: [propositional-logic] --- ## Logical possibility diff --git a/Logic/Logical_truth_and_falsity.md b/Logic/Logical_truth_and_falsity.md index 2b182b9..a90d869 100644 --- a/Logic/Logical_truth_and_falsity.md +++ b/Logic/Logical_truth_and_falsity.md @@ -1,7 +1,7 @@ --- categories: - Logic -tags: [propositional_logic] +tags: [propositional-logic] --- We say of certain sentences that they are logically true or logically false. diff --git a/Logic/Negation_Elimination.md b/Logic/Negation_Elimination.md index ed382d9..b133ebe 100644 --- a/Logic/Negation_Elimination.md +++ b/Logic/Negation_Elimination.md @@ -1,7 +1,7 @@ --- categories: - Logic -tags: [propositional_logic] +tags: [propositional-logic] --- ![negate-elim 1.png](../img/negate-elim%201.png) diff --git a/Logic/Negation_Introduction.md b/Logic/Negation_Introduction.md index f47afab..f2ae930 100644 --- a/Logic/Negation_Introduction.md +++ b/Logic/Negation_Introduction.md @@ -1,7 +1,7 @@ --- categories: - Logic -tags: [propositional_logic] +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. diff --git a/Logic/Object_language_and_meta-language.md b/Logic/Object_language_and_meta-language.md index df23862..09c2a5b 100644 --- a/Logic/Object_language_and_meta-language.md +++ b/Logic/Object_language_and_meta-language.md @@ -1,7 +1,7 @@ --- categories: - Logic -tags: [propositional_logic] +tags: [propositional-logic] --- diff --git a/Logic/Reiteration.md b/Logic/Reiteration.md index 03406cf..29f820f 100644 --- a/Logic/Reiteration.md +++ b/Logic/Reiteration.md @@ -1,7 +1,7 @@ --- categories: - Logic -tags: [propositional_logic] +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. diff --git a/Logic/Soundness.md b/Logic/Soundness.md index 27691bc..c209da9 100644 --- a/Logic/Soundness.md +++ b/Logic/Soundness.md @@ -1,7 +1,7 @@ --- categories: - Logic -tags: [propositional_logic] +tags: [propositional-logic] --- ### Soundness diff --git a/Logic/Strategies_for_constructing_proofs.md b/Logic/Strategies_for_constructing_proofs.md index a8a9798..d02acbe 100644 --- a/Logic/Strategies_for_constructing_proofs.md +++ b/Logic/Strategies_for_constructing_proofs.md @@ -1,7 +1,7 @@ --- categories: - Logic -tags: [propositional_logic] +tags: [propositional-logic] --- ## General strategy diff --git a/Logic/Syllogism.md b/Logic/Syllogism.md index 1030e3a..0c0cc24 100644 --- a/Logic/Syllogism.md +++ b/Logic/Syllogism.md @@ -1,7 +1,7 @@ --- categories: - Logic -tags: [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. diff --git a/Logic/Syntax_of_sentential_logic.md b/Logic/Syntax_of_sentential_logic.md index c979603..4e16db0 100644 --- a/Logic/Syntax_of_sentential_logic.md +++ b/Logic/Syntax_of_sentential_logic.md @@ -1,7 +1,7 @@ --- categories: - Logic -tags: [propositional_logic] +tags: [propositional-logic] --- ## Syntax of formal languages versus semantics diff --git a/Logic/Theorems_and_empty_sets.md b/Logic/Theorems_and_empty_sets.md index 0de1b32..687c996 100644 --- a/Logic/Theorems_and_empty_sets.md +++ b/Logic/Theorems_and_empty_sets.md @@ -1,7 +1,7 @@ --- categories: - Logic -tags: [propositional_logic] +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. diff --git a/Logic/Truth-functional_connectives.md b/Logic/Truth-functional_connectives.md index 352f3c5..43a90b1 100644 --- a/Logic/Truth-functional_connectives.md +++ b/Logic/Truth-functional_connectives.md @@ -1,7 +1,7 @@ --- categories: - Logic -tags: [propositional_logic] +tags: [propositional-logic] --- ## Truth-functional connectives diff --git a/Logic/Truth-tables.md b/Logic/Truth-tables.md index ab4316d..725eebd 100644 --- a/Logic/Truth-tables.md +++ b/Logic/Truth-tables.md @@ -1,7 +1,7 @@ --- categories: - Logic -tags: [propositional_logic] +tags: [propositional-logic] --- # Truth-tables diff --git a/Logic/Truth-trees.md b/Logic/Truth-trees.md index 508cce9..a72b3cc 100644 --- a/Logic/Truth-trees.md +++ b/Logic/Truth-trees.md @@ -1,7 +1,7 @@ --- categories: - Logic -tags: [propositional_logic] +tags: [propositional-logic] --- ## Rationale diff --git a/Logic/Validity_and_entailment.md b/Logic/Validity_and_entailment.md index d0f136b..ffffba6 100644 --- a/Logic/Validity_and_entailment.md +++ b/Logic/Validity_and_entailment.md @@ -1,7 +1,7 @@ --- categories: - Logic -tags: [propositional_logic] +tags: [propositional-logic] --- ## Validity