knots braids and first order logic
play

Knots, Braids and First Order Logic Siddhartha Gadgil and T. V. H. - PowerPoint PPT Presentation

Sep 12, 2023 •46 likes •976 views

Knots and Links Link Axioms Algebraic Formulation of Knot Theory Stable Links and Infinite Braids Infinite Braids as a Canonical Model Knots, Braids and First Order Logic Siddhartha Gadgil and T. V. H. Prathamesh Indian Institute of Science,

  1. Knots and Links Link Axioms Algebraic Formulation of Knot Theory Stable Links and Infinite Braids Infinite Braids as a Canonical Model Knots, Braids and First Order Logic Siddhartha Gadgil and T. V. H. Prathamesh Indian Institute of Science, Bangalore September 18, 2012 Siddhartha Gadgil and T. V. H. Prathamesh Knots, Braids and First Order Logic

  2. Knots and Links Link Axioms Algebraic Formulation of Knot Theory Stable Links and Infinite Braids Infinite Braids as a Canonical Model Outline Knots and Links 1 Link Axioms 2 Algebraic Formulation of Knot Theory 3 Stable Links and Infinite Braids 4 Infinite Braids as a Canonical Model 5 Siddhartha Gadgil and T. V. H. Prathamesh Knots, Braids and First Order Logic

  3. Knots and Links Link Axioms Algebraic Formulation of Knot Theory Stable Links and Infinite Braids Infinite Braids as a Canonical Model Knot Definition A knot K is defined as the image of a smooth, injective map h : S 1 → S 3 so that h ′ ( θ ) � = 0 for all θ ∈ S 1 . Siddhartha Gadgil and T. V. H. Prathamesh Knots, Braids and First Order Logic

  4. Knots and Links Link Axioms Algebraic Formulation of Knot Theory Stable Links and Infinite Braids Infinite Braids as a Canonical Model Knot Definition A knot K is defined as the image of a smooth, injective map h : S 1 → S 3 so that h ′ ( θ ) � = 0 for all θ ∈ S 1 . (Image source: Wikipedia) Siddhartha Gadgil and T. V. H. Prathamesh Knots, Braids and First Order Logic

  5. Knots and Links Link Axioms Algebraic Formulation of Knot Theory Stable Links and Infinite Braids Infinite Braids as a Canonical Model Link Definition A link L ⊂ S 3 is a smooth 1-dimensional submanifold of S 3 such that each component of L is a knot and there are only finitely many components. Siddhartha Gadgil and T. V. H. Prathamesh Knots, Braids and First Order Logic

  6. Knots and Links Link Axioms Algebraic Formulation of Knot Theory Stable Links and Infinite Braids Infinite Braids as a Canonical Model Link Definition A link L ⊂ S 3 is a smooth 1-dimensional submanifold of S 3 such that each component of L is a knot and there are only finitely many components. Siddhartha Gadgil and T. V. H. Prathamesh Knots, Braids and First Order Logic

  7. Knots and Links Link Axioms Algebraic Formulation of Knot Theory Stable Links and Infinite Braids Infinite Braids as a Canonical Model When are two knots(or links) regarded as same or different? Siddhartha Gadgil and T. V. H. Prathamesh Knots, Braids and First Order Logic

  8. Knots and Links Link Axioms Algebraic Formulation of Knot Theory Stable Links and Infinite Braids Infinite Braids as a Canonical Model When are two knots(or links) regarded as same or different? Siddhartha Gadgil and T. V. H. Prathamesh Knots, Braids and First Order Logic

  9. Knots and Links Link Axioms Algebraic Formulation of Knot Theory Stable Links and Infinite Braids Infinite Braids as a Canonical Model When are two knots(or links) regarded as same or different? Siddhartha Gadgil and T. V. H. Prathamesh Knots, Braids and First Order Logic

  10. Knots and Links Link Axioms Algebraic Formulation of Knot Theory Stable Links and Infinite Braids Infinite Braids as a Canonical Model Definition (Ambient Isotopy) Two links L 1 and L 2 in S 3 are said to be ambient isotopic if there exists a smooth map F : S 3 × [0 , 1] → S 3 such that Siddhartha Gadgil and T. V. H. Prathamesh Knots, Braids and First Order Logic

  11. Knots and Links Link Axioms Algebraic Formulation of Knot Theory Stable Links and Infinite Braids Infinite Braids as a Canonical Model Definition (Ambient Isotopy) Two links L 1 and L 2 in S 3 are said to be ambient isotopic if there exists a smooth map F : S 3 × [0 , 1] → S 3 such that 1 F | S 3 ×{ 0 } = id | S 3 : S 3 → S 3 . Siddhartha Gadgil and T. V. H. Prathamesh Knots, Braids and First Order Logic

  12. Knots and Links Link Axioms Algebraic Formulation of Knot Theory Stable Links and Infinite Braids Infinite Braids as a Canonical Model Definition (Ambient Isotopy) Two links L 1 and L 2 in S 3 are said to be ambient isotopic if there exists a smooth map F : S 3 × [0 , 1] → S 3 such that 1 F | S 3 ×{ 0 } = id | S 3 : S 3 → S 3 . 2 F | S 3 ×{ 1 } ( L 1 ) = L 2 . Siddhartha Gadgil and T. V. H. Prathamesh Knots, Braids and First Order Logic

  13. Knots and Links Link Axioms Algebraic Formulation of Knot Theory Stable Links and Infinite Braids Infinite Braids as a Canonical Model Definition (Ambient Isotopy) Two links L 1 and L 2 in S 3 are said to be ambient isotopic if there exists a smooth map F : S 3 × [0 , 1] → S 3 such that 1 F | S 3 ×{ 0 } = id | S 3 : S 3 → S 3 . 2 F | S 3 ×{ 1 } ( L 1 ) = L 2 . 3 F | S 3 ×{ t } is a diffeomorphism ∀ t ∈ [0 , 1] Siddhartha Gadgil and T. V. H. Prathamesh Knots, Braids and First Order Logic

  14. Knots and Links Link Axioms Algebraic Formulation of Knot Theory Stable Links and Infinite Braids Infinite Braids as a Canonical Model Definition (Ambient Isotopy) Two links L 1 and L 2 in S 3 are said to be ambient isotopic if there exists a smooth map F : S 3 × [0 , 1] → S 3 such that 1 F | S 3 ×{ 0 } = id | S 3 : S 3 → S 3 . 2 F | S 3 ×{ 1 } ( L 1 ) = L 2 . 3 F | S 3 ×{ t } is a diffeomorphism ∀ t ∈ [0 , 1] 4 F is smooth. Siddhartha Gadgil and T. V. H. Prathamesh Knots, Braids and First Order Logic

  15. Knots and Links Link Axioms Algebraic Formulation of Knot Theory Stable Links and Infinite Braids Infinite Braids as a Canonical Model Definition (Ambient Isotopy) Two links L 1 and L 2 in S 3 are said to be ambient isotopic if there exists a smooth map F : S 3 × [0 , 1] → S 3 such that 1 F | S 3 ×{ 0 } = id | S 3 : S 3 → S 3 . 2 F | S 3 ×{ 1 } ( L 1 ) = L 2 . 3 F | S 3 ×{ t } is a diffeomorphism ∀ t ∈ [0 , 1] 4 F is smooth. Ambient isotopy induces an equivalence relation between links. Knot Equivalence Problem : Given two knots K 1 and K 2 , are they ambient isotopic to each other? Unknotting Problem : Given two knot, is it ambient isotopic to the unknot? Siddhartha Gadgil and T. V. H. Prathamesh Knots, Braids and First Order Logic

  16. Knots and Links Link Axioms Algebraic Formulation of Knot Theory Stable Links and Infinite Braids Infinite Braids as a Canonical Model Stable Equivalence of Links Siddhartha Gadgil and T. V. H. Prathamesh Knots, Braids and First Order Logic

  17. Knots and Links Link Axioms Algebraic Formulation of Knot Theory Stable Links and Infinite Braids Infinite Braids as a Canonical Model Stable Equivalence of Links Definition A link L ′ is said to be a stabilisation of a link L if the following conditions hold. Siddhartha Gadgil and T. V. H. Prathamesh Knots, Braids and First Order Logic

  18. Knots and Links Link Axioms Algebraic Formulation of Knot Theory Stable Links and Infinite Braids Infinite Braids as a Canonical Model Stable Equivalence of Links Definition A link L ′ is said to be a stabilisation of a link L if the following conditions hold. 1 L ′ = L ∪ L ′′ with L ′′ disjoint from L . Siddhartha Gadgil and T. V. H. Prathamesh Knots, Braids and First Order Logic

  19. Knots and Links Link Axioms Algebraic Formulation of Knot Theory Stable Links and Infinite Braids Infinite Braids as a Canonical Model Stable Equivalence of Links Definition A link L ′ is said to be a stabilisation of a link L if the following conditions hold. 1 L ′ = L ∪ L ′′ with L ′′ disjoint from L . 2 There is a collection of disjoint, smoothly embedded discs n D = { D 1 , D 2 , . . . , D n } in S 3 \ L , with L ′′ = � ∂ D i i =1 Siddhartha Gadgil and T. V. H. Prathamesh Knots, Braids and First Order Logic

  20. Knots and Links Link Axioms Algebraic Formulation of Knot Theory Stable Links and Infinite Braids Infinite Braids as a Canonical Model Stable Equivalence of Links Definition A link L ′ is said to be a stabilisation of a link L if the following conditions hold. 1 L ′ = L ∪ L ′′ with L ′′ disjoint from L . 2 There is a collection of disjoint, smoothly embedded discs n D = { D 1 , D 2 , . . . , D n } in S 3 \ L , with L ′′ = � ∂ D i i =1 Siddhartha Gadgil and T. V. H. Prathamesh Knots, Braids and First Order Logic

  21. Knots and Links Link Axioms Algebraic Formulation of Knot Theory Stable Links and Infinite Braids Infinite Braids as a Canonical Model Stable Equivalence of Links Definition A link L ′ is said to be a stabilisation of a link L if the following conditions hold. 1 L ′ = L ∪ L ′′ with L ′′ disjoint from L . 2 There is a collection of disjoint, smoothly embedded discs n D = { D 1 , D 2 , . . . , D n } in S 3 \ L , with L ′′ = � ∂ D i i =1 Siddhartha Gadgil and T. V. H. Prathamesh Knots, Braids and First Order Logic

  22. Knots and Links Link Axioms Algebraic Formulation of Knot Theory Stable Links and Infinite Braids Infinite Braids as a Canonical Model Stable Equivalence of Links Definition A link L ′ is said to be a stabilisation of a link L if the following conditions hold. 1 L ′ = L ∪ L ′′ with L ′′ disjoint from L . 2 There is a collection of disjoint, smoothly embedded discs n D = { D 1 , D 2 , . . . , D n } in S 3 \ L , with L ′′ = � ∂ D i i =1 Siddhartha Gadgil and T. V. H. Prathamesh Knots, Braids and First Order Logic

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

On Vassiliev invariants of braids of the sphere Vladimir Vershinin "Knots, braids and

On Vassiliev invariants of braids of the sphere Vladimir Vershinin "Knots, braids and

On Vassiliev invariants of braids of the sphere Vladimir Vershinin "Knots, braids and automorphism groups ", Novosibirsk, July 22, 2014 V. Vershinin Vassiliev invariants of braids The talk is based on the joint work with Nizar Kaabi

1.14k views • 53 slides
Symmetric cohomology of groups Mahender Singh Knots, Braids and Automorphism Groups Novosibirsk

Symmetric cohomology of groups Mahender Singh Knots, Braids and Automorphism Groups Novosibirsk

Symmetric cohomology of groups Mahender Singh Knots, Braids and Automorphism Groups Novosibirsk July 2014 Mahender Singh IISER Mohali Introduction Cohomology of groups is a contravariant functor turning groups and modules over groups into

809 views • 34 slides
Homotopy groups, braids and links Jie Wu National University of Singapore Novosibirsk workshop

Homotopy groups, braids and links Jie Wu National University of Singapore Novosibirsk workshop

Homotopy Groups Combinatorial Aspects of Homotopy Groups Homotopy and Braids Homotopy and Links Homotopy groups, braids and links Jie Wu National University of Singapore Novosibirsk workshop on "Knots, Braids, and Automorphism

2.08k views • 23 slides
Logic as a Tool Chapter 3: Understanding First-order Logic 3.2 Semantics of first-order logic

Logic as a Tool Chapter 3: Understanding First-order Logic 3.2 Semantics of first-order logic

Logic as a Tool Chapter 3: Understanding First-order Logic 3.2 Semantics of first-order logic Valentin Goranko Stockholm University October 2016 Goranko Translation from first-order logic to natural language: examples in the structure of real

994 views • 20 slides
First-order logic Whereas propositional logic assumes world contains facts , first-order logic

First-order logic Whereas propositional logic assumes world contains facts , first-order logic

First-order logic Whereas propositional logic assumes world contains facts , first-order logic (like natural language) assumes the world contains First-order logic Objects: people, houses, numbers, theories, Ronald McDonald, colors, baseball

245 views • 6 slides
Using first order logic (Ch. 8-9) Review: First order logic In first order logic, we have objects

Using first order logic (Ch. 8-9) Review: First order logic In first order logic, we have objects

Using first order logic (Ch. 8-9) Review: First order logic In first order logic, we have objects and relations between objects The relations are basically a list of all valid tuples that satisfy the relation We can also have variables that

451 views • 26 slides
Using first order logic (Ch. 8-9) Review: First order logic In first order logic, we have objects

Using first order logic (Ch. 8-9) Review: First order logic In first order logic, we have objects

Using first order logic (Ch. 8-9) Review: First order logic In first order logic, we have objects and relations between objects The relations are basically a list of all valid tuples that satisfy the relation We can also have variables that

382 views • 24 slides
Logic as a Tool Chapter 3: Understanding First-order Logic 3.1 First-order structures and

Logic as a Tool Chapter 3: Understanding First-order Logic 3.1 First-order structures and

Logic as a Tool Chapter 3: Understanding First-order Logic 3.1 First-order structures and languages. Terms and formulae of first-order logic. Valentin Goranko Stockholm University October 2016 Goranko Propositional logic is too weak

188 views • 14 slides
Logic as a Tool Chapter 3: Understanding First-order Logic 3.1 First-order structures and

Logic as a Tool Chapter 3: Understanding First-order Logic 3.1 First-order structures and

Logic as a Tool Chapter 3: Understanding First-order Logic 3.1 First-order structures and languages. Terms and formulae of first-order logic. Valentin Goranko Stockholm University October 2016 Goranko Propositional logic is too weak Goranko

1.69k views • 109 slides
Why higher-order logic? Higher-Order logic Expressive Mathematics Verification

Why higher-order logic? Higher-Order logic Expressive Mathematics Verification

Extending SMT solvers to higher-order logic Haniel Barbosa Andrew Reynolds Daniel El Ouraoui Clark Barrett Cesare Tinelli SMT 2019 20190707, Lisbon, PT To be published in the proceedings of CADE 2019 Why higher-order logic?

569 views • 25 slides
First-Order Logic over Active Domain We consider First-Order Logic (FOL) exactly as used in

First-Order Logic over Active Domain We consider First-Order Logic (FOL) exactly as used in

First-Order Logic over Active Domain We consider First-Order Logic (FOL) exactly as used in relational database queries. This requires to drop functions except for constants. In particuar we assume to have a countably infinite set of constants

542 views • 5 slides
ARTIFICIAL INTELLIGENCE Russell & Norvig Chapter 8. First-Order Logic First-Order Logic

ARTIFICIAL INTELLIGENCE Russell & Norvig Chapter 8. First-Order Logic First-Order Logic

ARTIFICIAL INTELLIGENCE Russell & Norvig Chapter 8. First-Order Logic First-Order Logic First-Order Predicate Logic / Calculus Much more powerful the propositional (Boolean) logic Greater expressive power than propositional

589 views • 20 slides
First-order logic 6 AI Slides (5e) c Lin Zuoquan@PKU 2003-2019 6 1 6 First-Order Logic

First-order logic 6 AI Slides (5e) c Lin Zuoquan@PKU 2003-2019 6 1 6 First-Order Logic

First-order logic 6 AI Slides (5e) c Lin Zuoquan@PKU 2003-2019 6 1 6 First-Order Logic 6.1 First-order logic Syntax Semantics 6.2 Knowledge representation in FOL 6.3 Agents in first-order case AI Slides (5e) c Lin

814 views • 45 slides
Markov Logic Markov Logic Probability First-Order Logic Propositional Logic Markov Logic

Markov Logic Markov Logic Probability First-Order Logic Propositional Logic Markov Logic

Putting the Pieces Together Markov Logic Markov Logic Probability First-Order Logic Propositional Logic Markov Logic Definition A Markov Logic Network (MLN) is a set of A logical KB is a set of hard constraints pairs (F, w) where on

350 views • 6 slides
Logic-based Program Verification Decidability of Propositional and First-Order Logic. First-Order

Logic-based Program Verification Decidability of Propositional and First-Order Logic. First-Order

Logic-based Program Verification Decidability of Propositional and First-Order Logic. First-Order Theories. Theory of Equality M ad alina Era scu Tudor Jebelean Research Institute for Symbolic Computation, Johannes Kepler University,

1.3k views • 92 slides
Outline First-order logic Syntax and semantics Inference First-order Logic

Outline First-order logic Syntax and semantics Inference First-order Logic

Outline First-order logic Syntax and semantics Inference First-order Logic Propositionalization with ground inference Lifted resolution CS 486/686 Sept 25, 2008 University of Waterloo 1 2 CS486/686 Lecture Slides (c)

81 views • 6 slides
Strong normalization for -calculi with recursion Ulrich Berger Swansea 1 Motivation:

Strong normalization for -calculi with recursion Ulrich Berger Swansea 1 Motivation:

Dagstuhl Seminar Mathematics, Algorithms, Proofs 10-14 January, 2005 Strong normalization for -calculi with recursion Ulrich Berger Swansea 1 Motivation: Computational content of classical mathematics 1958 G odel Dialectica

793 views • 30 slides
Introduction to Typed Lambda Calculus Carl Pollard Department of Linguistics Ohio State

Introduction to Typed Lambda Calculus Carl Pollard Department of Linguistics Ohio State

Introduction to Typed Lambda Calculus Carl Pollard Department of Linguistics Ohio State University November 22, 2011 Carl Pollard Introduction to Typed Lambda Calculus Typed Lambda Calculi: Background Developed starting with Church and Curry

562 views • 21 slides
Linear two-sorted arithmetic Helmut Schwichtenberg Mathematisches Institut, LMU, M unchen

Linear two-sorted arithmetic Helmut Schwichtenberg Mathematisches Institut, LMU, M unchen

Linear two-sorted higher type terms Linear two-sorted arithmetic Linear two-sorted arithmetic Helmut Schwichtenberg Mathematisches Institut, LMU, M unchen Kyoto University, Japan, 8. May 2009 Helmut Schwichtenberg Linear two-sorted

907 views • 25 slides
CSE 505: Programming Languages Lecture 12 The Curry-Howard Isomorphism Zach Tatlock Fall

CSE 505: Programming Languages Lecture 12 The Curry-Howard Isomorphism Zach Tatlock Fall

CSE 505: Programming Languages Lecture 12 The Curry-Howard Isomorphism Zach Tatlock Fall 2013 We are Language Designers! What have we done? Define a programming language we were fairly formal still pretty close to OCaml if you

446 views • 31 slides
A graph easy class of mute terms A. Bucciarelli, A.Carraro, G.Favro, A.Salibra ICTCS 2014,

A graph easy class of mute terms A. Bucciarelli, A.Carraro, G.Favro, A.Salibra ICTCS 2014,

A graph easy class of mute terms A. Bucciarelli, A.Carraro, G.Favro, A.Salibra ICTCS 2014, Perugia Terms representing undefinedness. A natural problem arising in -calculus is what terms should be considered as representative of undefined

1.03k views • 73 slides
Concepts of programming languages Lecture 7 Wouter Swierstra Faculty of Science Information and

Concepts of programming languages Lecture 7 Wouter Swierstra Faculty of Science Information and

Faculty of Science Information and Computing Sciences 1 Concepts of programming languages Lecture 7 Wouter Swierstra Faculty of Science Information and Computing Sciences 2 Last time What is the -calculus? How can we define its

1.06k views • 62 slides
High Order Image Terms and Harmonic Closed Orbits at the ISIS Synchrotron Ben Pine With thanks

High Order Image Terms and Harmonic Closed Orbits at the ISIS Synchrotron Ben Pine With thanks

High Order Image Terms and Harmonic Closed Orbits at the ISIS Synchrotron Ben Pine With thanks to Dr Chris Warsop, ISIS Synchrotron Group and Operations Team ISIS, Rutherford Appleton Laboratory, UK Science and Technology Facilities Council

873 views • 29 slides
Classical realizability in the CPS target language Jonas Frey Piriapolis, 20 July 2016 article:

Classical realizability in the CPS target language Jonas Frey Piriapolis, 20 July 2016 article:

Classical realizability in the CPS target language Jonas Frey Piriapolis, 20 July 2016 article: https://sites.google.com/site/jonasfreysite/mfps.pdf 1 / 24 Negative and CPS translation Glivenko (1929): A classically provable iff A

822 views • 24 slides

More recommend