What type of details about johann makowsky can be gathered from the following bio? Bio: johann -lrb- janos -rrb- a. makowsky -lrb- born march 12 , 1948 in budapest -rrb- is a hungarian born and naturalized swiss mathematician who works in mathematical logic and the logical foundations of computer science and combinatorics . he studied at the swiss federal institute of technology from 1967-73 . he was a student in zurich of e. specker and h. lauchli in mathematical logic , -lrb- diploma in mathematics and physics 1971 , dr. math.sc . in 1974 -rrb- , of b. eckmann -lrb- topology and geometry -rrb- and v. strassen -lrb- algorithmics -rrb- , and in warsaw of a. mostowski and w. marek , where he spent 1972 as an exchange student . makowsky held visiting positions at banach center in warsaw -lrb- poland -rrb- , stanford university -lrb- usa -rrb- , simon fraser university -lrb- canada -rrb- , university of florence -lrb- italy -rrb- , mit -lrb- usa -rrb- , lausanne university and eth zurich -lrb- switzerland -rrb- . he held regular positions at the free university of berlin and the technion - israel institute of technology -lrb- haifa , israel -rrb- where he is a full professor . among his various contributions it is worth mentioning : in model theory , the solution of two open problems in categoricity theory and his study of logics with various interpolation and compactness properties -lrb- partially with s. shelah and j. stavi -rrb- . in database theory , the first undecidability result of the consequence problem for database dependencies -lrb- with a. chandra and h. lewis -rrb- , his work unifying the entity-relationship model and the relational model of databases -lrb- with v. markowitz -rrb- , and his work on boyce codd normal form -lrb- with e.v. ravve -rrb- . in logic programming , his fundamental studies of horn formulas and their complexity -lrb- partially with b. mahr and a. itai -rrb- in graph algorithms , his unifying approach to tree-width and clique-width via model theory , leading to a general theory of graph polynomials and their definability in various logical formalisms -lrb-...
Answer:
- known for - work institutions - field - doctoral advisor - birth date - name - nationality - image - birth place - alma mater