Propositional logic is a branch of classical logic. sentential logic,

CF grammar in BNF

An alternative to the syntax definitions given above is to write a context-free (CF) grammar for the language <math>\mathcal{L}</math> in Backus-Naur form (BNF).

Further reading

  • Brown, Frank Markham (2003), Boolean Reasoning: The Logic of Boolean Equations, 1st edition, Kluwer Academic Publishers, Norwell, MA. 2nd edition, Dover Publications, Mineola, NY.
  • Chang, C.C. and Keisler, H.J. (1973), Model Theory, North-Holland, Amsterdam, Netherlands.
  • Kohavi, Zvi (1978), Switching and Finite Automata Theory, 1st edition, McGraw–Hill, 1970. 2nd edition, McGraw–Hill, 1978.
  • Korfhage, Robert R. (1974), Discrete Computational Structures, Academic Press, New York, NY.
  • Lambek, J. and Scott, P.J. (1986), Introduction to Higher Order Categorical Logic, Cambridge University Press, Cambridge, UK.
  • Mendelson, Elliot (1964), Introduction to Mathematical Logic, D. Van Nostrand Company.
  • Formal Predicate Calculus, contains a systematic formal development with axiomatic proof
  • forall x: an introduction to formal logic, by P.D. Magnus, covers formal semantics and proof theory for sentential logic.
  • Chapter 2 / Propositional Logic from Logic In Action
  • Propositional sequent calculus prover on Project Nayuki. (note: implication can be input in the form <code>!X|Y</code>, and a sequent can be a single formula prefixed with <code>></code> and having no commas)
  • Propositional Logic - A Generative Grammar
  • A Propositional Calculator that helps to understand simple expressions