Related Research Articles
Alfred Tarski was a Polish-American logician and mathematician. A prolific author best known for his work on model theory, metamathematics, and algebraic logic, he also contributed to abstract algebra, topology, geometry, measure theory, mathematical logic, set theory, and analytic philosophy.
Dana Stewart Scott is an American logician who is the emeritus Hillman University Professor of Computer Science, Philosophy, and Mathematical Logic at Carnegie Mellon University; he is now retired and lives in Berkeley, California. His work on automata theory earned him the Turing Award in 1976, while his collaborative work with Christopher Strachey in the 1970s laid the foundations of modern approaches to the semantics of programming languages. He has also worked on modal logic, topology, and category theory.
George Stephen Boolos was an American philosopher and a mathematical logician who taught at the Massachusetts Institute of Technology.
Solomon Feferman was an American philosopher and mathematician who worked in mathematical logic. In addition to his prolific technical work in proof theory, computability theory, and set theory, he was known for his contributions to the history of logic and as a vocal proponent of the philosophy of mathematics known as predicativism, notably from an anti-platonist stance.
Richard Merritt Montague was an American mathematician and philosopher who made contributions to mathematical logic and the philosophy of language. He is known for proposing Montague grammar to formalize the semantics of natural language. As a student of Alfred Tarski, he also contributed early developments to axiomatic set theory (ZFC). For the latter half of his life, he was a professor at the University of California, Los Angeles until his early death, believed to be a homicide, at age 40.
Kenneth Jon Barwise was an American mathematician, philosopher and logician who proposed some fundamental revisions to the way that logic is understood and used.
The Lwów–Warsaw School was an interdisciplinary school founded by Kazimierz Twardowski in 1895 in Lemberg, Austro-Hungary.
Charles Dacre Parsons was an American philosopher best known for his work in the philosophy of mathematics and the study of the philosophy of Immanuel Kant. He was professor emeritus at Harvard University.
In mathematics, logic and philosophy of mathematics, something that is impredicative is a self-referencing definition. Roughly speaking, a definition is impredicative if it invokes the set being defined, or another set that contains the thing being defined. There is no generally accepted precise definition of what it means to be predicative or impredicative. Authors have given different but related definitions.
Jean Louis Maxime van Heijenoort was a historian of mathematical logic. He was also a personal secretary to Leon Trotsky from 1932 to 1939, and an American Trotskyist until 1947.
Mojżesz Presburger, or Prezburger, was a Polish Jewish mathematician, logician, and philosopher. He was a student of Alfred Tarski, Jan Łukasiewicz, Kazimierz Ajdukiewicz, and Kazimierz Kuratowski. He is known for, among other things, having invented Presburger arithmetic as a student in 1929 – a form of arithmetic in which one allows induction but removes multiplication, to obtain a decidable theory.
Gentzen's consistency proof is a result of proof theory in mathematical logic, published by Gerhard Gentzen in 1936. It shows that the Peano axioms of first-order arithmetic do not contain a contradiction, as long as a certain other system used in the proof does not contain any contradictions either. This other system, today called "primitive recursive arithmetic with the additional principle of quantifier-free transfinite induction up to the ordinal ε0", is neither weaker nor stronger than the system of Peano axioms. Gentzen argued that it avoids the questionable modes of inference contained in Peano arithmetic and that its consistency is therefore less controversial.
In mathematics, the Feferman–Schütte ordinal (Γ0) is a large countable ordinal. It is the proof-theoretic ordinal of several mathematical theories, such as arithmetical transfinite recursion. It is named after Solomon Feferman and Kurt Schütte, the former of whom suggested the name Γ0.
Verena Esther Huber-Dyson was a Swiss-American mathematician, known for her work on group theory and formal logic. She has been described as a "brilliant mathematician", who did research on the interface between algebra and logic, focusing on undecidability in group theory. At the time of her death, she was emeritus faculty in the philosophy department of the University of Calgary, Alberta.
Geoffrey Hellman is an American professor and philosopher. He is Professor of Philosophy at the University of Minnesota in Minneapolis, Minnesota. He obtained his B.A. (1965) and Ph.D. (1972) degrees in philosophy from Harvard University. He was elected to the American Academy of Arts and Sciences in 2007.
John Charles Chenoweth McKinsey, usually cited as J. C. C. McKinsey, was an American mathematician known for his work on game theory and mathematical logic, particularly, modal logic.
Carolyn Talcott is an American computer scientist known for work in formal reasoning, especially as it relates to computers, cryptanalysis and systems biology. She is currently the program director of the Symbolic Systems Biology group at SRI International.
Wanda Szmielew née Montlak was a Polish mathematical logician who first proved the decidability of the first-order theory of abelian groups.
Anita Burdman Feferman was an American historian of mathematics and biographer, known for her biographies of Jean van Heijenoort and of Alfred Tarski.
In the mathematical fields of set theory and proof theory, the Takeuti–Feferman–Buchholz ordinal (TFBO) is a large countable ordinal, which acts as the limit of the range of Buchholz's psi function and Feferman's theta function. It was named by David Madore, after Gaisi Takeuti, Solomon Feferman and Wilfried Buchholz. It is written as using Buchholz's psi function, an ordinal collapsing function invented by Wilfried Buchholz, and in Feferman's theta function, an ordinal collapsing function invented by Solomon Feferman. It is the proof-theoretic ordinal of several formal theories:
References
- ↑ "Solomon Feferman". The Royal Swedish Academy of Sciences. Retrieved 4 March 2013.