chore: tidy up titles
This commit is contained in:
		
							parent
							
								
									0f1a5f5664
								
							
						
					
					
						commit
						6253d33426
					
				
					 9 changed files with 20 additions and 7 deletions
				
			
		|  | @ -2,6 +2,8 @@ | |||
| tags: [] | ||||
| --- | ||||
| 
 | ||||
| # The Pragmatic Programmer (Hunt/Thomas, 1999) | ||||
| 
 | ||||
| ## General | ||||
| 
 | ||||
| ### Meyer's Uniform Access Principle | ||||
|  |  | |||
|  | @ -4,12 +4,13 @@ tags: | |||
|   - logic | ||||
| --- | ||||
| 
 | ||||
| # Theorems and empty sets | ||||
| 
 | ||||
| We know that when we construct a | ||||
| [derivation](Formal_proofs_in_propositional_logic.md#derivation-rules) | ||||
| 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. | ||||
| [derivation](Formal_proofs_in_propositional_logic.md#derivation-rules) 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. | ||||
| 
 | ||||
| _Demonstration_ | ||||
| 
 | ||||
|  |  | |||
|  | @ -4,6 +4,8 @@ tags: | |||
|   - propositional-logic | ||||
| --- | ||||
| 
 | ||||
| # Truth trees | ||||
| 
 | ||||
| ## Rationale | ||||
| 
 | ||||
| Like [truth-tables](Truth-tables.md), truth-trees are a means of graphically | ||||
|  |  | |||
|  | @ -4,6 +4,8 @@ tags: | |||
|   - Turing | ||||
| --- | ||||
| 
 | ||||
| # Turing Machines | ||||
| 
 | ||||
| ## What is a Turing Machine? | ||||
| 
 | ||||
| Turing Machine is a machine that contains mutable state, executes sequences of | ||||
|  |  | |||
|  | @ -3,6 +3,8 @@ tags: | |||
|   - shell | ||||
| --- | ||||
| 
 | ||||
| # Utilities, operators, flags in Bash | ||||
| 
 | ||||
| The following are useful built-in utility methods that you can use for checking | ||||
| and validation in the course of your bash scripts. | ||||
| 
 | ||||
|  |  | |||
|  | @ -4,7 +4,7 @@ tags: | |||
|   - logic | ||||
| --- | ||||
| 
 | ||||
| ## Validity | ||||
| # Validity and entailment | ||||
| 
 | ||||
| ### Informal definition | ||||
| 
 | ||||
|  |  | |||
|  | @ -3,6 +3,8 @@ tags: | |||
|   - shell | ||||
| --- | ||||
| 
 | ||||
| # Variables and datatypes in Bash | ||||
| 
 | ||||
| ## Types | ||||
| 
 | ||||
| ## Variables | ||||
|  |  | |||
|  | @ -4,7 +4,7 @@ tags: [python, csv] | |||
| created: Sunday, April 28, 2024 | ||||
| --- | ||||
| 
 | ||||
| # Working_with_CSVs_in_Python | ||||
| # Working with CSVs in Python | ||||
| 
 | ||||
| ## Core package | ||||
| 
 | ||||
|  |  | |||
|  | @ -4,6 +4,8 @@ tags: | |||
|   - theorems | ||||
| --- | ||||
| 
 | ||||
| # Zero property of multiplication | ||||
| 
 | ||||
| **Let $a$ represent any member of $\mathbb{W}$ or $\mathbb{Z}$ then:** | ||||
| 
 | ||||
| $$ a \cdot 0 = 0 $$ | ||||
|  |  | |||
		Loading…
	
	Add table
		
		Reference in a new issue
	
	 thomasabishop
						thomasabishop