2013 - Fellow of the American Mathematical Society
1986 - Fellow of John Simon Guggenheim Memorial Foundation
1972 - Fellow of John Simon Guggenheim Memorial Foundation
His research in Mathematics education intersects with topics in Algebra over a field, Pure mathematics and Dentistry, Calculus (dental). As part of his studies on Pure mathematics, Solomon Feferman frequently links adjacent subjects like Algebra over a field. His study ties his expertise on Calculus (dental) together with the subject of Dentistry. Discrete mathematics is closely attributed to First-order logic in his work. His Programming language study frequently draws parallels with other fields, such as Universal set. Universal set connects with themes related to Set (abstract data type) in his study. His Programming language research extends to Set (abstract data type), which is thematically connected. He undertakes interdisciplinary study in the fields of Geometry and Mathematical proof through his research. Solomon Feferman combines Mathematical proof and Geometry in his research.
His Programming language research includes a combination of various areas of study, such as Theoretical computer science and Algorithm. In his research, he undertakes multidisciplinary study on Algorithm and Programming language. Calculus (dental) is frequently linked to Dentistry in his study. Many of his studies on Dentistry involve topics that are commonly interrelated, such as Calculus (dental). In most of his Pure mathematics studies, his work intersects topics such as Algebra over a field. His Pure mathematics research extends to the thematically linked field of Algebra over a field. He undertakes interdisciplinary study in the fields of Discrete mathematics and Geometry through his research. In his study, he carries out multidisciplinary Geometry and Discrete mathematics research. The study of Set (abstract data type) is intertwined with the study of Set theory in a number of ways.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Theory of Recursive Functions and Effective Computability.
Solomon Feferman;Hartley Rogers.
American Mathematical Monthly (1969)
The first order properties of products of algebraic systems
S. Feferman;R. L. Vaught.
Fundamenta Mathematicae (1959)
Jon Barwise;Solomon Feferman.
A Language and Axioms for Explicit Mathematics
Toward Useful Type-Free Theories. I
Journal of Symbolic Logic (1984)
Constructive Theories of Functions and Classes
Studies in logic and the foundations of mathematics (1979)
Transfinite recursive progressions of axiomatic theories
Journal of Symbolic Logic (1962)
Iterated Inductive Definitions and Subsystems of Analysis: Recent Proof-theoretical Studies
Wilfried Buchholz;Solomon Feferman;Wolfram Pohlers;Wilfried Sieg.
Reflecting on incompleteness
Journal of Symbolic Logic (1991)
Some applications of the notions of forcing and generic sets
Fundamenta Mathematicae (1964)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: