default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSolomon Feferman
Person information
- affiliation: Stanford University, CA, USA
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[p2]Solomon Feferman:
Turing's 'Oracle': From Absolute to Relative Computability and Back. The Once and Future Turing 2016: 300-334- 2015
- [j34]Solomon Feferman, Vladimir Lifschitz:
In Memoriam: Grigori E. Mints 1939-2014. Bull. Symb. Log. 21(1): 31-33 (2015) - 2013
- [j33]Solomon Feferman:
Foundations of Unlimited Category Theory: What Remains to be Done. Rev. Symb. Log. 6(1): 6-15 (2013) - 2012
- [j32]Solomon Feferman:
On Rereading van Heijenoort's Selected Essays. Logica Universalis 6(3-4): 535-552 (2012) - [j31]Solomon Feferman:
And so on . . . : reasoning with infinite diagrams. Synth. 186(1): 371-386 (2012) - 2011
- [c6]Solomon Feferman:
Two PhD Students for the Price of One. Formal Modeling: Actors, Open Systems, Biological Systems 2011: 1-3 - 2010
- [j30]Solomon Feferman:
Set-theoretical Invariance Criteria for Logicality. Notre Dame J. Formal Log. 51(1): 3-20 (2010) - [j29]Solomon Feferman, Thomas Strahm:
Unfolding Finitist Arithmetic. Rev. Symb. Log. 3(4): 665-689 (2010)
2000 – 2009
- 2009
- [j28]Solomon Feferman:
Operational set theory and small large cardinals. Inf. Comput. 207(10): 971-979 (2009) - 2008
- [j27]Solomon Feferman:
Axioms for Determinateness and Truth. Rev. Symb. Log. 1(2): 204-217 (2008) - [j26]Solomon Feferman:
Harmonious logic: Craig's interpolation theorem and its descendants. Synth. 164(3): 341-357 (2008) - 2007
- [p1]Solomon Feferman:
Predicativity. The Oxford Handbook of Philosophy of Mathematics and Logic 2007: 590-624 - 2006
- [j25]Solomon Feferman:
Tarski's influence on computer science. Log. Methods Comput. Sci. 2(3) (2006) - [i1]Solomon Feferman:
Tarski's influence on computer science. CoRR abs/cs/0608062 (2006) - 2005
- [j24]Solomon Feferman:
The Gödel editorial project: A synopsis. Bull. Symb. Log. 11(2): 132-149 (2005) - [c5]Solomon Feferman:
Tarski's Influence on Computer Science. LICS 2005: 342 - 2004
- [j23]Solomon Feferman:
Tarski's conception of logic. Ann. Pure Appl. Log. 126(1-3): 5-13 (2004) - 2000
- [j22]Solomon Feferman, Thomas Strahm:
The unfolding of non-finitist arithmetic. Ann. Pure Appl. Log. 104(1-3): 75-96 (2000) - [j21]Solomon Feferman, Harvey M. Friedman, Penelope Maddy, John R. Steel:
Does mathematics need new axioms? Bull. Symb. Log. 6(4): 401-446 (2000) - [j20]Solomon Feferman:
Mathematical Intuition Vs. Mathematical Monsters. Synth. 125(3): 317-332 (2000)
1990 – 1999
- 1999
- [j19]Solomon Feferman:
Logic, Logics, and Logicism. Notre Dame J. Formal Log. 40(1): 31-54 (1999) - 1996
- [j18]Solomon Feferman, Gerhard Jäger:
Systems of Explicit Mathematics with Non-Constructive µ-Operator, Part II. Ann. Pure Appl. Log. 79(1): 37-52 (1996) - [j17]Solomon Feferman:
Computation on Abstract Data Types: The Extensional Approach, with an Application to Streams. Ann. Pure Appl. Log. 81(1-3): 75-113 (1996) - 1995
- [j16]Sergei N. Artëmov, George Boolos, Erwin Engeler, Solomon Feferman, Gerhard Jäger, Albert Visser:
Preface: Special Issue of Papers from the Conference on Proof Theory, Provability Logic, and Computation, Berne, Switzerland, 20-24 March 1994. Ann. Pure Appl. Log. 75(1-2): 1 (1995) - [j15]Solomon Feferman, Geoffrey Hellman:
Predicative foundations of arithmetic. J. Philos. Log. 24(1): 1-17 (1995) - 1993
- [j14]Solomon Feferman, Gerhard Jäger:
Systems of Explicit Mathematics with Non-Constructive µ-Operator, Part I. Ann. Pure Appl. Logic 65(3): 243-263 (1993) - [c4]Solomon Feferman:
Gödel's Dialectica Interpretation and Its Two-Way Stretch. Kurt Gödel Colloquium 1993: 23-40 - 1992
- [j13]Solomon Feferman:
A New Approach to Abstract Data Types, I: Informal Development. Math. Struct. Comput. Sci. 2(2): 193-229 (1992) - 1991
- [j12]Solomon Feferman:
Reflecting on Incompleteness. J. Symb. Log. 56(1): 1-49 (1991) - [c3]Solomon Feferman:
Proofs of Termination and the "91" Function. Artificial and Mathematical Theory of Computation 1991: 47-63 - [c2]Solomon Feferman:
A New Approach to Abstract Data Types II: Computation on ADTs as Ordinary Computation. CSL 1991: 79-95
1980 – 1989
- 1988
- [j11]Solomon Feferman:
Hilbert's Program Relativized: Proof-Theoretical and Foundational Reductions. J. Symb. Log. 53(2): 364-384 (1988) - 1986
- [j10]Jon Barwise, Solomon Feferman, David Israel:
Meeting of the Association for Symbolic Logic: Stanford, California, 1985. J. Symb. Log. 51(3): 832-862 (1986) - 1985
- [j9]Solomon Feferman:
Intensionality in mathematics. J. Philos. Log. 14(1): 41-55 (1985) - [c1]A. Burdman Feferman, Solomon Feferman:
Jean van Heijenoort (1912-1986). Logic Colloquium 1985: 1-8 - 1984
- [j8]Solomon Feferman:
Toward Useful Type-Free Theories. I. J. Symb. Log. 49(1): 75-111 (1984) - 1983
- [j7]Solomon Feferman, Gerhard Jäger:
Choice Principles, the Bar Rule and Autonomously Iterated Comprehension Schemes in Analysis. J. Symb. Log. 48(1): 63-70 (1983)
1970 – 1979
- 1977
- [j6]Solomon Feferman, Jon Barwise, Leo Harrington:
Meeting of the Association for Symbolic Logic: Reno, 1976. J. Symb. Log. 42(1): 156-160 (1977)
1960 – 1969
- 1968
- [j5]Solomon Feferman:
Systems of Predicative Analysis, II: Representations of Ordinals. J. Symb. Log. 33(2): 193-220 (1968) - 1964
- [j4]Solomon Feferman:
Systems of Predicative Analysis. J. Symb. Log. 29(1): 1-30 (1964) - 1962
- [j3]Solomon Feferman:
Transfinite Recursive Progressions of Axiomatic Theories. J. Symb. Log. 27(3): 259-316 (1962) - [j2]Solomon Feferman, C. Spector:
Incompleteness Along Paths in Progressions of Theories. J. Symb. Log. 27(4): 383-390 (1962)
1950 – 1959
- 1957
- [j1]Solomon Feferman:
Degrees of Unsolvability Associated with Classes of Formalized Theories. J. Symb. Log. 22(2): 161-175 (1957)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
