exam
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
| exam [2011/07/19 14:00] – [Calculi] 131.246.18.253 | exam [2011/08/02 15:29] (current) – [Core HOL] 188.107.127.174 | ||
|---|---|---|---|
| Line 41: | Line 41: | ||
| :?: How are the elements //True// and //False// introduced in HOL? | :?: How are the elements //True// and //False// introduced in HOL? | ||
| - | * Since there should always be an infinite set in **U** whose elements and power sets are also fully contained in **U**, there' | + | * Since there should always be a distinguished |
| :?: Why must all functions be total in Isabelle/ | :?: Why must all functions be total in Isabelle/ | ||
| Line 56: | Line 56: | ||
| * A deductive system is sound if all provable formulas are valid. It is complete if all valid formulas are provable. | * A deductive system is sound if all provable formulas are valid. It is complete if all valid formulas are provable. | ||
| * Validity is a semantic property ($A \models B$), while provability a syntactic one ($A \vdash B$). So, in other words we have: | * Validity is a semantic property ($A \models B$), while provability a syntactic one ($A \vdash B$). So, in other words we have: | ||
| - | * Soundness: $A \vdash B \rightarrow | + | * Soundness: $A \vdash B \longrightarrow |
| - | * Completeness: | + | * Completeness: |
| :?: What are the advantages/ | :?: What are the advantages/ | ||
exam.1311076846.txt.gz · Last modified: by 131.246.18.253
