Solomon Feferman

Affiliations:
  • Stanford University, CA, USA


According to our database1, Solomon Feferman authored at least 41 papers between 1957 and 2016.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2016
Turing's 'Oracle': From Absolute to Relative Computability and Back.
Proceedings of the Once and Future Turing: Computing the World, 2016

2015
In Memoriam: Grigori E. Mints 1939-2014.
Bull. Symb. Log., 2015

2013
Foundations of Unlimited Category Theory: What Remains to be Done.
Rev. Symb. Log., 2013

2012
And so on . . . : reasoning with infinite diagrams.
Synth., 2012

On Rereading van Heijenoort's Selected Essays.
Logica Universalis, 2012

2011
Two PhD Students for the Price of One.
Proceedings of the Formal Modeling: Actors, Open Systems, Biological Systems, 2011

2010
Unfolding Finitist Arithmetic.
Rev. Symb. Log., 2010

Set-theoretical Invariance Criteria for Logicality.
Notre Dame J. Formal Log., 2010

2009
Operational set theory and small large cardinals.
Inf. Comput., 2009

2008
Harmonious logic: Craig's interpolation theorem and its descendants.
Synth., 2008

Axioms for Determinateness and Truth.
Rev. Symb. Log., 2008

2007
Predicativity.
Proceedings of the Oxford Handbook of Philosophy of Mathematics and Logic., 2007

2006
Tarski's influence on computer science.
Log. Methods Comput. Sci., 2006

2005
The Gödel editorial project: A synopsis.
Bull. Symb. Log., 2005

2004
Tarski's conception of logic.
Ann. Pure Appl. Log., 2004

2000
Mathematical Intuition Vs. Mathematical Monsters.
Synth., 2000

Does mathematics need new axioms?
Bull. Symb. Log., 2000

The unfolding of non-finitist arithmetic.
Ann. Pure Appl. Log., 2000

1999
Logic, Logics, and Logicism.
Notre Dame J. Formal Log., 1999

1996
Systems of Explicit Mathematics with Non-Constructive µ-Operator, Part II.
Ann. Pure Appl. Log., 1996

Computation on Abstract Data Types: The Extensional Approach, with an Application to Streams.
Ann. Pure Appl. Log., 1996

1995
Predicative foundations of arithmetic.
J. Philos. Log., 1995

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., 1995

1993
Systems of Explicit Mathematics with Non-Constructive µ-Operator, Part I.
Ann. Pure Appl. Logic, 1993

Gödel's Dialectica Interpretation and Its Two-Way Stretch.
Proceedings of the Computational Logic and Proof Theory, Third Kurt Gödel Colloquium, 1993

1992
A New Approach to Abstract Data Types, I: Informal Development.
Math. Struct. Comput. Sci., 1992

1991
Reflecting on Incompleteness.
J. Symb. Log., 1991

A New Approach to Abstract Data Types II: Computation on ADTs as Ordinary Computation.
Proceedings of the Computer Science Logic, 5th Workshop, 1991

Proofs of Termination and the "91" Function.
Proceedings of the Artificial and Mathematical Theory of Computation, 1991

1988
Hilbert's Program Relativized: Proof-Theoretical and Foundational Reductions.
J. Symb. Log., 1988

1986
Meeting of the Association for Symbolic Logic: Stanford, California, 1985.
J. Symb. Log., 1986

1985
Intensionality in mathematics.
J. Philos. Log., 1985

Jean van Heijenoort (1912-1986).
Proceedings of the Logic Colloquium '85, Orsay, France, 1985

1984
Toward Useful Type-Free Theories. I.
J. Symb. Log., 1984

1983
Choice Principles, the Bar Rule and Autonomously Iterated Comprehension Schemes in Analysis.
J. Symb. Log., 1983

1977
Meeting of the Association for Symbolic Logic: Reno, 1976.
J. Symb. Log., 1977

1968
Systems of Predicative Analysis, II: Representations of Ordinals.
J. Symb. Log., 1968

1964
Systems of Predicative Analysis.
J. Symb. Log., 1964

1962
Incompleteness Along Paths in Progressions of Theories.
J. Symb. Log., 1962

Transfinite Recursive Progressions of Axiomatic Theories.
J. Symb. Log., 1962

1957
Degrees of Unsolvability Associated with Classes of Formalized Theories.
J. Symb. Log., 1957


  Loading...