Subformula property

Facts from the Community

From the Proofs are Programs base

Key contribution:

Date Contributors Why this is interesting
  • 1934
  • Gentzen's subformula property eliminated diversions in the proof process and demonstrated the property of logical consistency. This paved the way for proofs to be interpreted as programs.
top ↑

Similar topics in Freebase

  • Russell's paradox

    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

    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

    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...

These people have edited this topic:

Edit this topic
Edit and Show details

Add or delete facts, download data in JSON or RDF formats, and explore topic metadata.

Freebase Logo
What is Freebase?

Freebase is a huge collection of facts, built by people like you. Freebase connects facts in ways other sites can't, giving you new ways to explore millions of subjects.
You can help improve it!

Freebase Attribution

Freebase data is free for use under the CC-BY license.

Learn more about Freebase licensing and attribution