Gerard Allwein Research Associate in Computer Science, Visiting Philosophy Professor.. Allwein investigates the integration of visual and diagrammatic information in formal proofs. The idea is that diagrams can be every bit as formal as sentences and in many cases are better at representing key elements of a proof. Allwein applies his extensive experience in building computer systems (visual interfaces, real-time control systems, network software) to implementations of diagrammatic systems. He also has an active interest in algebraic aspects of non-standard logics and continues to do research on these. His current areas of interest are weak modal operators both in their philosophical interpretations and their mathematical,  categorical dualities between algebraic and topological semantics for logics, algebraic and relational theories applied to diagrammatic systems (in the formal sense following Lawvere), mathematical semantics of computer languages for parallel computation and verification, and diagrammatic logic systems for computer hardware. His Siamese co-investigators (pictured here) are Tinkerbell and Ariel. Email: gtall@cs.indiana.edu
	Michael Dickson Assistant Professor of History and Philosophy of Science. Professor Dickson's general area of research is the philosophy of quantum mechanics. In particular, he is interested in the logical and algebraic structures that one finds in quantum mechanics and quantum probability theory. Recently, his research has focussed on the emergence of classical structures from non-classical structures, and vice versa. This research has taken him to the question of the possibility of defining two-valued homomorphisms (i.e., 'truth-valuations') from non-classical algebras of propositions to the Boolean algebra (0,1) (i.e., ('true', 'false')). It is not yet known exactly what conditions a non-classical algebra must meet in order to admit such homomorphisms, but some partial results are known. Email: midickso@indiana.edu
	J. Michael Dunn Dean of the School of Informatics, Oscar Ewing Professor of Philosophy; Professor of Computer Science; Editor Journal of Philosophical Logic. Dunn is a member of the Cognitive Science Program. His research interests center around the algebraic foundations of logic, and he is cu rrently writing a book and a series of papers on that subject. Besides classical logic, his work focuses on intuitionism, modal logic, relevance logic, and linear logic, and particularly on how representations for certain classes of algebras amount to c ompleteness results for the corresponding logics with respect to a Kripke semantics. On the more philosophical side, Dunn has been working recently on strict (relevant) properties and functions and their application to traditional philosophical problems regarding predication, particularly those involving the notions of intrinsic property and internal relation. He has general interests in proof theory, formal semantics, logic programming, artificial intelligence, and the philosophy of mind. Email: dunn@cs.indiana.edu
	Daniel P. Friedman Professor of Computer Science. Friedman's primary interests lie in the study of programming languages. He finds all facets of them interesting, but focuses mainly on their formal properties. His recent interest has been in the study of the reflective p roperties of languages, monadic effects, abstract interpretation, partial evaluation, semantics in general, and the lambda calculus and denotational semantics in particular. He has interests in object-oriented programming, especially pertaining to the us e of the meta-object protocols, the use of first-class continuations, understanding exception-handling and modularity. Friedman is a long time advocate of languages like LISP or Scheme, where freedom of expression is highly valued. Email: dfried@cs.indiana.edu
	Steven D. Johnson Professor of Computer Science.  Johnson's research is in formal methods for system design.  He uses algebraic methods to model and reason about reactive and embedded systems.  A research tool developed to explore these applications is DDD (Digital Design Derivation), an interactive transformation system.  DDD is used in conjunction with other kinds of reasoning tools to create a environment for rigorous design and implementation.  Johnson has investigated diagrammatic reasoning applications in hardware design, and is involved with an international initiative developing curricula and pedagogy for formal methods education. Email: sjohnson@cs.indiana.edu
	Daniel Leivant Professor of Computer Science and Adjunct Professor of Mathematics and of Philosophy. Leivant's work is mostly on the logical foundations of computing theory and of constructive mathematics. Much of his more recent research has been on relations between logic and computational complexity, including computational complexity for functions of higher type. He also has ongoing interests in formal reasoning about programs, program derivation and transformation, software specification, modal logics, proof theory, and foundational aspects of mathematical logic. Email: leivant@cs.indiana.edu
	Michael A. McRobbie Vice President for Information Technology, Professor of Computer Science, Professor of Philosophy, Adjunct Professor of Information Science, Adjunct Professor of Cognitive Science, and Adjunct Professor of Computer Technology, IUPUI. McRobbie's major research interests include artificial intelligence especially automated deduction, proof theory and various areas in high performance computing and communications, especially parallel symbolic computation. Much of his recent career has been spent in the establishment of advanced computing and communications infrastructure in such areas as parallel computing, virtual reality and high speed network testbeds, both nationally and globally. Email: vpit@indiana.edu
	Jonathan Mills Associate Professor of Computer Science. In 1992 Mills invented Stiquito, a miniature six-legged robot. As of May 1994 over 1600 Stiquitos are in use at more than 500 sites world-wide including CMU, UC Berkeley,  UCLA, Stanford and AT&T Bell Laboratories. Professor Mills and his students are studying the theory, design and VLSI implementation of analog computers. Their current work is focused on analog and hybrid computers described by Lukasiewicz logic. These processors, called Lukasiewicz logic arrays (LLAs), are used to implement computational sensors, neural networks, and fuzzy inference engines. Mills is also collaborating with Professor Rawlins on the Stiquito Colony Project. The project's goal is to c reate a colony of several hundred to 1000 autonomous robots based on Stiquito, and use the colony to study adaptive and emergent behavior, comparing observed behavior to that predicted by simulation. Students interested in this research might develop too ls to synthesize and verify analog computers, apply LLAs as image processors and neural networks, or design, simulate and implement a robot colony to study emergent computation. Email: jwmills@cs.indiana.edu
	Lawrence Moss Associate Professor of Mathematics; Adjunct Associate Professor of Computer Science, and of Linguistics. Moss is a member of the cognitive science program. He is an editor of the Journal of Logic, Language, and Information and is on the editorial board of the Notre Dame Journal of Formal Logic and Language and Computation . He has taught the graduate classes in logic in the mathematics department, including set theory, recursion theory, and a new year-long class on applied model theory. He also is introducing a new undergraduate class called Mathematics from Language. His research is in areas on the border of logic and other fields. Past and present areas include abstract recursion theory, generalized quantifiers, feature structure logics and other interactions of logic and linguistics, modal logic, graph theory, evolving algebras, and abstract data types. He and Jon Barwise wrote a textbook on non-wellfounded sets, and he continues to work on that subject. This work has interactions with recursion theory, and with a new area called coalgebra. Email: lmoss@indiana.edu
	Dirk Van Gucht Associate Professor of Computer Science. Van Gucht's research consists of the design and implementation of database models and database languages that deal with data objects of a complex external and internal organization. Currently, his research focuse s on object-oriented databases and their associated data manipulation operations. Since such databases can be conceptually represented as graphs, he is working with a data model (the so called graph-oriented object data model) wherein the data objects ar e graphs and data manipulation operations are specified as graph transformations. A challenging problem here is to specify procedural to study the foundations of logic and set-theory. Van Gucht has also been interested in genetic algorithms. These adaptive optimization algorithms are applicable to a wide variety of problems such as global function optimization and automatic generation of expert systems. Van Gucht's efforts have concentrated on applying genetic algorithms to the traveling salesman problem and other combinatorial optimization problems. Email: vgucht@cs.indiana.edu
	Amr Sabry Associate Professor of Computer Science. Sabry's research is in the general area of the semantics and logical foundations of programming languages and their implementations. He is teaching graduate classes on the semantics of programming languages, type theory, and safety of Java and the Java Virtual Machine. His research centers on the foundations and applications of ``types as specifications'' and aims at developing formal (automated) approaches to reasoning about the safety of mobile code, and the safe interoperability of component-based software. Email: sabry@cs.indiana.edu
	Slawomir Solecki Assistant Professor in Mathematics. The area of Solecki's research interests is descriptive set theory and its applications to topological transformation groups and real analysis. Email: solecki@math.ucla.edu
	William Wheeler Associate Professor of Mathematics. Wheeler's interests in logic include model theory, proof theory, recursion theory and set theory. Email: wheeler@ucs.indiana.edu
	David Wise Professor of Computer Science. Wise's research interests lie in the field of functional programming languages and algorithms for multiprocessing. The thesis that functional programming is ideal for parallel processing ties these interests to parallel architecture. Because applicative (or functional) languages express only necessary dependencies among values, applicative programs only express sequencing that is truly essential. Wise and his group are using logical techniques in hardware, compilers, and algorithms to enhance the performance of these languages on multiprocessors. Email: dswise@cs.indiana.edu

Program Brochure Logic Seminar

Introduction Requirements and Courses Offered Special Features of the Program How to get more Information