Introduction to sets || Set theory Overview - Part 2
A set is the mathematical model for a collection of different things; a set contains elements or members, which can be mathematical objects of any kind: numbers, symbols, points in space, lines, other geometrical shapes, variables, or even other #sets. The #set with no element is the empty
From playlist Set Theory
Recursively Defined Sets - An Intro
Recursively defined sets are an important concept in mathematics, computer science, and other fields because they provide a framework for defining complex objects or structures in a simple, iterative way. By starting with a few basic objects and applying a set of rules repeatedly, we can g
From playlist All Things Recursive - with Math and CS Perspective
Introduction to sets || Set theory Overview - Part 1
A set is the mathematical model for a collection of different things; a set contains elements or members, which can be mathematical objects of any kind: numbers, symbols, points in space, lines, other geometrical shapes, variables, or even other #sets. The #set with no element is the empty
From playlist Set Theory
Mirror symmetry for complex projective space and optimal towers of algebraic curves by Sergey Galkin
Date/Time: Monday, March 2, 4:00 pm Title: Mirror symmetry for complex projective space and optimal towers of algebraic curves Abstract: I will speak about mirror symmetry for projective threespace, and how with Sergey Rybakov we used it to construct an optimal tower of algebraic curves
From playlist Seminar Series
What is set subtraction? In this video we go over that, the set minus set operation, and an example of subtraction in set theory. This is a handy concept to grasp to understand the complement of a set and universal sets, which I also have videos on. Links below. I hope you find this vide
From playlist Set Theory
Set Theory (Part 2): ZFC Axioms
Please feel free to leave comments/questions on the video and practice problems below! In this video, I introduce some common axioms in set theory using the Zermelo-Fraenkel w/ choice (ZFC) system. Five out of nine ZFC axioms are covered and the remaining four will be introduced in their
From playlist Set Theory by Mathoma
How to Identify the Elements of a Set | Set Theory
Sets contain elements, and sometimes those elements are sets, intervals, ordered pairs or sequences, or a slew of other objects! When a set is written in roster form, its elements are separated by commas, but some elements may have commas of their own, making it a little difficult at times
From playlist Set Theory
This video introduces the basic vocabulary used in set theory. http://mathispower4u.wordpress.com/
From playlist Sets
Find this video and other talks given by worldwide mathematicians on CIRM's Audiovisual Mathematics Library: http://library.cirm-math.fr. And discover all its functionalities: - Chapter markers and keywords to watch the parts of your choice in the video - Videos enriched with abstracts, b
From playlist Mathematical Aspects of Computer Science
Computably enumerable sets and undecidability
In this video we're going to define and implement decidable as well as semidecidable. Code is found under https://gist.github.com/Nikolaj-K/808149debf7c3b09705127f9205f6c3f Other names for the two are recursive or computable resp. recursively enumerable, computably enumerable - I also say
From playlist Programming
Egbert Rijke: Daily applications of the univalence axiom - lecture 2
HYBRID EVENT Recorded during the meeting "Logic and Interactions" the February 22, 2022 by the Centre International de Rencontres Mathématiques (Marseille, France) Filmmaker: Guillaume Hennenfent Find this video and other talks given by worldwide mathematicians on CIRM's Audiovisual M
From playlist Combinatorics
Axiom of Choice and Regularity each imply LEM
I recommend you go through all parts, but thee AC-LEM proof starts at 55:30. If you skip stuff, still watch the section at 8:22, because I talk in terms of those semantics later. The Regularity-LEM proof at 1:50:55 requires definitions from the earlier AC-LEM proof. Timestamps: 0:00 Intro
From playlist Summer of Math Exposition 2 videos
Set Theory 1.1 : Axioms of Set Theory
In this video, I introduce the axioms of set theory and Russel's Paradox. Email : fematikaqna@gmail.com Code : https://github.com/Fematika/Animations Notes : http://docdro.id/5ITQHUW
From playlist Set Theory
Egbert Rijke: Daily applications of the univalence axiom - lecture 3
HYBRID EVENT Recorded during the meeting "Logic and Interactions" the February 24, 2022 by the Centre International de Rencontres Mathématiques (Marseille, France) Filmmaker: Guillaume Hennenfent Find this video and other talks given by worldwide mathematicians on CIRM's Audiovisual M
From playlist Combinatorics
Giles Gardam: Solving semidecidable problems in group theory
Giles Gardam, University of Münster Abstract: Group theory is littered with undecidable problems. A classic example is the word problem: there are groups for which there exists no algorithm that can decide if a product of generators represents the trivial element or not. Many problems (th
From playlist SMRI Algebra and Geometry Online
Ivan Panin - 1/3 A Local Construction of Stable Motivic Homotopy Theory
Notes: https://nextcloud.ihes.fr/index.php/s/dDbMXEc36JQyKts V. Voevodsky [6] invented the category of framed correspondences with the hope to give a new construction of stable motivic homotopy theory SH(k) which will be more friendly for computational purposes. Joint with G. Garkusha we
From playlist Summer School 2020: Motivic, Equivariant and Non-commutative Homotopy Theory
What are Disjoint Sets? | Set Theory
What are disjoint sets? That is the topic of discussion in today's lesson! Two sets, A and B, are disjoint if and only if A intersect B is equal to the empty set. This means that two sets are disjoint if and only if they have no elements in common. This is the same as the two sets being "m
From playlist Set Theory
Martin Bridson - Profinite isomorphism problems.
Martin Bridson (University of Oxford, England)
From playlist T1-2014 : Random walks and asymptopic geometry of groups.
Bettina EICK - Computational group theory, cohomology of groups and topological methods 2
The lecture series will give an introduction to the computer algebra system GAP, focussing on calculations involving cohomology. We will describe the mathematics underlying the algorithms, and how to use them within GAP. Alexander Hulpke's lectures will being with some general computation
From playlist École d'Été 2022 - Cohomology Geometry and Explicit Number Theory
What are Supersets? | Set Theory, Subsets, Set Relations
What are supersets? We'll be going over the definition and examples of supersets in today's video set theory lesson! If B is a subset of A then A is a superset of B. The superset relation is the same as the subset relation but in the opposite direction! Remember if every element of B is
From playlist Set Theory