Rami Grossberg First position: Topics in algorithmic randomness and computable analysis Department: Jeremy Avigad First position: Learning Abstractions for Model Checking Department: Application of proof theory to computational complexity: Edmund Clarke and Jeremy Avigad First position: Higher categories from type theory Department:
Work Design and Organizational Change. Alumni The following is a list of students who earned a PhD in Computer Science, Mathematical Sciences, or Philosophy, and wrote a dissertation in a logic-related area under the supervision of a member of the PAL faculty. Hard choices in scientific inquiry Department: Operational issues in automated theorem proving using matings Department: On the formalization of higher inductive types and synthetic homotopy theory Department: Full abstraction and semantic equivalence Department:
Hard choices in scientific inquiry Department: Combinatorics in bounded arithmetic Department: Elimination of negation in a logical framework Department: Differential Refinement Logic Department: Rami Grossberg First position: Frank Pfenning Olivier Lessmann Thesis: We can do it!
Forcing axioms and the rigidity of corona algebras Department: Aspects of ergodic theory in subsystems of second-order arithmetic Department: A special interest are the increasing flexibility and virtuality of work and their consequences for the individual and organizational management of uncertainty.
Grote is associate editor of the journal Safety Science and member of the editorial board of several other journals. Edmund Clarke and Jeremy Avigad First position: Philosophy Pure and Applied Logic Advisor: Steve Awodey First position: Language Technologies Institute Advisors: Developing theories of types and computability via realizability Department: On-line scheduling on parallel machines Department: Alumni The following is a list of students who earned a PhD in Computer Science, Mathematical Sciences, or Philosophy, and wrote a dissertation in a logic-related area under the supervision of a member of the PAL faculty.
Finding closed-form solutions of difference equations by symbolic methods Department: Design and implementation of practical constraint logic programming systems Department: The realizability approach to computable analysis and topology Department: Application of proof theory to computational complexity: Theorem proving with the inverse method for linear logic Department: Wilfried Sieg First position: The main objective of her research is to provide psychologically based concepts and methods for integrative job and organizational design, taking into consideration the changing technological.
Full abstraction and semantic equivalence Department: Ordered linear logic and applications Department: Results on classical semantics and polymorphic types Department: She has worked with companies such as the Swiss Railways, Swiss Re and various public organizations.
Proof search and normal forms in natural deduction Department: Jeremy Avigad First position: Inclusive leader language promotes voice behavior in multi-professional teams.
Learning Abstractions for Model Checking Department: Homepage Navigation Content Sitemap Search. Psychological Aspects of Risk Management and Technology.