96 research outputs found
Admissible closures of polynomial time computable arithmetic
We propose two admissible closures and of Ferreira's system PTCA of polynomial time computable arithmetic and of full bounded arithmetic (or polynomial hierarchy computable arithmetic) PHCA. The main results obtained are: (i) is conservative over PTCA with respect to sentences, and (ii) is conservative over full bounded arithmetic PHCA for sentences. This yields that (i) the definable functions of are the polytime functions, and (ii) the definable functions of are the functions in the polynomial time hierarch
Changing a semantics: opportunism or courage?
The generalized models for higher-order logics introduced by Leon Henkin, and
their multiple offspring over the years, have become a standard tool in many
areas of logic. Even so, discussion has persisted about their technical status,
and perhaps even their conceptual legitimacy. This paper gives a systematic
view of generalized model techniques, discusses what they mean in mathematical
and philosophical terms, and presents a few technical themes and results about
their role in algebraic representation, calibrating provability, lowering
complexity, understanding fixed-point logics, and achieving set-theoretic
absoluteness. We also show how thinking about Henkin's approach to semantics of
logical systems in this generality can yield new results, dispelling the
impression of adhocness. This paper is dedicated to Leon Henkin, a deep
logician who has changed the way we all work, while also being an always open,
modest, and encouraging colleague and friend.Comment: 27 pages. To appear in: The life and work of Leon Henkin: Essays on
his contributions (Studies in Universal Logic) eds: Manzano, M., Sain, I. and
Alonso, E., 201
Classes, why and how
This paper presents a new approach to the class-theoretic paradoxes. In the first part of the paper, I will distinguish classes from sets, describe the function of class talk, and present several reasons for postulating type- free classes. This involves applications to the problem of unrestricted quantification, reduction of properties, natural language semantics, and the epistemology of mathematics. In the second part of the paper, I will present some axioms for type-free classes. My approach is loosely based on the Gödel-Russell idea of limited ranges of significance. It is shown how to derive the second-order Dedekind-Peano axioms within that theory. I conclude by discussing whether the theory can be used as a solution to the problem of unrestricted quantification. In an appendix, I prove the consistency of the class theory relative to Zermelo-Fraenkel set theory
The Structure of Models of Second-order Set Theories
This dissertation is a contribution to the project of second-order set
theory, which has seen a revival in recent years. The approach is to understand
second-order set theory by studying the structure of models of second-order set
theories. The main results are the following, organized by chapter. First, I
investigate the poset of -realizations of a fixed countable model of
, where is a reasonable second-order set theory such as
or , showing that it has a rich structure. In
particular, every countable partial order embeds into this structure. Moreover,
we can arrange so that these embedding preserve the existence/nonexistence of
upper bounds, at least for finite partial orders. Second I generalize some
constructions of Marek and Mostowski from to weaker theories.
They showed that every model of plus the Class Collection schema
"unrolls" to a model of with a largest cardinal. I calculate
the theories of the unrolling for a variety of second-order set theories, going
as weak as . I also show that being -realizable
goes down to submodels for a broad selection of second-order set theories .
Third, I show that there is a hierarchy of transfinite recursion principles
ranging in strength from to . This hierarchy is
ordered first by the complexity of the properties allowed in the recursions and
second by the allowed heights of the recursions. Fourth, I investigate the
question of which second-order set theories have least models. I show that
strong theories---such as or ---do
not have least transitive models while weaker theories---from to
---do have least transitive models.Comment: This is my PhD dissertatio
Logic in the Tractatus
I present a reconstruction of the logical system of the Tractatus, which differs from classical logic in two ways. It includes an account of Wittgenstein’s “form-series” device, which suffices to express some effectively generated countably infinite disjunctions. And its attendant notion of structure is relativized to the fixed underlying universe of what is named.
There follow three results. First, the class of concepts definable in the system is closed under finitary induction. Second, if the universe of objects is countably infinite, then the property of being a tautology is \Pi^1_1-complete. But third, it is only granted the assumption of countability that the class of tautologies is \Sigma_1-definable in set theory.
Wittgenstein famously urges that logical relationships must show themselves in the structure of signs. He also urges that the size of the universe cannot be prejudged. The results of this paper indicate that there is no single way in which logical relationships could be held to make themselves manifest in signs, which does not prejudge the number of objects
Investigations of subsystems of second order arithmetic and set theory in strength between Pi-1-1-CA and delta-1-2-CA+BI: part I
This paper is the rst of a series of two. It contains proof{theoretic investigations on subtheories of second order arithmetic and set theory. Among the principles on which these theories are based one nds autonomously iterated positive and monotone inductive de ni- tions, 1 1 trans nite recursion, 1 2 trans nite recursion, trans nitely iterated 1 1 dependent choices, extended Bar rules for provably de nable well-orderings as well as their set-theoretic counterparts which are based on extensions of Kripke-Platek set theory. This rst part intro- duces all the principles and theories. It provides lower bounds for their strength measured in terms of the amount of trans nite induction they achieve to prove. In other words, it determines lower bounds for their proof-theoretic ordinals which are expressed by means of ordinal representation systems. The second part of the paper will be concerned with ordinal analysis. It will show that the lower bounds established in the present paper are indeed sharp, thereby providing the proof-theoretic ordinals. All the results were obtained more then 20 years ago (in German) in the author's PhD thesis [43] but have never been published before, though the thesis received a review (MR 91m#03062). I think it is high time it got published
- …