Download presentation

Presentation is loading. Please wait.

Published byShelby Harrell Modified over 3 years ago

1
Knaster-Tarski fixed point theorem for complete partial order **************** contents **************** Who are Knaster-Tarski? What is elementary fixed point theorem? What is complete partial order? What is Knaster-Tarski fixed point theorem for complete partial order? Why do we have to know it? (applications in CS)

2
Who are Knaster-Tarski? ** Bronisław Knaster (1893–1990 ) Polish mathematician He worked on topology, continuum.topologycontinuum set theory.set theory He was famous for his sense of humour. ** Alfred Tarski original name Alfred Teitelbaum (1901 - 1983) Polish logicianlogician Tarski made contributions to algebra,algebra mathematical logicmathematical logic, set theoryset theory symbolic logicsymbolic logic.

3
Elementary Fixed Point Theorem

4
What is complete partial order? Let (P, ≤) be a partial order –There is, in general, no reason for greatest lower bounds and least upper bounds to exist. –P is a complete partial order if every subset has both greatest lower bounds and least upper bounds

5
What is Knaster-Tarski fixed point theorem Let(P,≤) be a complete ordered set and F: P P monotone. Then the set of fixed points of F, Fix(F), is not empty, that is F has a fixed point. Moreover, Fix(F) is a complete ordered subset of P. In particular, it has the least and greatest elements.

6
Why do we have to know it? (applications in CS) System of equations in knowledge – base systems( database) Denotational semantics in programming languages ex) S ds [if b then S 1 else S 2 ] =cond( B[b], S ds [S 1 ], S ds [S 2 ]) while b do S if b then (S; while b do S) else skip S ds [ while b do S]= cond( B[b], S ds [ while b do S] o S ds [S], id) S ds [ while b do S]= FIX F where F g = cond( B[b], g o S ds [S],id)

Similar presentations

OK

1 Introduction to Abstract Mathematics Sets Section 2.1 Basic Notions of Sets Section 2.2 Operations with sets Section 2.3 Indexed Sets Instructor: Hayk.

1 Introduction to Abstract Mathematics Sets Section 2.1 Basic Notions of Sets Section 2.2 Operations with sets Section 2.3 Indexed Sets Instructor: Hayk.

© 2018 SlidePlayer.com Inc.

All rights reserved.

Ads by Google

Ppt online compressor software Ppt on ms dos commands Slides for ppt on wireless communication Ppt on ip address classes history Ppt on soil moisture sensor Ppt on game theory five nights Ppt on review of related literature powerpoint English 8 unit 13 read ppt on iphone Ppt on red blood cells Ppt on as 14 amalgamation