The chaotic hypothesis discussed in [GC1] is tested experimentally in a simple conduction model. Besides a confirmation of the hypothesis predictions the results suggest the validity of the hypothesis in the much wider context in which, as the forcing strength grows, the attractor ceases to be an Anosov system and becomes an Axiom A attractor. A first test of the new predictions is also attempted.

is bijective. This sounds easy enough. One should bear in mind, however, that nobody is able to write down explicitly a basis for such innocent Q-vector spaces as the real numbers V = R or the infinite product V = ∏∞ m=1Q. Indeed, to establish the existence of a basis in infinite-dimensional vector spaces one has to use the axiom of choice, or equivalently Zorn’s Lemma, and thereby abandons all...

Ex. 17 Let us call the new system L, i.e. its axioms are all propositional tautologies (Axiom 1) plus the axioms 2> (Axiom 2) and 2φ∧2ψ → 2(φ∧ψ) (Axiom 3), and the rules modus ponens and φ→ ψ 2φ→ 2ψ We have to show that for all formulas φ `K φ ⇔ `L φ. ⇒: For this direction we have to show that L derives all axioms of K and all its rules. Axiom 1 of K is the same as Axiom 1 in L, thus we have no...

We present a set-theoretic, proof-irrelevant model for Calculus of Constructions (CC) with predicative induction and judgmental equality in Zermelo-Fraenkel set theory with an axiom for countably many inaccessible cardinals. We use Aczel’s trace encoding which is universally defined for any function type, regardless of being impredicative. Direct and concrete interpretations of simultaneous ind...

§9.1 The Axiom of Choice We come now to the most important part of set theory for other branches of mathematics. Although infinite set theory is technically the foundation for all mathematics, in practice it is perfectly valid for a mathematician to ignore it – with two exceptions. Of course most of the basic set constructions as outlined in chapter 2 (unions, intersections, cartesian products,...