The following pages link to Solomon Feferman (Q190333):
Displaying 29 items.
- Tarski's influence on computer science (Q5310665) (← links)
- Some applications of the notions of forcing and generic sets (Q5338333) (← links)
- Systems of predicative analysis (Q5344166) (← links)
- (Q5450053) (← links)
- (Q5478000) (← links)
- Predicative provability in set theory (Q5527011) (← links)
- (Q5544276) (← links)
- Systems of predicative analysis, II: Representations of ordinals (Q5544287) (← links)
- (Q5557888) (← links)
- (Q5595153) (← links)
- (Q5596760) (← links)
- (Q5599137) (← links)
- (Q5614681) (← links)
- (Q5621360) (← links)
- (Q5622162) (← links)
- (Q5622163) (← links)
- (Q5625132) (← links)
- (Q5625145) (← links)
- Persistent and invariant formulas relative to theories of higher order (Q5642556) (← links)
- (Q5655348) (← links)
- (Q5661851) (← links)
- Transfinite recursive progressions of axiomatic theories (Q5727661) (← links)
- Incompleteness along paths in progressions of theories (Q5727662) (← links)
- (Q5727665) (← links)
- Representability op recursively enumerable sets in formal theories (Q5729294) (← links)
- 1 — Consistency and faithful interpretations (Q5734415) (← links)
- Does mathematics need new axioms? (Q5890202) (← links)
- In memoriam: Kenneth Jon Barwise, 1942--2000 (Q5890203) (← links)
- Logic, logics, and logicism (Q5937844) (← links)