summaryrefslogtreecommitdiffstats
Commit message (Collapse)AuthorAgeFilesLines
* Functoriality of connectors and of logical formulae.David A. Madore2023-12-041-24/+123
|
* Positive and negative occurrences.David A. Madore2023-12-041-0/+43
|
* A start of polymorphism, and substitution for type/prop variables.David A. Madore2023-12-041-2/+35
|
* Comments on negation and double negation.David A. Madore2023-12-041-0/+40
|
* Curry-Howard: a recapitulation.David A. Madore2023-12-041-4/+47
|
* Various minor changes or additions.David A. Madore2023-12-041-1/+21
|
* More discussion of the logical connectors.David A. Madore2023-12-041-4/+53
|
* Non-uniqueness of proofs.David A. Madore2023-12-031-1/+57
|
* Various examples of Curry-Howard.David A. Madore2023-12-031-1/+81
|
* Curry-Howard correspondence for true and false.David A. Madore2023-12-031-1/+32
|
* An example of Curry-Howard with disjunction.David A. Madore2023-12-031-0/+41
|
* Remarks on products and sums.David A. Madore2023-12-031-2/+44
|
* Curry-Howard correspondence for disjunction.David A. Madore2023-12-031-0/+31
|
* An example of Curry-Howard with implication.David A. Madore2023-12-031-0/+31
|
* An example of Curry-Howard with conjunction.David A. Madore2023-12-031-4/+74
|
* Curry-Howard correspondence for implication alone.David A. Madore2023-12-031-0/+44
|
* Brouwer-Heyting-Kolmogorov interpretation of logical connectives.David A. Madore2023-12-031-1/+28
|
* A few more important tautologies.David A. Madore2023-12-031-1/+5
|
* Various informal explanations of constructive math / intuitionism.David A. Madore2023-12-021-0/+142
|
* Classical logic.David A. Madore2023-12-021-3/+71
|
* Proof of negation vs reduction ad absurdum.David A. Madore2023-12-021-0/+54
|
* Examples of non-tautologies.David A. Madore2023-12-021-3/+37
|
* Some important tautologies.David A. Madore2023-12-021-0/+58
|
* Yet another presentation of natural deduction proofs (flag presentation).David A. Madore2023-12-021-2/+38
|
* Another presentation of natural deduction proofs.David A. Madore2023-12-021-2/+49
|
* An exercise on a possible representation of pairs in functional programming ↵David A. Madore2023-12-011-5/+146
| | | | languages.
* Another exercise on various "loopy" reductions.David A. Madore2023-12-011-1/+120
|
* Give two examples of natural deduction proofs (written in sequent style).David A. Madore2023-11-301-0/+41
|
* Some exercises on the untyped lambda-calculus.David A. Madore2023-11-301-0/+286
|
* Minor fixes.David A. Madore2023-11-301-3/+3
|
* Much longer explanation of the Y (and also Z) combinator.David A. Madore2023-11-281-5/+139
|
* Highlight discharged hypotheses in natural deduction presentation.David A. Madore2023-11-281-3/+7
|
* Fix various small mistakes or unclear points.David A. Madore2023-11-281-9/+8
|
* Alternative notation for multiple lambdas.David A. Madore2023-11-281-2/+3
|
* Avoid speaking of type "constructors", a word which might cause confusion.David A. Madore2023-11-281-4/+4
|
* Typo.David A. Madore2023-11-281-1/+1
|
* Rules of inuitionistic propositional calculus in natural deduction style.David A. Madore2023-11-271-0/+39
|
* Syntax of propositional calculus.David A. Madore2023-11-271-2/+39
|
* Quick overview of intuitionistic propositional calculus.David A. Madore2023-11-271-0/+38
|
* A (humorous) graphical representation of the Curry-Howard correspondence.David A. Madore2023-11-243-4/+27
|
* Graphical representation of typing rules.David A. Madore2023-11-221-8/+35
|
* Brief summary of Tait's proof of normalization of the STLC.David A. Madore2023-11-221-5/+42
|
* Clarification on how to read a derivation tree.David A. Madore2023-11-221-0/+8
|
* Give some examples of terms and types in the STLC before formalizing.David A. Madore2023-11-221-4/+44
|
* A first taste of the Curry-Howard correspondence.David A. Madore2023-11-221-1/+34
|
* A few clarifications on stability of decidable and semidecidable sets.David A. Madore2023-11-221-3/+7
|
* Exercise on computable inseparability.David A. Madore2023-11-211-0/+129
| | | | (Taken from INF105 test from 2018-02-06, slightly rewritten.)
* Prepare exercise sheet for publication.David A. Madore2023-11-211-19/+23
|
* Exercise on looping Turing machines.David A. Madore2023-11-211-0/+71
|
* Exercise showing that the indices of total functions is not semi-decidable ↵David A. Madore2023-11-211-0/+140
| | | | nor co-semi-decidable.
generated by cgit v1.2.3 (git 2.39.1) at 2024-12-23 11:45:42 +0000