One of the philosophical uses of Dedekind’s categoricity theorem for Peano Arithmetic is to provide support for semantic realism. To this end, the logical framework in which the proof of the theorem is conducted becomes highly significant. I examine different proposals regarding these logical frameworks and focus on the philosophical benefits of adopting open-ended schemas in contrast to second order logic as the logical medium of the proof. I investigate Pederson and Rossberg’s critique of the ontological advantages (...) of open-ended arithmetic when it comes to establishing the categoricity of Peano Arithmetic and show that the critique is highly problematic. I argue that Pederson and Rossberg’s ontological criterion deliver the bizarre result that certain first order subsystems of Peano Arithmetic have a second order ontology. As a consequence, the application of the ontological criterion proposed by Pederson and Rossberg assigns a certain type of ontology to a theory, and a different, richer, ontology to one of its subtheories. (shrink)

On a widespread naturalist view, the meanings of mathematical terms are determined, and can only be determined, by the way we use mathematical language—in particular, by the basic mathematical principles we’re disposed to accept. But it’s mysterious how this can be so, since, as is well known, minimally strong first-order theories are non-categorical and so are compatible with countless non-isomorphic interpretations. As for second-order theories: though they typically enjoy categoricity results—for instance, Dedekind’s categoricity theorem for second-order PA (...) and Zermelo’s quasi-categoricity theorem for second-order ZFC—these results require full second-order logic. So appealing to these results seems only to push the problem back, since the principles of second-order logic are themselves non-categorical: those principles are compatible with restricted interpretations of the second-order quantifiers on which Dedekind’s and Zermelo’s results are no longer available. In this paper, we provide a naturalist-friendly, non-revisionary solution to an analogous but seemingly more basic problem—Carnap’s Categoricity Problem for propositional and first-order logic—and show that our solution generalizes, giving us full second-order logic and thereby securing the categoricity or quasi-categoricity of second-order mathematical theories. Briefly, the first-order quantifiers have their intended interpretation, we claim, because we’re disposed to follow the quantifier rules in an open-ended way. As we show, given this open-endedness, the interpretation of the quantifiers must be permutation-invariant and so, by a theorem recently proved by Bonnay and Westerståhl, must be the standard interpretation. Analogously for the second-order case: we prove, by generalizing Bonnay and Westerståhl’s theorem, that the permutation invariance of the interpretation of the second-order quantifiers, guaranteed once again by the open-endedness of our inferential dispositions, suffices to yield full second-order logic. (shrink)

Many recent writers in the philosophy of mathematics have put great weight on the relative categoricity of the traditional axiomatizations of our foundational theories of arithmetic and set theory. Another great enterprise in contemporary philosophy of mathematics has been Wright's and Hale's project of founding mathematics on abstraction principles. In earlier work, it was noted that one traditional abstraction principle, namely Hume's Principle, had a certain relative categoricity property, which here we term natural relative categoricity. In this (...) paper, we show that most other abstraction principles are not naturally relatively categorical, so that there is in fact a large amount of incompatibility between these two recent trends in contemporary philosophy of mathematics. To better understand the precise demands of relative categoricity in the context of abstraction principles, we compare and contrast these constraints to stability-like acceptability criteria on abstraction principles, the Tarski-Sher logicality requirements on abstraction principles studied by Antonelli and Fine, and supervaluational ideas coming out of Hodes' work. (shrink)

Dedekind’s structuralism is a crucial source for the structuralism of mathematical practice—with its focus on abstract concepts like groups and fields. It plays an equally central role for the structuralism of philosophical analysis—with its focus on particular mathematical objects like natural and real numbers. Tensions between these structuralisms are palpable in Dedekind’s work, but are resolved in his essay Was sind und was sollen die Zahlen? In a radical shift, Dedekind extends his mathematical approach to “the” natural numbers. He creates (...) the abstract concept of a simply infinite system, proves the existence of a “model”, insists on the stepwise derivation of theorems, and defines structure-preserving mappings between different systems that fall under the abstract concept. Crucial parts of these considerations were added, however, only to the penultimate manuscript, for example, the very concept of a simply infinite system. The methodological consequences of this radical shift are elucidated by an analysis of Dedekind’s metamathematics. Our analysis provides a deeper understanding of the essay and, in addition, illuminates its impact on the evolution of the axiomatic method and of “semantics” before Tarski. This understanding allows us to make connections to contemporary issues in the philosophy of mathematics and science. (shrink)

In 1929 Carnap gave a paper in Prague on Investigations in General Axiomatics; a briefsummary was published soon after. Its subject lookssomething like early model theory, and the mainresult, called the Gabelbarkeitssatz, appears toclaim that a consistent set of axioms is complete justif it is categorical. This of course casts doubt onthe entire project. Though there is no furthermention of this theorem in Carnap''s publishedwritings, his Nachlass includes a largetypescript on the subject, Investigations inGeneral Axiomatics. We examine this work (...) here,showing that it provides important insights intoCarnap''s development during this critical period, thetransition from Aufbau to Syntax,especially regarding the nature and motivation ofCarnap''s logicism. Moreover, we show how theAxiomatics influenced Carnap''s student Gödel inreaching the fundamental logical results that soonafterwards undermined Carnap''s project. (shrink)

Some sufficient conditions on a Symmetric Monoidal Closed category K are obtained such that a diagram in a free SMC category generated by the set A of atoms commutes if and only if all its interpretations in K are commutative. In particular, the category of vector spaces on any field satisfies these conditions . Instead of diagrams, pairs of derivations in Intuitionistic Multiplicative Linear logic can be considered . Two derivations of the same sequent are equivalent if and only if (...) all their interpretations in K are equal. In fact, the assignment of values to atoms is defined constructively for each pair of derivations. Taking into account a mistake in R. Voreadou's proof of the “abstract coherence theorem” found by the author, it was necessary to modify her description of the class of non-commutative diagrams in SMC categories; our proof of S. Mac Lane conjecture also proves the correctness of the modified description. (shrink)

George Boolos was one of the most prominent and influential logician-philosophers of recent times. This collection, nearly all chosen by Boolos himself shortly before his death, includes thirty papers on set theory, second-order logic, and plural quantifiers; on Frege, Dedekind, Cantor, and Russell; and on miscellaneous topics in logic and proof theory, including three papers on various aspects of the Gödel theorems. Boolos is universally recognized as the leader in the renewed interest in studies of Frege's work on logic and (...) the philosophy of mathematics. John Burgess has provided introductions to each of the three parts of the volume, and also an afterword on Boolos's technical work in provability logic, which is beyond the scope of this volume. (shrink)

Richard Dedekind’s theorem 66 states that there exists an infinite set. Its proof invokes such apparently nonmathematical notions as the thought-world and the self. This article discusses the content and context of Dedekind’s proof. It is suggested that Dedekind took the notion of the thought-world from Hermann Lotze. The influence of Kant and Bernard Bolzano on the proof is also discussed, and the reception of the proof in the mathematical and philosophical literature is covered in detail.

First-order logic. The origin of modern foundational studies. Frege's system and the paradoxes. The teory of types. Zermelo-Fraenkel set theory. Hilbert's program and Godel's incompleteness theorems. The foundational systems of W.V. Quine. Categorical algebra.

Frege’s project has been characterized as an attempt to formulate a complete system of logic adequate to characterize mathematical theories such as arithmetic and set theory. As such, it was seen to fail by Gödel’s incompleteness theorem of 1931. It is argued, however, that this is to impose a later interpretation on the word ‘complete’ it is clear from Dedekind’s writings that at least as good as interpretation of completeness is categoricity. Whereas few interesting first-order mathematical theories are (...) categorical or complete, there are logical extensions of these theories into second-order and by the addition of generalized quantifiers which are categorical. Frege’s project really found success through Gödel’s completeness theorem of 1930 and the subsequent development of first- and higher-order model theory. (shrink)

We prove a categoricity transfer theorem for tame abstract elementary classes. Theorem 0.1. Suppose that K is a χ-tame abstract elementary class and satisfies the amalgamation and joint embedding properties and has arbitrarily large models. Let λ ≥ Max{χ.LS(K)⁺}. If K is categorical in λ and λ⁺, then K is categorical in λ⁺⁺. Combining this theorem with some results from [37], we derive a form of Shelah's Categoricity Conjecture for tame abstract elementary classes: Corollary 0.2. (...) Suppose K is a χ-tame abstract elementary class satisfying the amalgamation and joint embedding properties. Let μ₀:= Hanf(K). If χ ≤ ‮ב‬(2μ0)+ and K is categorical in some λ⁺ > ‮ב‬(2μ0)+, then K is categorical in μ for all μ > ‮ב‬(2μ0)+. (shrink)

We examine Paul Halmos’ comments on category theory, Dedekind cuts, devil worship, logic, and Robinson’s infinitesimals. Halmos’ scepticism about category theory derives from his philosophical position of naive set-theoretic realism. In the words of an MAA biography, Halmos thought that mathematics is “certainty” and “architecture” yet 20th century logic teaches us is that mathematics is full of uncertainty or more precisely incompleteness. If the term architecture meant to imply that mathematics is one great solid castle, then modern logic tends to (...) teach us the opposite lesson, namely that the castle is floating in midair. Halmos’ realism tends to color his judgment of purely scientific aspects of logic and the way it is practiced and applied. He often expressed distaste for nonstandard models, and made a sustained effort to eliminate first-order logic, the logicians’ concept of interpretation, and the syntactic vs semantic distinction. He felt that these were vague, and sought to replace them all by his polyadic algebra. Halmos claimed that Robinson’s framework is “unnecessary” but Henson and Keisler argue that Robinson’s framework allows one to dig deeper into set-theoretic resources than is common in Archimedean mathematics. This can potentially prove theorems not accessible by standard methods, undermining Halmos’ criticisms. (shrink)

A Dedekind algebra is an ordered pair (B, h), where B is a non-empty set and h is a similarity transformation on B. Among the Dedekind algebras is the sequence of the positive integers. From a contemporary perspective, Dedekind established that the second-order theory of the sequence of the positive integers is categorical and finitely axiomatizable. The purpose here is to show that this seemingly isolated result is a consequence of more general results in the model theory of second-order languages. (...) 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 that occurs in the decomposition of the algebra. Two Dedekind algebras are isomorphic iff their configuration signatures are identical. The second-order theory of any countably infinite Dedekind algebra is categorical, and there are countably infinite Dedekind algebras whose second-order theories are not finitely axiomatizable. It is shown that there is a condition on configuration signatures necessary and sufficient for the second-order theory of a Dedekind algebra to be finitely axiomatizable. It follows that the second-order theory of the sequence of the positive integers is categorical and finitely axiomatizable. (shrink)

In this entry, Frege's logic is introduced and described in some detail. It is shown how the Dedekind-Peano axioms for number theory can be derived from a consistent fragment of Frege's logic, with Hume's Principle replacing Basic Law V.

This entry explains Frege's Theorem by using the modern notation of the predicate calculus. Frege's Theorem is that the Dedekind-Peano axioms for number theory are derivable from Hume's Principle, given the axioms and rules of second-order logic. Frege's methodology for defining the natural numbers and for the derivation of the Dedekind-Peano axioms are sketched in some detail.

A syntactic machinery is developed for π-institutions based on the notion of a category of natural transformations on their sentence functors. Rules of inference, similar to the ones traditionally used in the sentential logic framework to define the best known sentential logics, are, then, introduced for π-institutions. A π-institution is said to be rule-based if its closure system is induced by a collection of rules of inference. A logical matrix-like semantics is introduced for rule-based π-institutions and a version of Bloom's (...) Lemma and Bloom's Theorem are proved for rule-based π-institutions. (shrink)

The principal goal of this entry is to present Frege's Theorem (i.e., the proof that the Dedekind-Peano axioms for number theory can be derived in second-order logic supplemented only by Hume's Principle) in the most logically perspicuous manner. We strive to present Frege's Theorem by representing the ideas and claims involved in the proof in clear and well-established modern logical notation. This prepares one to better prepared to understand Frege's own notation and derivations, and read Frege's original work (...) (whether in German or in translation). Moreover, this should prepare the reader to understand a number of scholarly books and articles in the secondary literature on Frege's work. (shrink)

Studies of categorical induction typically examine how belief in a premise (e.g., Falcons have an ulnar artery) projects on to a conclusion (e.g., Robins have an ulnar artery). We study induction in cases in which the premise is uncertain (e.g., There is an 80% chance that falcons have an ulnar artery). Jeffrey's rule is a normative model for updating beliefs in the face of uncertain evidence. In three studies we tested the descriptive validity of Jeffrey's rule and a related probability (...) theorem, the rule of total probability. Although these rules provided good approximations to mean judgments in some cases, the results from regression and correlation analyses suggest that participants focus on the parts of these rules that are associated with the highest overall probability. We relate our findings to rational models of judgment. (shrink)

By a celebrated theorem of Morley, a theory T is ℵ1‐categorical if and only if it is κ‐categorical for all uncountable κ. In this paper we are taking the first steps towards extending Morley's categoricity theorem “to the finite”. In more detail, we are presenting conditions, implying that certain finite subsets of certain ℵ1‐categorical T have at most one n‐element model for each natural number (counting up to isomorphism, of course).

In this chapter, we will provide an overview of Richard Dedekind's work on continuity, both foundational and mathematical. His seminal contribution to the foundations of analysis is the well-known 1872 booklet Stetigkeit und irrationale Zahlen (Continuity and irrational numbers), which is based on Dedekind's insight into the essence of continuity that he arrived at in the fall of 1858. After analysing the intuitive understanding of the continuity of the geometric line, Dedekind characterized the property of continuity for the (...) real numbers in terms of what are nowadays called 'Dedekind cuts' on the rational numbers. This treatment, which can be characterized as being 'arithmetical' as well as 'axiomatic', will be presented in detail. To better position Dedekind's contributions in their historical context, we will also consider some of his more mathematical treatments of continuity in addition to his foundational work. Of particular interest is the definition of the Riemann surface in his joint work with Heinrich Weber (1882). Moreover, Dedekind's reflections on space and continuity in his unpublished papers 'Allgemeine Sätze über Räume' (General theorems about spaces; before 1870) and 'Beweis und Anwendungen eines allgemeinen Satzes über mehrfach ausgedehnte stetige Gebiete' (Proof and applications of a general theorem about multiply extended continuous domains; 1892) illustrate the wide range and general coherency of his thoughts. By discussing Dedekind's works in which the notion of continuity plays a central role, we will show how Dedekind's approaches became increasingly abstract, while at the same time retaining a common methodology. (shrink)

The new concept of lambda calculi with monotone inductive types is introduced byhelp of motivations drawn from Tarski's fixed-point theorem (in preorder theory) andinitial algebras and initial recursive algebras from category theory. They are intendedto serve as formalisms for studying iteration and primitive recursion ongeneral inductively given structures. Special accent is put on the behaviour ofthe rewrite rules motivated by the categorical approach, most notably on thequestion of strong normalization (i.e., the impossibility of an infinitesequence of successive rewrite steps). (...) It is shown that this key propertyhinges on the concrete formulation. The canonical system of monotone inductivetypes, where monotonicity is expressed by a monotonicity witness beinga term expressing monotonicity through its type, enjoys strong normalizationshown by an embedding into the traditional system of non-interleavingpositive inductive types which, however, has to be enriched by the parametricpolymorphism of system F. Restrictions to iteration on monotone inductive typesalready embed into system F alone, hence clearly displaying the differencebetween iteration and primitive recursion with respect to algorithms despitethe fact that, classically, recursion is only a concept derived from iteration. (shrink)

This paper critically engages Philip Mirowki's essay, "The scientific dimensions of social knowledge and their distant echoes in 20th-century American philosophy of science." It argues that although the cold war context of anti-democratic elitism best suited for making decisions about engaging in nuclear war may seem to be politically and ideologically motivated, in fact we need to carefully consider the arguments underlying the new rational choice based political philosophies of the post-WWII era typified by Arrow's impossibility theorem. A distrust (...) of democratic decision-making principles may be developed by social scientists whose leanings may be toward the left or right side of the spectrum of political practices. (shrink)

We study the categoricity of the classes of elementary submodels of a homogeneous structure.

Gottfried Martin has recently reminded us of a useful distinction between two possible ways of doing metaphysics. We may proceed by framing a “theory of principles” or by proposing a “theory of being”. Aristotle explicitly formulates both possibilities as the task of metaphysics, formulating a theory of principles in his doctrine of the four types of causal explanation in the first book of the Metaphysics, while exploring the theory of being in a number of other passages, such as Book I, (...) chapters 6 and 9; Book X, chapter 2; and Book XIII. These passages do not elaborate principles whereby we can analyze the structure of certain entities, be they causes, substances or forms, but rather concern themselves with the ontological status of these entities—in what sense can they be said to be? In Plato this distinction is more implicit, but we may contrast the theory of forms developed in the Phaedo and the Republic with the subsequent probing investigation of the being of these forms in the Parmenides and the Sophist. Kant “explicitly claims to have discovered and presented a complete and necessary system of the basic concepts and principles. The proof of the completeness and necessity of this system is the aim of the middle part of the Critique of Pure Reason, the Transcendental Analytic.” Yet. (shrink)

We introduce a new approach to the model theory of metric structures by defining the notion of a metric abstract elementary class (MAEC) closely resembling the notion of an abstract elementary class. Further we define the framework of a homogeneous MAEC were we additionally assume the existence of arbitrarily large models, joint embedding, amalgamation, homogeneity and a property which we call the perturbation property. We also assume that the Löwenheim-Skolem number, which in this setting refers to the density character of (...) the set instead of the cardinality, is ${\aleph_0}$ . In these settings we prove an analogue of Morley’s categoricity transfer theorem. We also give concrete examples of homogeneous MAECs. (shrink)

Using the framework of categorical logic, this paper analyzes and streamlines Gabbay's semantical proof of the Craig interpolation theorem for intuitionistic predicate logic. In the process, an apparently new and interesting fact about the relation of coherent and intuitionistic logic is found.

In this paper we address a deeply interesting debate that took place at the end of the last millennia between David Mermin, Adan Cabello and Michiel Seevinck, regarding the meaning of relationalism within quantum theory. In a series of papers, Mermin proposed an interpretation in which quantum correlations were considered as elements of physical reality. Unfortunately, the very young relational proposal by Mermin was too soon tackled by specially suited no-go theorems designed by Cabello and Seevinck. In this work we (...) attempt to reconsider Mermin's program from the viewpoint of the Logos Categorical Approach to QM. Following Mermin's original proposal, we will provide a redefinition of quantum relation which not only can be understood as a preexistent element of physical reality but is also capable to escape Cabello’s and Seevinck's no-go-theorems. In order to show explicitly that our notion of ontological quantum relation is safe from no-go theorems we will derive a non-contextuality theorem. We end the paper with a discussion regarding the physical meaning of quantum relationalism. (shrink)

A layman's guide to the mechanics of Gödel's proof together with a lucid discussion of the issues which it raises. Includes an essay discussing the significance of Gödel's work in the light of Wittgenstein's criticisms.

A precise notion of ‘mathematical structure’ other than that given by model theory may prove fruitful in the philosophy of mathematics. It is shown how the language and methods of category theory provide such a notion, having developed out of a structural approach in modern mathematical practice. As an example, it is then shown how the categorical notion of a topos provides a characterization of ‘logical structure’, and an alternative to the Pregean approach to logic which is continuous with the (...) modern structural approach in mathematics. (shrink)

In 1931 the mathematical logician Kurt Godel published a revolutionary paper that challenged certain basic assumptions underpinning mathematics and logic. A colleague of Albert Einstein, his theorem proved that mathematics was partly based on propositions not provable within the mathematical system and had radical implications that have echoed throughout many fields. A gripping combination of science and accessibility, Godel’s Proof by Nagel and Newman is for both mathematicians and the idly curious, offering those with a taste for logic and (...) philosophy the chance to satisfy their intellectual curiosity. (shrink)

We give a complete and elementary proof of the following upward categoricity theorem: let be a local abstract elementary class with amalgamation and joint embedding, arbitrarily large models, and countable Löwenheim–Skolem number. If is categorical in 1 then is categorical in every uncountable cardinal. In particular, this provides a new proof of the upward part of Morley’s theorem in first order logic without any use of prime models or heavy stability theoretic machinery.

A classic result in the foundations of Yang-Mills theory, due to J. W. Barrett ["Holonomy and Path Structures in General Relativity and Yang-Mills Theory." Int. J. Th. Phys. 30, ], establishes that given a "generalized" holonomy map from the space of piece-wise smooth, closed curves based at some point of a manifold to a Lie group, there exists a principal bundle with that group as structure group and a principal connection on that bundle such that the holonomy map corresponds to (...) the holonomies of that connection. Barrett also provided one sense in which this "recovery theorem" yields a unique bundle, up to isomorphism. Here we show that something stronger is true: with an appropriate definition of isomorphism between generalized holonomy maps, there is an equivalence of categories between the category whose objects are generalized holonomy maps on a smooth, connected manifold and whose arrows are holonomy isomorphisms, and the category whose objects are principal connections on principal bundles over a smooth, connected manifold. This result clarifies, and somewhat improves upon, the sense of "unique recovery" in Barrett's theorems; it also makes precise a sense in which there is no loss of structure involved in moving from a principal bundle formulation of Yang-Mills theory to a holonomy, or "loop", formulation. (shrink)

Whether visual perceptual consciousness is gradable or dichotomous has been the subject of fierce debate in recent years. If perceptual consciousness is gradable, perceivers may have less than full access to—and thus be less than fully phenomenally aware of—perceptual information that is represented in working memory. This raises the question: In virtue of what can a subject be less than fully perceptually conscious? In this chapter, we provide an answer to this question, according to which inexact categorizations of visual input (...) may result in a representation of the visual information in working memory that is less than fully available to the perceiver, and of which the perceiver is therefore less than fully phenomenally aware. The latter proposal is a natural extension of a theory of perception we have proposed in previous works, namely, the template tuning theory (TTT). We argue that although TTT is compatible with both gradable and dichotomous conceptions of perceptual consciousness, the available empirical evidence favours a gradable conception of perceptual consciousness. (shrink)

Wójcicki has provided a characterization of selfextensional logics as those that can be endowed with a complete local referential semantics. His result was extended by Jansana and Palmigiano, who developed a duality between the category of reduced congruential atlases and that of reduced referential algebras over a fixed similarity type. This duality restricts to one between reduced atlas models and reduced referential algebra models of selfextensional logics. In this paper referential algebraic systems and congruential atlas systems are introduced, which abstract (...) referential algebras and congruential atlases, respectively. This enables the formulation of an analog of Wójcicki’s Theorem for logics formalized as π-institutions. Moreover, the results of Jansana and Palmigiano are generalized to obtain a duality between congruential atlas systems and referential algebraic systems over a fixed categorical algebraic signature. In future work, the duality obtained in this paper will be used to obtain one between atlas system models and referential algebraic system models of an arbitrary selfextensional π-institution. Using this latter duality, the characterization of fully selfextensional deductive systems among the selfextensional ones, that was obtained by Jansana and Palmigiano, can be extended to a similar characterization of fully selfextensional π-institutions among appropriately chosen classes of selfextensional ones. (shrink)

A new approach to quantum theory is proposed in this paper. The basis is taken to be theoretical variables, variables that may be accessible or inaccessible, i.e., it may be possible or impossible for an observer to assign arbitrarily sharp numerical values to them. In an epistemic process, the accessible variables are just ideal observations connected to an observer or to some communicating observers. Group actions are defined on these variables, and group representation theory is the basis for developing the (...) Hilbert space formalism here. Operators corresponding to accessible theoretical variables are derived, and in the discrete case, it is proved that the possible physical values are the eigenvalues of these operators. The focus of the paper is some mathematical theorems paving the ground for the proposed foundation of quantum theory. It is shown here that the groups and transformations needed in this approach can be constructed explicitly in the case where the accessible variables are finite-dimensional. This simplifies the theory considerably: To reproduce the Hilbert space formulation, it is enough to assume the existence of two complementary variables. The interpretation inferred from the proposed foundation here may be called a general epistemic interpretation of quantum theory. A special case of this interpretation is QBism; it also has a relationship to several other interpretations. (shrink)

The main theorem of this paper is: If ƒ is a partial function from ℵ 1 to ℵ 1 which is ∑ 1 1 -bounded, then there is a weakly finite primitive recursive dilator D such that for all infinite αϵdom , ƒ ⩽ D . The proof involves only elementary combinatorial constructions of trees. A generalization to ptykes is also given.

A set S of degrees is said to be an initial segment if c ≤ d ∈ S→-c∈S. Shoenfield has shown that if P is the lattice of all subsets of a finite set then there is an initial segment of degrees isomorphic to P. Rosenstein [2] (independently) proved the same to hold of the lattice of all finite subsets of a countable set. We shall show that “countable set” may be replaced by “set of cardinality at most that of (...) the continuum.” This result is also an extension of [3, Corollary 2 to Theorem 15], which states that there is a sublattice of degrees isomorphic to the lattice of all finite subsets of 2N. (A sublattice of degrees is a subset closed under ∪ and ∩; an initial segment closed under ∪ is necessarily a sublattice, but not conversely.)It seems worth noting that the proof of the present result was preceded in time by our proof [4] of the analogous theorem for hyperdegrees, and is in fact an adaptation of that proof. Thus the present work has been influenced much more directly by the Gandy-Sacks forcing construction of a minimal hyperdegree [1] than by previous work on initial segments of degrees. (shrink)

This is a critical analysis of the first part of Go¨del’s 1951 Gibbs lecture on certain philosophical consequences of the incompleteness theorems. Go¨del’s discussion is framed in terms of a distinction between objective mathematics and subjective mathematics, according to which the former consists of the truths of mathematics in an absolute sense, and the latter consists of all humanly demonstrable truths. The question is whether these coincide; if they do, no formal axiomatic system (or Turing machine) can comprehend the mathematizing (...) potentialities of human thought, and, if not, there are absolutely unsolvable mathematical problems of diophantine form. (shrink)