Solomon Feferman - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 42 from 42

2016

Turing's 'Oracle': From Absolute to Relative Computability and BackSolomon Feferman. In S. Barry Cooper, Andrew Hodges, editors, The Once and Future Turing: Computing the World. pages 300-334, Cambridge University Press, 2016. [doi]

2015

In Memoriam: Grigori E. Mints 1939-2014Solomon Feferman, Vladimir Lifschitz. bsl, 21(1):31-33, 2015. [doi]

2013

Foundations of Unlimited Category Theory: What Remains to be DoneSolomon Feferman. rsl, 6(1):6-15, 2013. [doi]

2012

On Rereading van Heijenoort's Selected EssaysSolomon Feferman. lu, 6(3-4):535-552, 2012. [doi]

And so on . . . : reasoning with infinite diagramsSolomon Feferman. synthese, 186(1):371-386, 2012. [doi]

2011

Two PhD Students for the Price of OneSolomon Feferman. BIRTHDAY 2011: 1-3 [doi]

2010

Set-theoretical Invariance Criteria for LogicalitySolomon Feferman. ndjfl, 51(1):3-20, 2010. [doi]

Unfolding Finitist ArithmeticSolomon Feferman, Thomas Strahm. rsl, 3(4):665-689, 2010. [doi]

2009

Operational set theory and small large cardinalsSolomon Feferman. iandc, 207(10):971-979, 2009. [doi]

2008

Harmonious logic: Craig s interpolation theorem and its descendantsSolomon Feferman. synthese, 164(3):341-357, 2008. [doi]

Axioms for Determinateness and TruthSolomon Feferman. rsl, 1(2):204-217, 2008. [doi]

2007

PredicativitySolomon Feferman. In Stewart Shapiro, editor, The Oxford Handbook of Philosophy of Mathematics and Logic. Oxford handbooks in philosophy, pages 590-624, Oxford University Press, 2007.

2006

Tarski s influence on computer scienceSolomon Feferman. lmcs, 2(3), 2006. [doi]

2005

Tarski s Influence on Computer ScienceSolomon Feferman. lics 2005: 342 [doi]

The Gödel editorial project: A synopsisSolomon Feferman. bsl, 11(2):132-149, 2005. [doi]

2004

Tarski s conception of logicSolomon Feferman. APAL, 126(1-3):5-13, 2004. [doi]

2000

The unfolding of non-finitist arithmeticSolomon Feferman, Thomas Strahm. APAL, 104(1-3):75-96, 2000.

Mathematical Intuition Vs. Mathematical MonstersSolomon Feferman. synthese, 125(3):317-332, 2000. [doi]

Does mathematics need new axioms?Solomon Feferman, Harvey M. Friedman, Penelope Maddy, John R. Steel. bsl, 6(4):401-446, 2000. [doi]

1999

Logic, Logics, and LogicismSolomon Feferman. ndjfl, 40(1):31-54, 1999.

1996

Systems of Explicit Mathematics with Non-Constructive µ-Operator, Part IISolomon Feferman, Gerhard Jäger. APAL, 79(1):37-52, 1996.

Computation on Abstract Data Types: The Extensional Approach, with an Application to StreamsSolomon Feferman. APAL, 81(1-3):75-113, 1996.

1995

Preface: Special Issue of Papers from the Conference on Proof Theory, Provability Logic, and Computation, Berne, Switzerland, 20-24 March 1994Sergei N. Artëmov, George Boolos, Erwin Engeler, Solomon Feferman, Gerhard Jäger, Albert Visser. APAL, 75(1-2):1, 1995.

Predicative foundations of arithmeticSolomon Feferman, Geoffrey Hellman. jphil, 24(1):1-17, 1995. [doi]

1993

Gödel s Dialectica Interpretation and Its Two-Way StretchSolomon Feferman. kgc 1993: 23-40

Systems of Explicit Mathematics with Non-Constructive µ-Operator, Part ISolomon Feferman, Gerhard Jäger. APAL, 65(3):243-263, 1993.

1992

A New Approach to Abstract Data Types, I: Informal DevelopmentSolomon Feferman. mscs, 2(2):193-229, 1992.

1991

Reflecting on IncompletenessSolomon Feferman. JSYML, 56(1):1-49, 1991.

A New Approach to Abstract Data Types II: Computation on ADTs as Ordinary ComputationSolomon Feferman. csl 1992: 79-95

Proofs of Termination and the "91" FunctionSolomon Feferman. BIRTHDAY 1991: 47-63 [doi]

1988

Hilbert s Program Relativized: Proof-Theoretical and Foundational ReductionsSolomon Feferman. JSYML, 53(2):364-384, 1988.

1986

Meeting of the Association for Symbolic Logic: Stanford, California, 1985Jon Barwise, Solomon Feferman, David Israel. JSYML, 51(3):832-862, 1986.

1985

Jean van Heijenoort (1912-1986)A. Burdman Feferman, Solomon Feferman. logicColl 1987: 1-8

Intensionality in mathematicsSolomon Feferman. jphil, 14(1):41-55, 1985. [doi]

1984

Toward Useful Type-Free Theories. ISolomon Feferman. JSYML, 49(1):75-111, 1984.

1983

Choice Principles, the Bar Rule and Autonomously Iterated Comprehension Schemes in AnalysisSolomon Feferman, Gerhard Jäger. JSYML, 48(1):63-70, 1983.

1977

Meeting of the Association for Symbolic Logic: Reno, 1976Solomon Feferman, Jon Barwise, Leo Harrington. JSYML, 42(1):156-160, 1977.

1968

Systems of Predicative Analysis, II: Representations of OrdinalsSolomon Feferman. JSYML, 33(2):193-220, 1968.

1964

Systems of Predicative AnalysisSolomon Feferman. JSYML, 29(1):1-30, 1964.

1962

Incompleteness Along Paths in Progressions of TheoriesSolomon Feferman, C. Spector. JSYML, 27(4):383-390, 1962.

Transfinite Recursive Progressions of Axiomatic TheoriesSolomon Feferman. JSYML, 27(3):259-316, 1962.

1957

Degrees of Unsolvability Associated with Classes of Formalized TheoriesSolomon Feferman. JSYML, 22(2):161-175, 1957.

Sign in or sign up to see more results.

runs on WebDSL