![]() |
|
|
|
Solomon Feferman
has shaped the field of foundational research for nearly half
a century. These papers, most of which were presented at the symposium
honoring him at his 70th birthday, reflect his broad interests
as well as his approach to foundational research, which places
the solution of mathematical and philosophical problems at the
top of his agenda. The contributions range from historical to
technical to philosophical topics, with emphasis on proof theory
and computational aspects. Year: 2002 ISBN: 1-56881-170-5
Table of Contents Part I:
Proof Theoretic Analysis Relating ordinals
to proofs in a perspicuous way. Internal finite
tree embeddings. Foundational
and mathematical uses of higher types. The epsilon
substitution method and continuity. Predicativity:
The outer limits. Part II: Logic and Computation A pragmatic
interpretation of substructural logics. Computational
complexity and induction for partial computable functions in type
theory. Computability
theory: structure or algorithms Three processes
in natural language interpretation. Infinitary
initial algebra specifications for stream algebras. Part III: Applicative and Self-Applicative Theories On extensionality,
uniformity and comprehension in the theories of operations and
classes. The proof-theoretic
analysis of the Suslin operator in applicative theories. Feferman-Landin
Logic. Explicit mathematics
with monotone inductive definitions: A survey. Part IV: Philosophy of Modern Mathematical and Logical Thought On the constructivity
of proofs. A debate among Behmann, Bernays, Gödel, and Kaufmann. Realism and
the debate on impredicativity, 1917-1944*. Calculations
by man and machine: conceptual analysis*. Remarks on
finitism. Logical constants:
the variable fortunes of an elusive notion.
|
[ Meetings | Announcements | Membership | Journals | ASL Books | Links to Other Sites | ASL Info | Home]