Indiana University Program in Pure and Applied Logic
Logic faculty members
Professor of History and Philosophy of Science, and Information Science. Allen is also Director of Undergraduate Studies of our Cognitive Science Program and a memeber of the IU Center for the Integrative Study of Animal Behavior. He is an Associate Editor of the Stanford Encyclopedia of Philosophy. He is a philosopher who is interested in evolutionary approaches to animal behavior and cognition (cognitive ethology). He works closely with biologists and psychologists who are dealing with questions about what can legitimately be inferred about the nature of animal cognition from field and laboratory data. He has also published on other topics in the philosophy of mind and philosophy of biology, artificial intelligence and neural networks. Current projects include a series of papers on animal pain that may lead to a book, a paper on scientific/evolutionary concepts of culture, a book on artificial moral agents, and the capture and analysis of data from web-based logic instructional software to provide context-sensitive feedback to students and to test hypotheses about strategies for teaching and learning logic.
Emeritus Professor of Philosophy. His areas of special interest are logic and formal semantics; philosophy of mathematics, language, and science; artificial intelligence and cognitive science; metaphysics and comparative formal ontology; Montague grammar and philosophical linguistics; and Indian philosophy. He is a member of the editorial board of the Journal of Philosophical Logic, Synthese and Indices: Monographs in Philosophical Logic and Formal Linguistics. He has been both an NEH and an NSF fellow.
Associate Professor of Informatics. His research includes three areas: data mining, database, and bioinformatics. In data mining, he is interested in novel classification techniques and their effective implementation. In databases, he working on query optimization through the use of entropy and modeling of XML. In bioinformatics he is working on two different kinds of projects. The first is the PFA, an information system for the management of protein family annotations. The second project is in computational genomics, applying the novel classification technique from circuit minimization to better classify orthologous protein families.
Emeritus University Dean of the School of Informatics; Professor of Informatics; Professor of Computer Science; Oscar Ewing Professor of Philosophy; and Core Faculty in Cognitive Science. Dunn's research focuses on information based logics and relations between logic and computer science. He is particularly interested in the so-called "sub-structural logics" including intuitionistic logic, relevance logic, linear logic, BCK-logic, and the Lambek Calculus. He has developed an algebraic approach to these and many other logics under the heading of "gaggle theory" (for generalized galois logics), which is contained in a series of papers and in Dunn's book (with Gary Hardegree) Algebraic Methods in Philosophical Logic (Oxford University Press, 2001). He has recently been applying these ideas to model relation algebras, with R.K. Meyer to model combinatory logic, and with K. Bimbo to model Kleene *-algebras and Pratt's dynamic logic. He is also interested in quantum logic and quantum computation. Dunn is North American Editor of the Bulletin of the Section on Logic of the Polish Academy of Sciences, and has been an editor of The Journal of Symbolic Logic and the Journal of Philosophical Logic.
Professor of Philosophy. He is interested in a group of interconnected topics in the philosophy of logic, language and mind, including rule-following, meaning, the analytic-synthetic distinction, anti-individualism, realism, skepticism, self-knowledge, and truth. Also interested in the history of analytic philosophy, especially the writings of Frege, Wittgenstein, Carnap, and Quine. Publications include Rule-Following and Realism , "Can We Take Our Words at Face Value?" "The Very Idea of Sameness of Extension Across Time," "Carnap's Logical Syntax," "Learning from Others," and "A Puzzle About Doubt." Currently developing a conception of words that licenses us accept our ordinary, non-deliberative applications of our own Tarski-style disquotational truth predicates to other speakers' sentences, as well as to our own sentences as we used them in the past.
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 properties 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 use 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.
Assistant Professor of History and Philosophy of Science. He was born and educated in Israel, and received his B.A. (1996) and MA (2000) in philosophy from the Hebrew University of Jerusalem. He wrote his M.A. thesis on the hole argument and the ontology of spacetime theories. His Ph.D. thesis, entitled "Chance and Time" (2004) was written in Vancouver in the University of British Columbia and concerns the foundations of statistical physics. It was also published as an expository book on the philosophy of physics in Israel. His main interests span the foundations of modern physics, especially the origin and source of the probabilities one encounters in statistical and quantum mechanics, the philosophy of time, and the notion of physical computation, especially in the context of quantum information theory. He is currently engaged in several projects in those fields.
Associate Professor of Informatics. He received B.Sc. and M.Sc. degrees in electrical and electronics engineering and wrote a masters thesis on the verification of finite state programs. Later he got a Ph.D. in mathematics, specializing in mathematical logic and category theory. As it is perhaps evident from this background, his research interests cover a wide spectrum ranging from categorical proof theory to hybrid dynamical systems. Specific interests include the geometry of interaction, ludics, algebraic proof theory, and bisumulation in dynamical, control, and hybrid systems.
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.
Assistant Professor of Informatics, and Adjunct Assistant Professor of Computer Science. His current research interests lie in bioinformatics and its related areas such as string-pattern matching, data mining, and combinatorial search techniques. Problems in biology involve a huge amount of data and they are typically computationally hard. In addition, it is often hard to formulate these problems in a formal way, e.g, optimization problems. Thus it is not practical to solve these problems by developing single algorithms. His approach is to develop search frameworks or computational environments where multiple computational tools and databases are integrated in exploratory frameworks where user interactions can guide search. Search frameworks are pursued when we can formulate problems with optimization criteria, and computational environments are pursued when problem formations are not immediately clear and/or a very large amount of data from multiple sources needs to be combined.
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.
Professor of Philosophy. He works on foundational issues in the philosophy of language, especially in connection with meaning, truth and logical form in natural language, and in the philosophy of mind and action, epistemology, and metaphysics. He is the editor of the volume on Donald Davidson (2003) in the Cambridge Contemporary Philosophy in Focus series, and he is coauthor with Ernie Lepore (Rutgers) of Donald Davidson: Meaning, Truth, Language and Reality (OUP 2005) and Donald Davidson‘s Truth- theoretic Semantics (OUP 2007). Recent articles include “Logical Form,” in The Routledge Companion to the Philosophy of Language (in press), “Truth and Meaning Redux” (with Ernie Lepore, Philosophical Studies, 2010), “Semantics” (Cambridge Encyclopedia of the Language Sciences, 2010), “Adverbs of Action and Logical Form” (A Companion to the Philosophy of Action, Wiley, 2009), “Fodor‘s Challenge to the Classical Computational Theory of Mind” (with Susan Schneider, Mind and Language, 2008), “The Concept of Truth and the Semantics of the Truth Predicate” (with Emil Badici, Inquiry, 2007), “Collective Intentional Behavior from the Standpoint of Semantics” (Noûs, 2007), “Ontology in the Theory of Meaning” (with Ernie Lepore, International Journal of Philosophical Studies, 2006), “Semantics for Nondeclaratives” (with Daniel Boisvert, Oxford Handbook of the Philosophy of Language, 2006), and “Davidson‘s Objection to Horwich‘s Minimalism about Truth” (Journal of Philosophy, 2004).
Professor of Philosophy. His research is concerned mainly with mathematical logic and its history, the history of analytical philosophy, and nineteenth century German philosophy.
President of Indiana Unviersity. Professor of Computer and Professor of Philosophy. 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.
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 create 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.
Director, IU Program in Pure and Applied Logic. Professor of Mathematics; Adjunct Professor of Computer Science, Informatics, Linguistics, and Philosophy, and associated with the Cognitive Science and Computational Linguistics Programs. He is an editor of the Journal of Logic, Language, and Information and is on the editorial board of the Review of Symbolic Logic, Notre Dame Journal of Formal Logic, Research on Language and Computation, Grammars, Annals of Mathematics, Computing and Teleinformatics, Logical Methods in Computer Science, and Logic and Logical Philosophy. He chairs the Steering Committee of the North American Summer School in Logic, Language, and Information; also, he will chair the Adavnces in Modal Logic conference to be held in Copenhagen in 2012. His research is in areas of applied logic, including logics for natural language inference, dynamic epistemic logic, coalgebraic logic and recursion theory, circularity, and mathematics of language. Past 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.
Assistant Professor of Informatics. Assistant Professor of Informatics. His research interests include foundational cryptography, applied cryptography, systems security, complexity theory, probabilistic combinatorics, and randomized algorithms. His Masters thesis covered presented an efficient and provable technique for amplifying the security of weak pseudo-random function generates, and his PhD dissertation was on the topic of the limitation of black-box proofs in showing that certain cryptographic primitives are implied by others. The fields of cryptography and complexity theory have strong interactions with logic, and some of these fields' most pressing open questions are most commonly formulated as logical problems. The P vs. NP question is notably the most prominent of such an example.
Professor of Computer Science. He is interested in the time needed to solve Boolean Satisfiability problems. Although the best known algorithms for this problem appear to need time that is exponential in the size of the problem instance, much progress has been made improving the performance of algorithms for this problem. For example, in the early 1990s, the best programs had trouble solving hard random problems with more than 100 variables, but today one can solve such problems with 700 variables. Most of professor Purdom's work has been on determining for particular algorithms which random SAT problems can be solved in polynomial average time and which ones need exponential time.
Emeritus Professor of Computer Science. He served as co-executive director of the Indiana Center for Database Systems from 1990 to 1992. Robertson and his colleagues address the continuing problem of mismatch between information, as images of the real world, and data, as database representations of these images. The traditional solution to this mismatch has been the use of professionals knowledgeable about both environments to span over the mismatch. However, the growth of end-user computing, by eliminating the intervening professionals, makes the mismatch problem much more severe. Therefore Robertson and his colleagues are conceptualizing, designing, and implementing database tools able to represent and to present the real world more meaningfully. But database technology will not by itself solve the mismatch problem, for the data models of the real world will continue to evolve in scope and complexity. Therefore they also continue to explore "significant abstractions" which facilitate the development and representation of data models and the querying and manipulation capabilities within the models.
Professor of Informatics and Computing. Sabry's research is in the general areas of type theory and the semantics of programming languages and their implementations, with a focus on continuations, monads, and their logical foundations.
Senior Lecturer of Philosophy and Director of Associate Instructor Training. Her specialties include logic, cognitive science, philosophy of language, philosophy of logic, epistemology and pedagogical theories. Her other research interests encompass theories of rationality, the psychology of mind and educational psychology. Recent publications include "Rationality, Logic, and Heuristics" (with Raymundo Morado, Conference Proceedings of the Special Session on Knowledge Representation and Reasoning, June 2002 Internal Conference on Artificial Intelligence, CSREA Press), "Walls of Misconceptions" (The Successful Professor, Aug. 2002), "Naive Logic" (Iyyun, Jan. 2003), "Enhancing Students' Motivation: Emotive Aspects" (The Successful Professor, Feb. 2003), and "Enhancing Students' Motivation: Cognitive Aspects (The Successful Professor, May 2003).
Professor Emeritus of Philosophy. Ph.D., University of Toronto. His main area of research is medieval philosophy, with a particular focus on medieval logic and semantic theory. One of his main interests is medieval approaches to paradoxes like the Liar (what they called "insolubles").
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.
Associate Professor of Informatics. His research interests span all areas of computer and communication security. In particular, he is carrying out active research on network security, game theoretic incentive engineering, and anonymity systems. He is also interested in the following areas: denial-of-service attacks; incentive engineering in information security; wireless ad-hoc networks; privacy; worm and virus spread, lightweight cryptography; software security; safe exchange; mobile code security; survivable systems; intrusion detection.
Professor of Philosophy. Her principal interests include history of analytic philosophy (particularly Frege), philosophy of language and philosophy of mathematics. Author of Frege in Perspective (Cornell, 1990) and Frege (Oxford University Press, 1999). She has received fellowships from the Guggenheim Foundation, the American Philosophical Society, the Bogliasco Foundation, and the University of London School of Advanced Study. She has also been awarded an NSF grant and a University of Pittsburgh Mellon Postdoctoral Fellowship. William Wheeler
Professor Emeritus 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.