Skip to main content

Menu

LEVEL 0
0/5 XP
HomeAboutTopicsPricingMy VaultStats

Categories

πŸ€– Artificial Intelligence
☁️ Cloud and Infrastructure
πŸ’Ύ Data and Databases
πŸ’Ό Professional Skills
🎯 Programming and Development
πŸ”’ Security and Networking
πŸ“š Specialized Topics
HomeAboutTopicsPricingMy VaultStats
LEVEL 0
0/5 XP
GitHub
Β© 2026 CheatGridβ„’. All rights reserved.
Privacy PolicyTerms of UseAboutContact

Logic Cheat Sheet

Logic Cheat Sheet

Back to Mathematics and Algorithms
Updated 2026-04-28
Next Topic: Markov Chains and Stochastic Processes Cheat Sheet

Logic is the formal study of reasoning, truth, and inference across mathematics, computer science, philosophy, and artificial intelligence. It provides the foundation for mathematical proof, algorithm design, knowledge representation, and formal verification. At its core, logic distinguishes valid reasoning from fallacious thinking through precise symbolic notation and rigorous rules. A key insight: the validity of an argument depends solely on its structure, not the truth of its content β€” an argument can be valid with false premises, but a sound argument must have both valid structure and true premises. Modern logic extends far beyond classical two-valued systems to encompass modal, temporal, description, non-monotonic, and type-theoretic frameworks that underpin today's AI, programming languages, and automated reasoning tools.


What This Cheat Sheet Covers

This topic spans 18 focused tables and 158 indexed concepts. Below is a complete table-by-table outline of this topic, spanning foundational concepts through advanced details.

Table 1: Logical Connectives and OperatorsTable 2: Propositional Logic FundamentalsTable 3: Logical Equivalence LawsTable 4: Rules of Inference (Propositional)Table 5: Predicate Logic (First-Order Logic)Table 6: Quantifier Equivalences and NegationsTable 7: Rules of Inference for QuantifiersTable 8: Proof TechniquesTable 9: Normal FormsTable 10: Argument Structure and ValidityTable 11: Boolean Algebra and Digital LogicTable 12: Set Theory and LogicTable 13: Metatheoretic PropertiesTable 14: Modal and Non-Classical LogicsTable 15: Formal Systems and AxiomaticsTable 16: Higher-Order and Extended LogicsTable 17: Automated ReasoningTable 18: Logical Fallacies

Table 1: Logical Connectives and Operators

OperatorExampleDescription
Negation
\neg p
Reverses truth value β€” true becomes false, false becomes true.
Conjunction (AND)
p \land q
β€’ True only when both operands are true
β€’ false otherwise.
Disjunction (OR)
p \lor q
β€’ True when at least one operand is true
β€’ false when both are false.
Implication (conditional)
p \to q
β€’ False only when antecedent is true and consequent is false
β€’ true otherwise.

More in Mathematics and Algorithms

  • Linear Programming and the Simplex Method Cheat Sheet
  • Markov Chains and Stochastic Processes Cheat Sheet
  • Abstract Algebra Essentials Cheat Sheet
  • Complex Analysis Cheat Sheet
  • Graph Algorithms Shortest Paths and Network Search Cheat Sheet
  • Number Theory Cheat Sheet
View all 57 topics in Mathematics and Algorithms