Symbolic logic is the area of mathematics which studies the purely formal properties of strings of symbols. The interest in this area springs from two sources. First, the symbols used in symbolic logic can be seen as representing the words used in philosophical logic. Second, the rules for manipulating symbols found in symbolic logic can be implemented on a computing machine.
Symbolic logic is usually divided into two subfields, propositional log...
more
Read article at Wikipedia
Symbolic logic
Facts from the Community
From the Proofs are Programs base
Key contribution:
| Date | Contributors | Why this is interesting | Key artifacts |
|---|---|---|---|
|
|
Similar topics in Freebase
-
Russell's paradox
In the foundations of mathematics, Russell's paradox (also known as Russell's antinomy), discovered by Bertrand Russell in 1901, showed that the naive set theory of Frege leads to a contradiction. It might be assumed that, for any formal criterion, a set exists whose members are those objects (and... -
Sequent calculus
In proof theory and mathematical logic, sequent calculus is a widely known family of formal systems sharing a certain style of inference and certain formal properties. The first sequent calculi, systems LK and LJ, were introduced by Gerhard Gentzen in 1934, as a tool for studying (respectively,... -
Curry–Howard correspondence
The Curry–Howard correspondence is the direct relationship between computer programs and mathematical proofs. Also known as Curry–Howard isomorphism, proofs-as-programs correspondence and formulae-as-types correspondence, it refers to the generalization of a syntactic analogy between systems of...