D-Index & Metrics Best Publications

D-Index & Metrics D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines.

Discipline name D-index D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines. Citations Publications World Ranking National Ranking
Mathematics D-index 34 Citations 11,030 152 World Ranking 1964 National Ranking 833

Research.com Recognitions

Awards & Achievements

2013 - Fellow of the American Mathematical Society

1986 - Fellow of John Simon Guggenheim Memorial Foundation

1972 - Fellow of John Simon Guggenheim Memorial Foundation

Overview

What is he best known for?

The fields of study Solomon Feferman is best known for:

  • Set theory
  • Mathematical logic
  • Natural number

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 most cited work include:

  • Theory of Recursive Functions and Effective Computability. (912 citations)
  • Toward useful type-free theories. I (307 citations)
  • Systems of predicative analysis (297 citations)

What are the main themes of his work throughout his whole career to date

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.

Solomon Feferman most often published in these fields:

  • Calculus (dental) (49.46%)
  • Pure mathematics (49.46%)
  • Dentistry (47.31%)

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.

Best Publications

Theory of Recursive Functions and Effective Computability.

Solomon Feferman;Hartley Rogers.
American Mathematical Monthly (1969)

4692 Citations

The first order properties of products of algebraic systems

S. Feferman;R. L. Vaught.
Fundamenta Mathematicae (1959)

621 Citations

Model-Theoretic Logics

Jon Barwise;Solomon Feferman.
(1985)

465 Citations

A Language and Axioms for Explicit Mathematics

Solomon Feferman.
(1975)

359 Citations

Toward Useful Type-Free Theories. I

Solomon Feferman.
Journal of Symbolic Logic (1984)

351 Citations

Constructive Theories of Functions and Classes

Solomon Feferman.
Studies in logic and the foundations of mathematics (1979)

337 Citations

Transfinite recursive progressions of axiomatic theories

Solomon Feferman.
Journal of Symbolic Logic (1962)

312 Citations

Iterated Inductive Definitions and Subsystems of Analysis: Recent Proof-theoretical Studies

Wilfried Buchholz;Solomon Feferman;Wolfram Pohlers;Wilfried Sieg.
(1981)

274 Citations

Reflecting on incompleteness

Solomon Feferman.
Journal of Symbolic Logic (1991)

247 Citations

Some applications of the notions of forcing and generic sets

S. Feferman.
Fundamenta Mathematicae (1964)

238 Citations

If you think any of the details on this page are incorrect, let us know.

Contact us

Best Scientists Citing Solomon Feferman

Jeffrey B. Remmel

Jeffrey B. Remmel

University of California, San Diego

Publications: 31

Saharon Shelah

Saharon Shelah

Hebrew University of Jerusalem

Publications: 30

Viktor Kuncak

Viktor Kuncak

École Polytechnique Fédérale de Lausanne

Publications: 26

Rodney G. Downey

Rodney G. Downey

Victoria University of Wellington

Publications: 25

Carl Smith

Carl Smith

University of Queensland

Publications: 22

Cristian S. Calude

Cristian S. Calude

University of Auckland

Publications: 19

Wolfgang Thomas

Wolfgang Thomas

RWTH Aachen University

Publications: 19

David Harel

David Harel

Weizmann Institute of Science

Publications: 18

Daniel N. Osherson

Daniel N. Osherson

Princeton University

Publications: 18

Petr Hájek

Petr Hájek

Czech Academy of Sciences

Publications: 17

Carolyn L. Talcott

Carolyn L. Talcott

SRI International

Publications: 13

Andris Ambainis

Andris Ambainis

University of Latvia

Publications: 13

Moshe Y. Vardi

Moshe Y. Vardi

Rice University

Publications: 12

José Meseguer

José Meseguer

University of Illinois at Urbana-Champaign

Publications: 12

Martin Grohe

Martin Grohe

RWTH Aachen University

Publications: 11

Nachum Dershowitz

Nachum Dershowitz

Tel Aviv University

Publications: 11

Something went wrong. Please try again later.