The unique readability theorem says that every propositional formula has exactly one of the following forms: a unique propositional variable; for a unique logical formula ; or for a unique ordered pair of logical formulas . These three alternatives are disjoint. Consequently each logical formula has a unique formula syntax tree and a uniquely determined principal logical connective whenever it is not a logical variable.

Ancestors (12)

  1. 1
  2. A
  3. 2008
  4. Past exam of the logic and set theory course of the University of Oxford
  5. Logic and set theory course of the University of Oxford
  6. Year 3 of the mathematics course of the University of Oxford
  7. Mathematics course of the University of Oxford
  8. Undergraduate course of the University of Oxford
  9. Course of the University of Oxford
  10. University of Oxford
  11. List of universities
  12. Home

View article source

Discussion (0) New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version