Hilary Whitehall Putnam was an American philosopher, mathematician, and computer scientist, and a major figure in analytic philosophy in the second half of the 20th century. He made significant contributions to philosophy of mind, philosophy of language, philosophy of mathematics, and philosophy of science. Outside philosophy, Putnam contributed to mathematics and computer science. Together with Martin Davis he developed the Davis–Putnam algorithm for the Boolean satisfiability problem and he helped demonstrate the unsolvability of Hilbert's tenth problem.
Frank Plumpton Ramsey was a British philosopher, mathematician, and economist who made major contributions to all three fields before his death at the age of 26. He was a close friend of Ludwig Wittgenstein and, as an undergraduate, translated Wittgenstein's Tractatus Logico-Philosophicus into English. He was also influential in persuading Wittgenstein to return to philosophy and Cambridge. Like Wittgenstein, he was a member of the Cambridge Apostles, the secret intellectual society, from 1921.
John Venn, FRS, FSA was an English mathematician, logician and philosopher noted for introducing Venn diagrams, which are used in logic, set theory, probability, statistics, and computer science. In 1866, Venn published The Logic of Chance, a groundbreaking book which espoused the frequency theory of probability, arguing that probability should be determined by how often something is forecast to occur as opposed to "educated" assumptions. Venn then further developed George Boole's theories in the 1881 work Symbolic Logic, where he highlighted what would become known as Venn diagrams.
Oscar Zariski was a Russian-born American mathematician and one of the most influential algebraic geometers of the 20th century.
In classical logic, propositions are typically unambiguously considered as being true or false. For instance, the proposition one is both equal and not equal to itself is regarded as simply false, being contrary to the Law of Noncontradiction; while the proposition one is equal to one is regarded as simply true, by the Law of Identity. However, some mathematicians, computer scientists, and philosophers have been attracted to the idea that a proposition might be more or less true, rather than wholly true or wholly false. Consider My coffee is hot.
In philosophy and the social sciences, social software is an interdisciplinary research program that borrows mathematical tools and techniques from game theory and computer science in order to analyze and design social procedures. The goals of research in this field are modeling social situations, developing theories of correctness, and designing social procedures.
Computational epistemology is a subdiscipline of formal epistemology that studies the intrinsic complexity of inductive problems for ideal and computationally bounded agents. In short, computational epistemology is to induction what recursion theory is to deduction. It has been applied to problems in philosophy of science.
Timothy Williamson is a British philosopher whose main research interests are in philosophical logic, philosophy of language, epistemology and metaphysics. He is the Wykeham Professor of Logic at the University of Oxford, and fellow of New College, Oxford.
Formal epistemology uses formal methods from decision theory, logic, probability theory and computability theory to model and reason about issues of epistemological interest. Work in this area spans several academic fields, including philosophy, computer science, economics, and statistics. The focus of formal epistemology has tended to differ somewhat from that of traditional epistemology, with topics like uncertainty, induction, and belief revision garnering more attention than the analysis of knowledge, skepticism, and issues with justification.
Vincent Fella Rune Møller Hendricks is a Danish philosopher and logician. He holds a doctoral degree (PhD) and a habilitation (dr.phil) in philosophy and is Professor of Formal Philosophy and Director of the Center for Information and Bubble Studies (CIBS) at University of Copenhagen, Denmark. He was previously Professor of Formal Philosophy at Roskilde University, Denmark. He is member of IIP, the Institut International de Philosophie in Paris.
The lottery paradox arises from Henry E. Kyburg Jr. considering a fair 1,000-ticket lottery that has exactly one winning ticket. If that much is known about the execution of the lottery, it is then rational to accept that some ticket will win.
Andreas Raphael Blass is a mathematician, currently a professor at the University of Michigan. He works in mathematical logic, particularly set theory, and theoretical computer science.
John L. Pollock (1940–2009) was an American philosopher known for influential work in epistemology, philosophical logic, cognitive science, and artificial intelligence.
Sergei Nikolaevich Artemov is a Russian-American researcher in logic and its applications. He currently holds the title of Distinguished Professor at the Graduate Center of the City University of New York where he is the founder and head of its research laboratory for logic and computation. His research interests include proof theory and logic in computer science, optimal control and hybrid systems, automated deduction and verification, epistemology, and epistemic game theory. He is best known for his invention of logics of proofs and justifications.
Melvin Fitting is a logician with special interests in philosophical logic and tableau proof systems. He was a professor at Lehman College and the Graduate Center of the City University of New York. from 1968 to 2013. At the Graduate Center he was in the departments of Computer Science, Philosophy, and Mathematics, and at Lehman College he was in the department of Mathematics and Computer Science. He is now Professor emeritus.
Joel David Hamkins is an American mathematician and philosopher who is O'Hara Professor of Philosophy and Mathematics at the University of Notre Dame. He has made contributions in mathematical and philosophical logic, set theory and philosophy of set theory, in computability theory, and in group theory.
Lenore D. Zuck is an Israeli-American computer scientist whose research involves formal methods in software engineering, as well as information privacy. She is a research professor of computer science at the University of Illinois Chicago.
