- Better Explained
- Better Explained
-
Mathematical logic
-
Better Explained
- Propositional Equivalences
- Logical Equivalences
- material equivalence
-
General
-
Theorem
-
Well-formed formula
- Symbol (formal)
-
Formal system/Logical calculus
-
Better Explained
- Formal proof
- Formal semantics (logic)
- An interpretation of a formal language is (roughly) an assignment of meanings to its symbols and truth-conditions to its sentences
- Syntax (logic)
-
Formal language
- Formal grammar
- Formation rule
- Formal definition
- The syntax of grammars
- G = (N,?,P,S)
- The semantics of grammars
- Chomsky hierarchy
- Type-0 grammars
- Recursively enumerable languages
- Type-1 grammars
- Context-sensitive languages
- Type-2 grammars
- Context-free languages
- Backus–Naur Form
- Type-3 grammars
- Regular languages
- Finite state automaton
- Analytic grammars
- Alphabet
- Well-formed formula
- Atomic formula
- Closed formulas
-
Deductive system/Deductive apparatus
- Rule of inference
- Better Explained
- Admissible rule
- Summary
- Simplification
- Addition
- Conjunction
- Resolution
- Disjunctive syllogism
- Hypothetical syllogism
- Modus tollens
- Modus ponens
- Rules for classical sentential calculus
- Rules for negations
- Reductio ad absurdum (or Negation Introduction)
- Reductio ad absurdum (related to the law of excluded middle)
- Noncontradiction (or Negation Elimination)
- Double negation elimination
- Double negation introduction
- Rules for conditionals
- Deduction theorem (or Conditional Introduction)
- Modus ponens (or Conditional Elimination)
- Modus tollens
- Rules for conjunctions
- Adjunction (or Conjunction Introduction)
- Simplification (or Conjunction Elimination)
- Rules for disjunctions
- Addition (or Disjunction Introduction)
- Separation of Cases (or Disjunction Elimination)
- Disjunctive syllogism
- Rules for biconditionals
- Biconditional introduction
- Biconditional Elimination
- Rules of classical predicate calculus
- Universal Introduction (or Universal Generalization)
- Universal Elimination (or Universal Instantiation)
- Existential Introduction (or Existential Generalization)
- Existential Elimination (or Existential Instantiation)
- Axioms
- Logical axioms
- Non-logical axioms
- Axiom schema
- Axiomatic system
- Type theory
- Syntax (logic)
- Symbol (formal)
- Theory (mathematical logic)/formal theory
-
Proof calculus
- Natural deduction
- Entailment
-
Traditional logic/Term logic
-
Proposition
- Tautology (logic)
- Contradiction
- Inference
-
Argument
- Validity
- Cogency
- Syllogism
- Square of opposition
- Venn diagram
-
Propositional logic & Boolean logic
-
Better Explained
-
Logical equivalence
- Identity laws
- Domination laws
- Idempotent laws
- Double negation law
- Commutative laws
- Associative laws
- Distributive laws
- De Morgan's laws
- Absorption laws
- Negation laws
- Boolean function
- Propositional formula
-
Logical connective
-
Better Explained
- Order of precedence
- Negation (not) (¬ or ~)
- Conjunction (and) (, &, or · )
- Disjunction (or) (?)
- Exclusive disjunction/Exclusive or/XOR ?
- Material implication (if...then) (?,? or ?)/Material conditional/Condition statement/??????????????
-
Logical biconditional/Material biconditional/Biconditional (if and only if) (iff) (xnor) (bi-implication)(?,=,?)
- ? is not a logical connective
- p = q is not a compound proposition
- Contingency (philosophy)
- Truth table
-
Predicate logic
-
Propositional function
- Predicate (mathematical logic)
-
Quantification
- Existential quantification
- Universal quantification
- First-order logic
- Second-order logic
- Monadic predicate calculus
-
Classical logic/standard logic
- First-order logic
- Syllogism
- Boolean logic
-
Set theory
-
Class (set theory)
-
Set (mathematics)
- Finitary relation
- Entailment
- Finite set
- Infinite set
- Cardinality
- Uncountable set
- Countable set
- Recursive set
- Disjoint sets
- Membership
- Element (mathematics)
- Subset
- ? ? A.
- A ? A.
- A = B if and only if A ? B and B ? A
- Power set
- Basic operations
- Union (set theory)
- Intersection (set theory)
- Complement (set theory)
- Cartesian product
- n-ary product
- Special sets
- Describing sets
- Intensional definition/??? (???)
- {x|P(x)}
- Enumeration
- Venn diagram
-
Better Explained
- Set Identities.
- Identity laws
- Domination laws
- Idempotent laws
- Complementation law
- Commutative laws
- Associative laws
- Distributive laws
- De Morgan's laws
- AnB=AUB
- Absorption laws
- Complement laws
- Extensionality
-
Function (mathematics)
-
Definition
- Notation
- Domain of a function
- Range (mathematics)
- Ordered pair
-
Function composition
- Functional powers
- Transformation monoid
- Composition operator
- Inverse function
- Function spaces
- bijection, injection and surjection
- Floor and ceiling functions
-
convex, monotonic, unimodal
- Convex function
- Monotonic function
- odd or even
- holomorphic, meromorphic, entire
- vector-valued
- computable
- differentiable, integrable
- linear, polynomial, rational
- algebraic, transcendental
- trigonometric
- fractal
- continuous
- Order theory
- Graph of a function
-
Sequence
- Better Explained
- A function defined on an interval of the integers is usually called a sequence.
- Series (mathematics)
- Basic properties
- Potential confusion
- Convergent series
- Properties of series
- Non-negative terms
- Absolute convergence
- Conditional convergence
- Function series
- Power series
- Laurent series
- Dirichlet series
- Trigonometric series
- Fourier series
- Summation
- Sequences and automata
- Types of sequences
- ±1-sequence
- Arithmetic progression
- Cauchy sequence
- Farey sequence
- Fibonacci sequence
- Geometric progression
- Look-and-say sequence
- Thue–Morse sequence
- Axiomatic set theory
-
Model theory
- Structure (mathematical logic)
- Interpretation (logic)
- Finite model theory
- Non-standard model
- Truth value
-
Proof theory
- Formal proof
- Deductive system
- Formal system
- Theorem
- Entailment
-
Rule of inference
- Modus ponens
- Modustollens
- Hypothetical syllogism
- Disjunctive syllogism
- Addition
- Simplification
- Conjunction
- Resolution
- Fallacy
- Syntax (logic)
-
Mathematical proof
- Direct proof
- Mathematical induction
- Transposition (logic)
- Proof by contradiction
- Constructive proof
- Proof by exhaustion
- Combinatorial proof
- Probabilistic proof
- Nonconstructive proof
- Visual proof
- Elementary proof
- Two-column proof
-
Better Explained
- Existence Proofs
- Uniqueness Proofs
-
Computability theory
- Recursion
- Recursive set
- Recursively enumerable set
- Decision problem
- Church–Turing thesis
- Computable function
- Primitive recursive function
- Philosophical logic
- Metalogic and Metamathematics
- Non-classical logic