P. Martin-Lof. Notes on constructive mathematics. Almqvist and Wiksell, Stockholm, 1968  Home/Search   Document Not in Database   Summary   Related Articles   Check

....themselves, so that each closed conjunction C can be seen as an element C 2 H, and for the relations we take [ C 0 ] D 0 ] for each closed instance C 0 D 0 of an axiom C D in the theory T . The completeness of this model w.r.t. geometric rules of inference follows from the remark (cf. [8], page 86, for a similar remark used to give a constructive proof of G odel s completeness theorem) 13 Lemma 7.1 If we have X; F 1 (a k 1 ; a k n ) Fm (a k 1 ; a k n ) D where a k ; a k n do not appear in X and D, then we have for all u 1 ; u n 2 M ....

P. Martin-Lof, Notes on Constructive Mathematics. Almqvist & Wiksell, Stockholm, 1970.

....is automatically formalizable in type theory, hence mechanically checkable and (most probably) safe. 3.2. 2 Do points exist The predicative approach to topology leads in a natural way to the consideration of opens as given primitively, i.e. to the so called pointfree or formal approach (see [25], 21] the name is due to the fact that an open subset is only formally so, from the traditional perspective at least, since it does not consist in a subset of points) Actually, as I will show below, predicative topology must contain the formal approach. For this reason, it is sometimes believed ....

P. MARTIN-L(SF, Notes on Constructive Mathematics, Almqvist g5 Wiksell

....1 Introduction In informal constructive mathematics, the fan theorem is an easy consequence of the rule of bar induction. Both are about in nite objects which makes their interpretation in Martin L of s type theory non trivial. Bar induction can be represented in type theory, as proposed in [Mar68] and shown also in this article. But still from this interpretation it is not clear how to formulate and prove the fan theorem formally in type theory. This is because, whereas the usual informal language to treat bar induction and the fan theorem is the same, the formal treatment of the fan ....

....U , where the proof is the proof of u U available at that In type theory, we formulate the de nition of bar for predicates over lists of elements of an arbitrary set, rather than only for predicates over lists of natural numbers. The following de nition is a variation on an idea taken from [Mar68]. De nition 6 (inductive bars) Given a set A and a predicate U over A , U is an inductive bar if U j (to be read U bars the empty sequence) where this is inductively de ned with the following introduction rules. U(u) U j u a 8a 2 A [U j u a] Notice that if U(u) V(u) for ....

P. Martin-Lof. Notes on Constructive Mathematics. Almqvist & Wiksell, 1968.

No context found.

P. Martin-Lof. Notes on constructive mathematics. Almqvist and Wiksell, Stockholm, 1968

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC