2008 |
28 | EE | Solomon Feferman:
Harmonious logic: Craig's interpolation theorem and its descendants.
Synthese 164(3): 341-357 (2008) |
2006 |
27 | EE | Solomon Feferman:
Tarski's influence on computer science
CoRR abs/cs/0608062: (2006) |
26 | EE | Solomon Feferman:
Tarski's influence on computer science.
Logical Methods in Computer Science 2(3): (2006) |
2005 |
25 | EE | Solomon Feferman:
Tarski's Influence on Computer Science.
LICS 2005: 342 |
24 | EE | Solomon Feferman:
The Gödel editorial project: A synopsis.
Bulletin of Symbolic Logic 11(2): 132-149 (2005) |
2004 |
23 | EE | Solomon Feferman:
Tarski's conception of logic.
Ann. Pure Appl. Logic 126(1-3): 5-13 (2004) |
2000 |
22 | | Solomon Feferman,
Thomas Strahm:
The unfolding of non-finitist arithmetic.
Ann. Pure Appl. Logic 104(1-3): 75-96 (2000) |
21 | EE | Solomon Feferman,
Harvey M. Friedman,
Penelope Maddy,
John R. Steel:
Does mathematics need new axioms?
Bulletin of Symbolic Logic 6(4): 401-446 (2000) |
1999 |
20 | | Solomon Feferman:
Logic, Logics, and Logicism.
Notre Dame Journal of Formal Logic 40(1): 31-54 (1999) |
1996 |
19 | | Solomon Feferman,
Gerhard Jäger:
Systems of Explicit Mathematics with Non-Constructive µ-Operator, Part II.
Ann. Pure Appl. Logic 79(1): 37-52 (1996) |
18 | | Solomon Feferman:
Computation on Abstract Data Types: The Extensional Approach, with an Application to Streams.
Ann. Pure Appl. Logic 81(1-3): 75-113 (1996) |
1995 |
17 | | 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. Logic 75(1-2): 1 (1995) |
1993 |
16 | | Solomon Feferman:
Gödel's Dialectica Interpretation and Its Two-Way Stretch.
Kurt Gödel Colloquium 1993: 23-40 |
15 | | Solomon Feferman,
Gerhard Jäger:
Systems of Explicit Mathematics with Non-Constructive µ-Operator, Part I.
Ann. Pure Appl. Logic 65(3): 243-263 (1993) |
1992 |
14 | | Solomon Feferman:
A New Approach to Abstract Data Types, I: Informal Development.
Mathematical Structures in Computer Science 2(2): 193-229 (1992) |
1991 |
13 | | Solomon Feferman:
A New Approach to Abstract Data Types II: Computation on ADTs as Ordinary Computation.
CSL 1991: 79-95 |
12 | | Solomon Feferman:
Reflecting on Incompleteness.
J. Symb. Log. 56(1): 1-49 (1991) |
1988 |
11 | | Solomon Feferman:
Hilbert's Program Relativized: Proof-Theoretical and Foundational Reductions.
J. Symb. Log. 53(2): 364-384 (1988) |
1986 |
10 | | 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 |
9 | | A. Burdman Feferman,
Solomon Feferman:
Jean van Heijenoort (1912-1986).
Logic Colloquium 1985: 1-8 |
1984 |
8 | | Solomon Feferman:
Toward Useful Type-Free Theories. I.
J. Symb. Log. 49(1): 75-111 (1984) |
1983 |
7 | | 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) |
1977 |
6 | | Solomon Feferman,
Jon Barwise,
Leo Harrington:
Meeting of the Association for Symbolic Logic: Reno, 1976.
J. Symb. Log. 42(1): 156-160 (1977) |
1968 |
5 | | Solomon Feferman:
Systems of Predicative Analysis, II: Representations of Ordinals.
J. Symb. Log. 33(2): 193-220 (1968) |
1964 |
4 | | Solomon Feferman:
Systems of Predicative Analysis.
J. Symb. Log. 29(1): 1-30 (1964) |
1962 |
3 | | Solomon Feferman:
Transfinite Recursive Progressions of Axiomatic Theories.
J. Symb. Log. 27(3): 259-316 (1962) |
2 | | Solomon Feferman,
C. Spector:
Incompleteness Along Paths in Progressions of Theories.
J. Symb. Log. 27(4): 383-390 (1962) |
1957 |
1 | | Solomon Feferman:
Degrees of Unsolvability Associated with Classes of Formalized Theories.
J. Symb. Log. 22(2): 161-175 (1957) |