{'fraction_non_alphanumeric': 0.010510510510510511, 'fraction_numerical': 0.0, 'mean_word_length': 5.413461538461538, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Five Conferences on Undecidability

These five lectures on undecidability were given to students with a good level in mathematics but with no special knowledge on logic. The first conference presents the formalization of mathematics with a short historical survey, the language of first order predicates and the axioms of set theory. The second and third lectures explain the incompleteness phenomena from the Hilbert program until Godel's theorems with a presentation of the sequent calculus of Gentzen.The fourth talk deepens model theory reasoning in the case of the continuum hypothesis, and the last conference gives examples of effective computability results.