This paper is the first in a two-part series in which we discuss several notions of completeness for systems of mathematical axioms, with special focus on their interrelations and historical origins in the development of the axiomatic method. We argue that, both from historical and logical points of view, higher-order logic is an appropriate framework for considering such notions, and we consider some open questions in higher-order axiomatics. In addition, we indicate how one can fruitfully extend the usual set-theoretic semantics (...) so as to shed new light on the relevant strengths and limits of higher-order logic. (shrink)

It is shown that the second-order theory of a Dedekind algebra is categorical if it is finitely axiomatizable. This provides a partial answer to an old and neglected question of Fraenkel and Carnap: whether every finitely axiomatizable semantically complete second-order theory is categorical. It follows that the second-order theory of a Dedekind algebra is finitely axiomatizable iff the algebra is finitely characterizable. It is also shown that the second-order theory of a Dedekind algebra is quasi-finitely axiomatizable iff the algebra is (...) quasi-finitely characterizable. (shrink)

A Dedekind algebra is an ordered pair where B is a non-empty set and h is a "similarity transformation" on B. Among the Dedekind algebras is the sequence of positive integers. Each Dedekind algebra can be decomposed into a family of disjointed, countable subalgebras which are called the configurations of the algebra. There are many isomorphic types of configurations. Each Dedekind algebra is associated with a cardinal value function called the confirmation signature which counts the number of configurations in each (...) isomorphism type occurring in the decomposition of the algebra. Two Dedekind algebras are isomorphic if their configuration signatures are identical. I introduce conditions on configuration signatures that are sufficient for characterizing Dedekind algebras uniquely up to isomorphisms in second order logic. I show Dedekind's characterization of the sequence of positive integers to be a consequence of these more general results, and use configuration signatures to delineate homogeneous, universal and homogeneous-universal Dedekind algebras. These delineations establish various results about these classes of Dedekind algebras including existence and uniqueness. (shrink)

A Dedekind algebra is an order pair (B, h) where B is a non-empty set and h is a similarity transformation on B. Each Dedekind algebra can be decomposed into a family of disjoint, countable subalgebras called the configurations of the algebra. There are 0 isomorphism types of configurations. Each Dedekind algebra is associated with a cardinal-valued function on called its configuration signature. The configuration signature counts the number of configurations in each isomorphism type which occur in the decomposition of (...) the algebra. Two Dedekind algebras are isomorphic iff their configuration signatures are identical. It is shown that configuration signatures can be used to characterize the homogeneous, universal and homogeneous-universal Dedekind algebras. This characterization is used to prove various results about these subclasses of Dedekind algebras. (shrink)

In the 1920's Fraenkel and Carnap raised the question of whether or not every finitely axiomatizable semantically complete theory formulated in the theory of types is categorical. Partial answers to this and a related question are presented for theories formulated in second-order logic.

A back and forth condition on interpretations for those second-order languages without functional variables whose non-logical vocabulary is finite and excludes functional constants is presented. It is shown that this condition is necessary and sufficient for the interpretations to be equivalent in the language. When applied to second-order languages with an infinite non-logical vocabulary, excluding functional constants, the back and forth condition is sufficient but not necessary. It is shown that there is a class of infinitary second-order languages whose non-logical (...) vocabulary is infinite for which the back and forth condition is both necessary and sufficient. It is also shown that some applications of the back and forth construction for second-order languages can be extended to the infinitary second-order languages. (shrink)

The central contention of this book is that second-order logic has a central role to play in laying the foundations of mathematics. In order to develop the argument fully, the author presents a detailed description of higher-order logic, including a comprehensive discussion of its semantics. He goes on to demonstrate the prevalence of second-order concepts in mathematics and the extent to which mathematical ideas can be formulated in higher-order logic. He also shows how first-order languages are often insufficient to codify (...) many concepts in contemporary mathematics, and thus that both first- and higher-order logics are needed to fully reflect current work. Throughout, the emphasis is on discussing the associated philosophical and historical issues and the implications they have for foundational studies. For the most part, the author assumes little more than a familiarity with logic comparable to that provided in a beginning graduate course which includes the incompleteness of arithmetic and the Lowenheim-Skolem theorems. All those concerned with the foundations of mathematics will find this a thought-provoking discussion of some of the central issues in the field today. (shrink)

This paper is the second in a two-part series in which we discuss several notions of completeness for systems of mathematical axioms, with special focus on their interrelations and historical origins in the development of the axiomatic method. We argue that, both from historical and logical points of view, higher-order logic is an appropriate framework for considering such notions, and we consider some open questions in higher-order axiomatics. In addition, we indicate how one can fruitfully extend the usual set-theoretic semantics (...) so as to shed new light on the relevant strengths and limits of higher-order logic. (shrink)