EDB — 1YK

↑ ← → ↓ view in whole PDF view in whole HTML

View

English

[1YK] You can determine if a formula is well formed by making a finite number of checks using the previous rules: in fact the rules establish that any well-formed formula must be decomposable in terms of well-formed formulas that are shorter than it. So the statement ”this formula is well formed” is ”decidable”.  1

  1. The precise definition of ”decidable” goes beyond these notes. Think of an algorithm written on the computer that, given a formula, with a finite number of computations answer ”well formed” or ”not well formed”. Note, however, that the number of checks to be done grows exponentially with the length of the formula.
Download PDF
Authors: "Mennucci , Andrea C. G." .
Bibliography
Book index
  • formula, well-formed —
Managing blob in: Multiple languages
This content is available in: Italian English