American Mathematical Society | logic | Courant Institute of Mathematical Sciences | mathematical physics | Logic | Mathematical Association of America | William Lowell Putnam Mathematical Competition | Mathematical analysis | mathematical analysis | Programmable logic controller | Mathematical singularity | Louis Logic | International Mathematical Union | International Mathematical Olympiad | Dannie Heineman Prize for Mathematical Physics | Canadian Mathematical Society | Transistor–transistor logic | Solid State Logic | Notices of the American Mathematical Society | mathematical model | Logic Pro | Cirrus Logic | Postmodernism, or, the Cultural Logic of Late Capitalism | Mathematical Tables Project | Mathematical Sciences Research Institute | Mathematical physics | Mathematical Applications Group, Inc. | Ladder Logic | Ladder logic | Journal of Symbolic Logic |
The scope of BCTCS includes all aspects of theoretical computer science, including algorithms, complexity, semantics, formal methods, concurrency, types, languages and logics.
One who had to leave Germany, Paul Bernays, had collaborated with Hilbert in mathematical logic, and co-authored with him the important book Grundlagen der Mathematik (which eventually appeared in two volumes, in 1934 and 1939).
Disciplines in which one might use the word formulation in the abstract sense include Logic, Mathematics, Linguistics, Legal theory, and Computer science.
Barendregt studied mathematical logic at Utrecht University, obtaining his Masters in 1968 and his Ph.D. in 1971, both cum laude, under Dirk van Dalen and Georg Kreisel.
In mathematical logic, the Hilbert–Bernays provability conditions, named after David Hilbert and Paul Bernays, are a set of requirements for formalized provability predicates in formal theories of arithmetic (Smith 2007:224).
In 1928, Ackermann helped David Hilbert turn his 1917 – 22 lectures on introductory mathematical logic into a text, Principles of Mathematical Logic.
Reinhardt, William, "Ackermann's set theory equals ZF" Annals of Mathematical Logic Vol.
An English edition Mathematical logic (ISBN 0387942580) was published in the Springer-Verlag Undergraduate Texts in Mathematics series in 1984.
He is a professor of mathematics at the University of Helsinki and a professor of mathematical logic and foundations of mathematics at the University of Amsterdam.
The use of mathematical logic to represent and execute computer programs is also a feature of the lambda calculus, developed by Alonzo Church in the 1930s.
Gabbay's separation theorem (mathematical logic and computer science) states that any arbitrary temporal logic formula can be rewritten in a logically equivalent "past → future" form.