Sciweavers

BSL
2006
81views more  BSL 2006»
13 years 11 months ago
Classifying the Provably Total Functions of PA
We give a self-contained and streamlined version of the classification of the provably computable functions of PA. The emphasis is put on illuminating as good as seems possible th...
Andreas Weiermann
BSL
2006
63views more  BSL 2006»
13 years 11 months ago
Internal Consistency and the Inner Model Hypothesis
Sy-David Friedman
BSL
2006
114views more  BSL 2006»
13 years 11 months ago
Schemata: The Concept of Schema in the History of Logic
Schemata have played important roles in logic since Aristotle's Prior Analytics. The syllogistic figures and moods can be taken to be argument schemata as can the rules of the...
John Corcoran
BSL
2006
93views more  BSL 2006»
13 years 11 months ago
What is Tarski's common concept of consequence?
Abstract. In 1936 Tarski sketched a rigorous definition of the concept of logical consequence which, he claimed, agreed quite well with common usage--or, as he also said, with the ...
Ignacio Jané
BSL
2006
109views more  BSL 2006»
13 years 11 months ago
Computing with functionals - computability theory or computer science?
We review some of the history of the computability theory of functionals of higher types, and we will demonstrate how contributions from logic and theoretical computer science hav...
Dag Normann
BSL
2006
82views more  BSL 2006»
13 years 11 months ago
What is neologicism?
Bernard Linsky, Edward N. Zalta
BSL
2006
73views more  BSL 2006»
13 years 11 months ago
Nonstandard arithmetic and reverse mathematics
We show that each of the five basic theories of second order arithmetic that play a central role in reverse mathematics has a natural counterpart in the language of nonstandard ari...
H. Jerome Keisler