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)

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)

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)

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.

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)

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.

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)

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.

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)

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)

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.

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.

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)

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)

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)

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)

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)

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.

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.

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

Sheaves of structures are useful to give constructions in universal algebra and model theory. We can describe their logical behavior in terms of Heyting‐valued structures. In this paper, we first provide a systematic treatment of sheaves of structures and Heyting‐valued structures from the viewpoint of categorical logic. We then prove a form of Łoś's theorem for Heyting‐valued structures. We also give a characterization of Heyting‐valued structures for which Łoś's theorem holds with respect to any maximal filter.

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)

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 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)

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)

We present a categorical/denotational semantics for the Lambek Syntactic Calculus , indeed for a λlD-typed version Curry-Howard isomorphic to it. The main novelty of our approach is an abstract noncommutative construction with right and left adjoints, called sequential product. It is defined through a hierarchical structure of categories reflecting the implicit permission to sequence expressions and the inductive construction of compound expressions. We claim that Lambek's noncommutative product corresponds to a noncommutative bi-endofunctor into a category, which encloses all categories of (...) such hierarchical structure. A soundness theorem for LSC is shown with respect to this semantical framework. (shrink)

All through the XXth century it has been repeated that "there is an exact correspondence, almost coincidence between Euclid's definition of equal ratios and the modern theory of irrational numbers due to Dedekind". Since the idea was presented as early as in 1908 in Thomas Heath's translation of Euclid's Elements as a comment to Book V, def. 5, we call it in the paper Heath's thesis. Heath's thesis finds different justifications so it is accepted yet in different versions. In the (...) paper its historical and mathematical version is reconstructed. We next reconstruct Eudoxos' theory of proportions in an axiomatic fashion. Finally, we show that Heath's thesis both in the historical and mathematical version is false. To this end a counterexample is given; it is based upon a specific interpretation of the uniform distribution theorem. (shrink)

We investigate the reverse-mathematical status of several theorems to the effect that the natural number system is second-order categorical. One of our results is as follows. Define a system to be a triple A,i,f such that A is a set and i∈A and f:A→A. A subset X⊆A is said to be inductive if i∈X and ∀a ∈X). The system A,i,f is said to be inductive if the only inductive subset of A is A itself. Define a Peano system to be (...) an inductive system such that f is one-to-one and i∉the range of f. The standard example of a Peano system is N,0,S where N={0,1,2,…,n,…}=the set of natural numbers and S:N→N is given by S=n+1 for all n∈N. Consider the statement that all Peano systems are isomorphic to N,0,S. We prove that this statement is logically equivalent to WKL0 over RCA0⁎ source. From this and similar equivalences we draw some foundational/philosophical consequences. (shrink)

In this paper, we present a categorical model for Multiplicative Additive Polarized Linear Logic , which is the linear fragment of Olivier Laurent’s Polarized Linear Logic. Our model is based on an adjunction between reflective/coreflective full subcategories / of an ambient *-autonomous category . Similar structures were first introduced by M. Barr in the late 1970’s in abstract duality theory and more recently in work on game semantics for linear logic. The paper has two goals: to discuss concrete models and (...) to present various completeness theorems.As concrete examples, we present a hypercoherence model, using Ehrhard’s hereditary/anti-hereditary objects, a Chu-space model, a double gluing model over our categorical framework, and a model based on iterated double gluing over a *-autonomous category.For the multiplicative fragment of. (shrink)

We investigate the complexity of isomorphisms of computable structures on cones in the Turing degrees. We show that, on a cone, every structure has a strong degree of categoricity, and that degree of categoricity is${\rm{\Delta }}_\alpha ^0 $-complete for someα. To prove this, we extend Montalbán’sη-system framework to deal with limit ordinals in a more general way. We also show that, for any fixed computable structure, there is an ordinalαand a cone in the Turing degrees such that the (...) exact complexity of computing an isomorphism between the given structure and another copy${\cal B}$in the cone is a c.e. degree in${\rm{\Delta }}_\alpha ^0\left$. In each of our theorems the cone in question is clearly described in the beginning of the proof, so it is easy to see how the theorems can be viewed as general theorems with certain effectiveness conditions. (shrink)

Wittgenstein’s philosophy of mathematics is often devalued due to its peculiar features, especially its radical departure from any of standard positions in foundations of mathematics, such as logicism, intuitionism, and formalism. We first contrast Wittgenstein’s finitism with Hilbert’s finitism, arguing that Wittgenstein’s is perspicuous or surveyable finitism whereas Hilbert’s is transcendental finitism. We then further elucidate Wittgenstein’s philosophy by explicating his natural history view of logic and mathematics, which is tightly linked with the so-called rule-following problem and Kripkenstein’s paradox, yielding (...) vital implications to the nature of mathematical understanding, and to the nature of the certainty and objectivity of mathematical truth. Since the incompleteness theorems, foundations of mathematics have mostly lost their philosophical driving force, and anti-foundationalism has become prevalent and pervasive. Yet new foundations have nevertheless emerged and come into the scene, namely categorical foundations. We articulate the foundational significance of category theory by explicating three forms of foundations, i.e., global foundations, local foundations, and conceptual foundations. And we explore the possibility of categorical unified science qua pluralistic unified science, arguing for the categorical unity of science on both mathematical and philosophical grounds. We then turn to an issue in conceptual foundations of mathematics, namely the nature of the concept of space. We elucidate Wittgenstein’s intensional conception of space in relation to Brouwer’s theory of space continua and to the modern conception of space as point-free structure in category theory and algebraic geometry. We finally give a bird’s-eye view of mathematical philosophy from a Wittgensteinian perspective, and further sheds new light on Wittgenstein’s constructive structuralism and his view of incompleteness and contradictions in mathematics. (shrink)

Wittgenstein’s philosophy of mathematics is often devalued due to its peculiar features, especially its radical departure from any of standard positions in foundations of mathematics, such as logicism, intuitionism, and formalism. We first contrast Wittgenstein’s finitism with Hilbert’s finitism, arguing that Wittgenstein’s is perspicuous or surveyable finitism whereas Hilbert’s is transcendental finitism. We then further elucidate Wittgenstein’s philosophy by explicating his natural history view of logic and mathematics, which is tightly linked with the so-called rule-following problem and Kripkenstein’s paradox, yielding (...) vital implications to the nature of mathematical understanding, and to the nature of the certainty and objectivity of mathematical truth. Since the incompleteness theorems, foundations of mathematics have mostly lost their philosophical driving force, and anti-foundationalism has become prevalent and pervasive. Yet new foundations have nevertheless emerged and come into the scene, namely categorical foundations. We articulate the foundational significance of category theory by explicating three forms of foundations, i.e., global foundations, local foundations, and conceptual foundations. And we explore the possibility of categorical unified science qua pluralistic unified science, arguing for the categorical unity of science on both mathematical and philosophical grounds. We then turn to an issue in conceptual foundations of mathematics, namely the nature of the concept of space. We elucidate Wittgenstein’s intensional conception of space in relation to Brouwer’s theory of space continua and to the modern conception of space as point-free structure in category theory and algebraic geometry. We finally give a bird’s-eye view of mathematical philosophy from a Wittgensteinian perspective, and further sheds new light on Wittgenstein’s constructive structuralism and his view of incompleteness and contradictions in mathematics. (shrink)

Answering one of the main questions of [S.-D. Friedman, T. Hyttinen and V. Kulikov, Generalized descriptive set theory and classification theory, Mem. Amer. Math. Soc. 230 80, Chap. 7], we show that there is a tight connection between the depth of a classifiable shallow theory [Formula: see text] and the Borel rank of the isomorphism relation [Formula: see text] on its models of size [Formula: see text], for [Formula: see text] any cardinal satisfying [Formula: see text]. This is achieved by (...) establishing a link between said rank and the [Formula: see text]-Scott height of the [Formula: see text]-sized models of [Formula: see text], and yields to the following descriptive set-theoretical analog of Shelah’s Main Gap Theorem: Given a countable complete first-order theory [Formula: see text], either [Formula: see text] is Borel with a countable Borel rank, or it is not Borel at all. The dividing line between the two situations is the same as in Shelah’s theorem, namely that of classifiable shallow theories. We also provide a Borel reducibility version of the above theorem, discuss some limitations to the possible complexities of [Formula: see text], and provide a characterization of categoricity of [Formula: see text] in terms of the descriptive set-theoretical complexity of [Formula: see text]. (shrink)

The category-theoretic representation of quantum event structures provides a canonical setting for confronting the fundamental problem of truth valuation in quantum mechanics as exemplified, in particular, by Kochen–Specker’s theorem. In the present study, this is realized on the basis of the existence of a categorical adjunction between the category of sheaves of variable local Boolean frames, constituting a topos, and the category of quantum event algebras. We show explicitly that the latter category is equipped with an object of truth (...) values, or classifying object, which constitutes the appropriate tool for assigning truth values to propositions describing the behavior of quantum systems. Effectively, this category-theoretic representation scheme circumvents consistently the semantic ambiguity with respect to truth valuation that is inherent in conventional quantum mechanics by inducing an objective contextual account of truth in the quantum domain of discourse. The philosophical implications of the resulting account are analyzed. We argue that it subscribes neither to a pragmatic instrumental nor to a relative notion of truth. Such an account essentially denies that there can be a universal context of reference or an Archimedean standpoint from which to evaluate logically the totality of facts of nature. (shrink)

Inductively defined structures are ubiquitous in mathematics; their specification is unambiguous and their properties are powerful. All fields of mathematical logic feature these structures prominently: the formula of a language, the set of theorems, the natural numbers, the primitive recursive functions, the constructive number classes and segments of the cumulative hierarchy of sets. -/- This dissertation gives a mathematical characterization of a species of inductively defined structures, called accessible domains, which include all of the above examples except the set of (...) theorems. The concept of an accessible domain comes from Wilfried Sieg's analysis of proof-theoretic practices, starting with his dissertation. In particular, he noticed the special epistemological character of elements of an accessible domain: they can always be uniquely identified with their build-up. Generally, the unique build-up of elements justifies the principles of induction and recursion. -/- I use category theory to give an abstract characterization of accessible domains. I claim that accessible domains are all instances of initial algebras for endofunctors. Grounded in the historical roots of Sieg's discussions, this dissertation shows how the properties of initial algebras for endofunctors and accessible domains coincide in a satisfying and natural way. -/- Filling out this characterization, I show how important examples of accessible domains fit into this broad characterization. I first characterize some accessible domains by relatively simple functors (e.g. finite, polynomial, those that preserve certain colimits) where we can see how iterating the functor can produce the accessible domain. Then I describe accessible domains that result from more involved specifications (e.g. ordinals and segments of the cumulative hierarchies associated with CZF, IZF, and ZF) by relying heavily on algebraic set theory. I end with a discussion of some of the methodological features of category theory in particular that helped characterize accessible domains. (shrink)

A novel conceptual framework is introduced for the Complexity Levels Theory in a Categorical Ontology of Space and Time. This conceptual and formal construction is intended for ontological studies of Emergent Biosystems, Super-complex Dynamics, Evolution and Human Consciousness. A claim is defended concerning the universal representation of an item’s essence in categorical terms. As an essential example, relational structures of living organisms are well represented by applying the important categorical concept of natural transformations to biomolecular reactions and relational structures that (...) emerge from the latter in living systems. Thus, several relational theories of living systems can be represented by natural transformations of organismic, relational structures. The ascent of man and other living organisms through adaptation, is viewed in novel categorical terms, such as variable biogroupoid representations of evolving species. Such precise but flexible evolutionary concepts will allow the further development of the unifying theme of local-to-global approaches to highly complex systems in order to represent novel patterns of relations that emerge in super- and ultra-complex systems in terms of compositions of local procedures. Solutions to such local-to-global problems in highly complex systems with ‘broken symmetry’ might be possible to be reached with the help of higher homotopy theorems in algebraic topology such as the generalized van Kampen theorems (HHvKT). Categories of many-valued, Łukasiewicz-Moisil (LM) logic algebras provide useful concepts for representing the intrinsic dynamic ‘asymmetry’ of genetic networks in organismic development and evolution, as well as to derive novel results for (non-commutative) Quantum Logics. Furthermore, as recently pointed out by Baianu and Poli (Theory and applications of ontology, vol 1. Springer, Berlin, in press), LM-logic algebras may also provide the appropriate framework for future developments of the ontological theory of levels with its complex/entangled/intertwined ramifications in psychology, sociology and ecology. As shown in the preceding two papers in this issue, a paradigm shift towards non-commutative, or non-Abelian, theories of highly complex dynamics—which is presently unfolding in physics, mathematics, life and cognitive sciences—may be implemented through realizations of higher dimensional algebras in neurosciences and psychology, as well as in human genomics, bioinformatics and interactomics. (shrink)

Jan Krajíček posed the following problem: Is there is a generalization result in the theory of real closed fields of the form: If A is provable in length k for all n ϵ ω , then A is provable? It is argued that the answer to this question depends on the particular formulation of the “theory of real closed fields.” Four distinct formulations are investigated with respect to their generalization behavior. It is shown that there is a positive answer to (...) Krajíček's question for 1. the axiom system RCF of Artin-Schreier with Gentzen's LK as underlying logical calculus, 2. RCF with the variant LK B of LK allowing introduction of several quantifiers of the same type in one step, 3. LK B and the first-order schemata corresponding to Dedekind cuts and the supremum principle. A negative answer is given for 4. any system containing the schema of extensionality. (shrink)

The article deals with Cantor's argument for the non-denumerability of reals somewhat in the spirit of Lakatos' logic of mathematical discovery. At the outset Cantor's proof is compared with some other famous proofs such as Dedekind's recursion theorem, showing that rather than usual proofs they are resolutions to do things differently. Based on this I argue that there are "ontologically" safer ways of developing the diagonal argument into a full-fledged theory of continuum, concluding eventually that famous semantic paradoxes based (...) on diagonal construction are caused by superficial understanding of what a name is. (shrink)

A novel conceptual framework is introduced for the Complexity Levels Theory in a Categorical Ontology of Space and Time. This conceptual and formal construction is intended for ontological studies of Emergent Biosystems, Super-complex Dynamics, Evolution and Human Consciousness. A claim is defended concerning the universal representation of an item’s essence in categorical terms. As an essential example, relational structures of living organisms are well represented by applying the important categorical concept of natural transformations to biomolecular reactions and relational structures that (...) emerge from the latter in living systems. Thus, several relational theories of living systems can be represented by natural transformations of organismic, relational structures. The ascent of man and other living organisms through adaptation, is viewed in novel categorical terms, such as variable biogroupoid representations of evolving species. Such precise but flexible evolutionary concepts will allow the further development of the unifying theme of local-to-global approaches to highly complex systems in order to represent novel patterns of relations that emerge in super- and ultra-complex systems in terms of compositions of local procedures. Solutions to such local-to-global problems in highly complex systems with ‘broken symmetry’ might be possible to be reached with the help of higher homotopy theorems in algebraic topology such as the generalized van Kampen theorems (HHvKT). Categories of many-valued, Łukasiewicz-Moisil (LM) logic algebras provide useful concepts for representing the intrinsic dynamic ‘asymmetry’ of genetic networks in organismic development and evolution, as well as to derive novel results for (non-commutative) Quantum Logics. Furthermore, as recently pointed out by Baianu and Poli (Theory and applications of ontology, vol 1. Springer, Berlin, in press), LM-logic algebras may also provide the appropriate framework for future developments of the ontological theory of levels with its complex/entangled/intertwined ramifications in psychology, sociology and ecology. As shown in the preceding two papers in this issue, a paradigm shift towards non-commutative, or non-Abelian, theories of highly complex dynamics—which is presently unfolding in physics, mathematics, life and cognitive sciences—may be implemented through realizations of higher dimensional algebras in neurosciences and psychology, as well as in human genomics, bioinformatics and interactomics. (shrink)

We prove that under reasonable assumptions, every cat (compact abstract theory) is metric, and develop some of the theory of metric cats. We generalise Morley's theorem: if a countable Hausdorff cat T has a unique complete model of density character Λ ≥ ω₁, then it has a unique complete model of density character Λ for every Λ ≥ ω₁.

We extend Morley's Theorem to show that if a theory is κ-p-categorical for some uncountable cardinal κ, it is uncountably categorical. We then discuss ω-p-categoricity and provide examples to show that similar extensions for the Baldwin-Lachlan and Lachlan Theorems are not possible.

This expository paper on Aristotle’s prototype underlying logic is intended for a broad audience that includes non-specialists. It requires as background a discussion of Aristotle’s demonstrative logic. Demonstrative logic or apodictics is the study of demonstration as opposed to persuasion. It is the subject of Aristotle’s two-volume Analytics, as its first sentence says. Many of Aristotle’s examples are geometrical. A typical geometrical demonstration requires a theorem that is to be demonstrated, known premises from which the theorem is to (...) be deduced, and a deductive logic by which the steps of the deduction proceed. Every demonstration produces knowledge of its conclusion for every person who comprehends the demonstration. Aristotle presented a general truth-and-consequence theory of demonstration meant to apply to all demonstrations: a demonstration is an extended argumentation that begins with premises known to be truths and that involves a chain of reasoning showing by deductively evident steps that its conclusion is a consequence of its premises. In short, a demonstration is a deduction whose premises are known to be true. Aristotle’s general theory of demonstration required a prior general theory of deduction presented in the Prior Analytics. His general immediate-deduction-chaining theory of deduction was meant to apply to all deductions: any deduction that is not immediately evident is an extended argumentation that involves a chaining of immediately evident steps that shows its final conclusion to follow logically from its premises. His deductions, both direct and indirect, were rule-based and not tautology-based. The idea of tautology-based deduction, which dominated modern logic in the early years of the 1900s, is nowhere to be found in Analytics. Rule-based deduction was rediscovered by modern logicians. To illustrate his general theory of deduction, Aristotle presented a prototype: an ingeniously simple and mathematically precise special case traditionally known as the categorical syllogistic. With reference only to propositions of the four so-called categorical forms, he painstakingly worked out exactly what those immediately evident deductive steps are and how they are chained to complete deductions. In his specialized prototype theory, Aristotle explained how to deduce from a given categorical premise set, no matter how large, any categorical conclusion implied by the given set. He did not extend this treatment to non-categorical deductions, thus setting a program for future logicians. The prototype, categorical syllogistic, was seen by Boole as a “first approximation” to a comprehensive logic. Today, however it appears more as the first of the dozens of logics already created and as the first exemplification of a family that continues to expand. (shrink)

In this paper, the author derives the Dedekind-Peano axioms for number theory from a consistent and general metaphysical theory of abstract objects. The derivation makes no appeal to primitive mathematical notions, implicit definitions, or a principle of infinity. The theorems proved constitute an important subset of the numbered propositions found in Frege's *Grundgesetze*. The proofs of the theorems reconstruct Frege's derivations, with the exception of the claim that every number has a successor, which is derived from a modal axiom that (...) (philosophical) logicians implicitly accept. In the final section of the paper, there is a brief philosophical discussion of how the present theory relates to the work of other philosophers attempting to reconstruct Frege's conception of numbers and logical objects. (shrink)

One recent `neologicist' claim is that what has come to be known as "Frege's Theorem"–the result that Hume's Principle, plus second-order logic, suffices for a proof of the Dedekind-Peano postulate–reinstates Frege's contention that arithmetic is analytic. This claim naturally depends upon the analyticity of Hume's Principle itself. The present paper reviews five misgivings that developed in various of George Boolos's writings. It observes that each of them really concerns not `analyticity' but either the truth of Hume's Principle or our (...) entitlement to accept it and reviews possible neologicist replies. A two-part Appendix explores recent developments of the fifth of Boolos's objections–the problem of Bad Company–and outlines a proof of the principle $N^q$, an important part of the defense of the claim that what follows from Hume's Principle is not merely a theory which allows of interpretation as arithmetic but arithmetic itself. (shrink)

In lieu of an abstract, here is a brief excerpt of the content:Journal of the History of Philosophy 39.3 (2001) 454-456 [Access article in PDF] Michael Potter. Reason's Nearest Kin: Philosophies of Arithmetic from Kant to Carnap.New York: Oxford University Press, 2000. Pp. x + 305. Cloth, $45.00. This book tells the story of a remarkable series of answers to two related questions:(1) How can arithmetic be necessary and knowable a priori? [End Page 454](2) What accounts for the applicability of (...) arithmetic to matters of empirical fact?These are philosophical questions, part of a "wider puzzle of explaining the link between experience, language, thought, and the world" (18). But answers to them are heavily constrained by technical results in logic and mathematics, and most of Potter's protagonists are either mathematicians (Frege, Dedekind, Ramsey, Hilbert, Gödel) or mathematically trained philosophers (Kant, Russell, Carnap). (Only Wittgenstein fits neither category.) Potter, whose doctorate was in pure mathematics, is an able guide.It is not hard to think of answers to these questions taken singly; what is hard is answering both at the same time. Formalists can easily explain why arithmetic does not depend for its justification on empirical fact—it is just a game with symbols, not responsible to anything beyond its own rules—but they then have trouble explaining why the world of empirical fact is constrained by this game. Empiricists can explain the applicability of arithmetic in just the same way they explain the applicability of physics, but they then must then explain away the apparent a prioricity and necessity of arithmetic. Kant was the first to propose a plausible answer to both questions: arithmetic is both necessary and empirically applicable because it is grounded in the spatio-temporal form of any possible experience.What unites Frege, Dedekind, Russell, Ramsey, Hilbert, and Carnap is that they reject Kant's answer while continuing to seek an answer to his question: how can arithmetic's necessity be reconciled with its applicability? Potter helpfully classifies their projects by the surrogates they substitute for Kant's appeal to the form of spatio-temporal intuition: Frege and Dedekind appeal to thought, Russell to necessary features of the world, Wittgenstein, Ramsey, and Carnap to language, and Hilbert to the necessary structure of our experience of finitary combinations of objects. (Revealingly, the logicists are not grouped together in Potter's taxonomy.) A chapter (or two) is devoted to each of these thinkers, plus Kant and Gödel.This breadth of coverage does not come at the price of superficiality: Potter's chapters are (by and large) accurate, penetrating, and full of interesting insights. I cannot think of another book that offers such clear explanations of the many mathematical concepts and distinctions one must grasp in order to follow debates in the philosophy of arithmetic. The Russell chapters are enhanced by numerous quotations from archival material. The exposition of Hilbert's programme and the implications for it of Gödel's theorems is the best I have seen. The discussions of Wittgenstein's views on arithmetic and of Carnap's syntactical approach also shine. The chapters on Kant and Frege are somewhat weaker; the discussion of Kant, in particular, would have benefited from some engagement with Michael Friedman's views.But the real contribution of Potter's book is its integration of these nine thinkers into a single coherent story. No one will be surprised that Russell's motivations can only be understood in light of Frege's failures, or that many features of Wittgenstein's cryptic work become clearer when seen in light of the specific problems with Russell's system. But there are also some less obvious payoffs: for example, Hilbert's programme is usefully compared with Russell's regressive method (227-8), and Carnap and Russell are shown to face a common dilemma (269, 286).If there is a central theme to Potter's story, it is "how often we have had to reject an [End Page 455] account not for philosophical reasons but for technical ones" (278). Frege's program founders on Russell's paradox, Russell's... (shrink)