Due to Gӧdel’s incompleteness results, the categoricity of a sufficiently rich mathematical theory and the semantic completeness of its underlying logic are two mutually exclusive ideals. For first- and second-order logics we obtain one of them with the cost of losing the other. In addition, in both these logics the rules of deduction for their quantifiers are non-categorical. In this paper I examine two recent arguments –Warren (2020), Murzi and Topey (2021)– for the idea that the natural deduction rules (...) for the first-order universal quantifier are categorical, i.e., they uniquely determine its semantic intended meaning. Both of them make use of McGee’s open-endedness requirement and the second one uses in addition Garson’s (2013) local models for defining the validity of these rules. I argue that the success of both these arguments is relative to their semantic or infinitary assumptions, which could be easily discharged if the introduction rule for the universal quantifier is taken to be an infinitary rule, i.e. non-compact. Consequently, I reconsider the use of the ω-rule and I show that the addition of the ω-rule to the standard formalizations of first-order logic is categorical. In addition, I argue that the open-endedness requirement does not make the first-order Peano Arithmetic categorical and I advance an argument for its categoricity based on the inferential conservativity requirement. (shrink)

A classic exposition of Kant's ethical thought.

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)

Journal of Social Philosophy, EarlyView.

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)

After a short preface, the first of the three sections of this paper is devoted to historical and philosophic aspects of categoricity. The second section is a self-contained exposition, including detailed definitions, of a proof that every mathematical system whose domain is the closure of its set of distinguished individuals under its distinguished functions is categorically characterized by its induction principle together with its true atoms (atomic sentences and negations of atomic sentences). The third section deals with applications especially (...) those involving the distinction between characterizing a system and axiomatizing the truths of a system. (shrink)

Deprivation views of the badness of death are almost universally accepted among those who hold that death can be bad for the person who dies. In their most common form, deprivation views hold that death is bad because (and to the extent that) it deprives people of goods they would have gained had they not died at the time they did. Contrast this with categorical desire views, which hold that death is bad because (and to the extent that) it thwarts (...) people’s categorical desires. Categorical desires are desires that are not conditional upon one being alive; yet provide reason for the agent to continue living to ensure that those very desires are satisfied. I argue that categorical desire views are subject to two serious problems that deprivation views are not. First, categorical desire views entail that it is not bad for someone to not be resuscitated after dying a bad death. Second, categorical desire views cannot account for cases in which it is good to prevent people from coming into existence or cases in which it is good to prevent them from continuing to exist. After considering, and rejecting, various replies on behalf of categorical desire proponents, I conclude that we have good reason to reject categorical desire views in favor of deprivation views. (shrink)

This article considers categorical perception (CP) as a crucial process involved in all sort of communication throughout the biological hierarchy, i.e. in all of biosemiosis. Until now, there has been consideration of CP exclusively within the functional cycle of perception–cognition–action and it has not been considered the possibility to extend this kind of phenomena to the mere physiological level. To generalise the notion of CP in this sense, I have proposed to distinguish between categorical perception (CP) and categorical sensing (CS) (...) in order to extend the CP framework to all communication processes in living systems, including intracellular, intercellular, metabolic, physiological, cognitive and ecological levels. The main idea is to provide an account that considers the heterarchical embeddedness of many instances of CP and CS. This will take me to relate the hierarchical nature of categorical sensing and perception with the equally hierarchical issues of the “binding problem”, “triadic causality”, the “emergent interpretant” and the increasing semiotic freedom observed in biological and cognitive systems. (shrink)

This paper deals with the algebraization of multi-signature equational logic in the context of the modern theory of categorical abstract algebraic logic. Two are the novelties compared to traditional treatments: First, interpretations between different algebraic types are handled in the object language rather than the metalanguage. Second, rather than constructing the type of the algebraizing class of algebras explicitly in an ad-hoc universal algebraic way, the whole clone is naturally constructed using categorical algebraic techniques.

Categorical Monism (that is, the view that all fundamental natural properties are purely categorical) has recently been challenged by a number of philosophers. In this paper, I examine a challenge which can be based on Gabriele Contessa’s [10] defence of the view that only powers can confer dispositions. In his paper Contessa argues against what he calls the Nomic Theory of Disposition Conferral (NTDC). According to NTDC, in each world in which they exist, (categorical) properties confer specific dispositions on their (...) bearers; yet, which disposition a (categorical) property confers on its bearers depends on what the (contingent) laws of nature happen to be. Contessa, inter alia, rests his case on an intuitive analogy between cases of mimicking (in which objects do not actually possess the dispositions associated with their displayed behaviour) and cases of disposition conferral through the action of laws. In this paper, I criticize various aspects of Contessa’s argumentation and show that the conclusion he arrives at (that is, only powers can confer dispositions) is controversial. (shrink)

We characterize Δ20-categoricity in Boolean algebras and linear orderings under some extra effectiveness conditions. We begin with a study of the relativized notion in these structures.

We show that the categoricity of second-order Peano axioms can be proved from the comprehension axioms. We also show that the categoricity of second-order Zermelo–Fraenkel axioms, given the order type of the ordinals, can be proved from the comprehension axioms. Thus these well-known categoricity results do not need the so-called “full” second-order logic, the Henkin second-order logic is enough. We also address the question of “consistency” of these axiom systems in the second-order sense, that is, the question (...) of existence of models for these systems. In both cases we give a consistency proof, but naturally we have to assume more than the mere comprehension axioms. (shrink)

We prove that from categoricity in λ+ we can get categoricity in all cardinals ≥ λ+ in a χ-tame abstract elementary classe [Formula: see text] which has arbitrarily large models and satisfies the amalgamation and joint embedding properties, provided [Formula: see text] and λ ≥ χ. For the missing case when [Formula: see text], we prove that [Formula: see text] is totally categorical provided that [Formula: see text] is categorical in [Formula: see text] and [Formula: see text].

Let K be the class of atomic models of a countable first order theory. We prove that if K is excellent and categorical in some uncountable cardinal, then each model is prime and minimal over the basis of a definable pregeometry given by a quasiminimal set. This implies that K is categorical in all uncountable cardinals. We also introduce a U-rank to measure the complexity of complete types over models. We prove that the U-rank has the usual additivity properties, that (...) quasiminimal types have U-rank 1, and that the U-rank of any type is finite in the uncountably categorical, excellent case. However, in contrast to the first order case, the supremum of the U-rank over all types may be ω (and is not achieved). We illustrate the theory with the example of free groups, and Zilber's pseudo analytic structures. (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)

In this chapter, I critically examine two of the main approaches to colour categorization in cognitive science: the perceptual salience theory and linguistic relativism. I then turn to reviewing several decades of psychological research on colour categorical perception (CP). A careful assessment of relevant findings suggests that most of the experimental effects that have been understood in terms of CP actually fall on the cognition side of the perception-cognition divide: they are effects of colour language, for example, on memory or (...) decision-making. (shrink)

For a computable structure $\mathcal {M}$, the categoricity spectrum is the set of all Turing degrees capable of computing isomorphisms among arbitrary computable copies of $\mathcal {M}$. If the spectrum has a least degree, this degree is called the degree of categoricity of $\mathcal {M}$. In this paper we investigate spectra of categoricity for computable rigid structures. In particular, we give examples of rigid structures without degrees of categoricity.

Notoriously, the dispositional view of natural properties is thought to face a number of regress problems, one of which points to an epistemological worry. In this paper, I argue that the rival categorical view is also susceptible to the same kind of regress problem. This problem can be overcome, most plausibly, with the development of a structuralist epistemology. After identifying problems faced by alternative solutions, I sketch the main features of this structuralist epistemological approach, referring to graph-theoretic modelling in the (...) process. Given that both the categoricalists and dispositionalists are under pressure to adopt this same epistemological approach in light of the regress problem, this suggests that the categoricalist versus dispositionalist debate is best fought on metaphysical rather than epistemological grounds. (shrink)

Categorical perception (CP) refers to how similar things look different depending on whether they are classified as the same category. Many studies demonstrate that adult humans show CP for human emotional faces. It is widely debated whether the effect can be accounted for solely by perceptual differences (structural differences among emotional faces) or whether additional perceiver-based conceptual knowledge is required. In this review, I discuss the phenomenon of CP and key studies showing CP for emotional faces. I then discuss a (...) new model of emotion which highlights how perceptual and conceptual knowledge interact to explain how people see discrete emotions in others’ faces. In doing so, I discuss how language (emotion words included in the paradigm) contribute to CP. (shrink)

An ω-categorical supersimple group is finite-by-abelian-by-finite, and has finite SU-rank. Every definable subgroup is commensurable with an acl( $\emptyset$ )-definable subgroup. Every finitely based regular type in a CM-trivial ω-categorical simple theory is non-orthogonal to a type of SU-rank 1. In particular, a supersimple ω-categorical CM-trivial theory has finite SU-rank.

The third author has shown that Shelah's eventual categoricity conjecture holds in universal classes: class of structures closed under isomorphisms, substructures, and unions of chains. We extend this result to the framework of multiuniversal classes. Roughly speaking, these are classes with a closure operator that is essentially algebraic closure (instead of, in the universal case, being essentially definable closure). Along the way, we prove in particular that Galois (orbital) types in multiuniversal classes are determined by their finite restrictions, generalizing (...) a result of the second author. (shrink)

This article proposes to explicate theoretical equivalence by supplementing formal equivalence criteria with preservation conditions concerning interpretation. I argue that both the internal structure of models and choices of morphisms are aspects of formalisms that are relevant when it comes to their interpretation. Hence, a formal criterion suitable for being supplemented with preservation conditions concerning interpretation should take these two aspects into account. The two currently most important criteria—gener-alized definitional equivalence (Morita equivalence) and categorical equivalence—are not optimal in this respect. (...) I put forward a criterion that takes both aspects into account: the criterion of definable categorical equivalence. (shrink)

Let be an abstract elementary class with amalgamation, and Lowenheim Skolem number LS. We prove that for a suitable Hanf number gc0 if χ0 < λ0 λ1, and is categorical inλ1+ then it is categorical in λ0.

Much of our private and public ethical discourse occurs in the giving, receiving, or demanding of an apology, yet we suffer deep confusion regarding what an apology actually is. Most of us have never made explicit precisely what we expect from a full apology and therefore apologizing has become a vague and clumsy ritual. Full apologies can be morally and emotionally powerful, but, as with most valuable things, frauds masquerade as the genuine article. These semblances of apologies often deceive and (...) manipulate, and such duplicity is common between lovers, families, litigants, and nations. In response to this, I propose nine elements that an apology must satisfy in order to be considered categorical. I believe we have such a categorical apology in mind when we seek a full apology. The standards for a categorical apology are rigorous and precise, and I hope to disentangle the distinct elements of apologies. A categorical apology is a rare and burdensome act, and under certain circumstances full apologies may not be possible regardless of how badly we may desire them. While the leading social science accounts by Aaron Lazare and Nicolas Tavuchis aptly demonstrate how apologies lubricate reciprocally egoist relationships, such theories ultimately prove unsatisfying because apologies achieve their highest meaning as morally rich acts. Both Tavuchis and Lazare offer merely descriptive accounts when a prescriptive argument seems necessary. No philosopher, however, has ever devoted a monograph to the topic and only a handful of papers on apologies have appeared in philosophy journals. (shrink)

The concept of “life” certainly is of some use to distinguish birds and beavers from water and stones. This pragmatic usefulness has led to its construal as a categorical predicate that can sift out living entities from non-living ones depending on their possessing specific properties—reproduction, metabolism, evolvability etc. In this paper, we argue against this binary construal of life. Using text-mining methods across over 30,000 scientific articles, we defend instead a degrees-of-life view and show how these methods can contribute to (...) experimental philosophy of science and concept explication. We apply topic-modeling algorithms to identify which specific properties are attributed to a target set of entities (bacteria, archaea, viruses, prions, plasmids, phages and the molecule of adenine). Eight major clusters of properties were identified together with their relative relevance for each target entity (two that relate to metabolism and catalysis, one to genetics, one to evolvability, one to structure, and—rather unexpectedly—three that concern interactions with the environment broadly construed). While aligning with intuitions—for instance about viruses being less alive than bacteria—these quantitative results also reveal differential degrees of performance that have so far remained elusive or overlooked. Taken together, these analyses provide a conceptual “lifeness space” that makes it possible to move away from a categorical construal of life by empirically assessing the relative lifeness of more-or-less alive entities. (shrink)

We argue that, if taken seriously, Kripke's view that a language for science can dispense with a negation operator is to be rejected. Part of the argument is a proof that positive logic, i.e., classical propositional logic without negation, is not categorical.

Stephen Mumford, in his book on dispositions, argues that we can distinguish between dispositional and categorical properties in terms of entailing his 'conditional conditionals', which involve the concept of ideal conditions. I aim at defending Mumford's criterion for distinguishing between dispositional and categorical properties. To be specific, no categorical ascriptions entail Mumford's 'conditional conditionals'.

If the theory advanced below is correct, then what is the difference (I know she [Philippa Foot]] will ask) between the moral must/must not and the must/must not of etiquette or the clubhouse? Looking forward to the conclusion I shall reach, let me reply, roughly and readily, that the difference will reside not in anything formal but in the depth, spread, and felt authority of the attachments to which the moral must/must not appeals-and categorically appeals.

Why do we draw the boundaries between “blue” and “green”, where we do? One proposed answer to this question is that we categorize color the way we do because we perceive color categorically. Starting in the 1950’s, the phenomenon of “categorical perception” (CP) encouraged such a response. CP refers to the fact that adjacent color patches are more easily discriminated when they straddle a category boundary than when they belong to the same category. In this paper, I make three related (...) claims. (1) Although what seems to guide discrimination performances seems to indeed be categorical information, the evidence in favor of the fact that categorical perception infl uences the way we perceive color is not convincing. (2) That CP offers a useful account of categorization is not obvious.While aiming at accounting for categorization, CP itself requires an account of categories. This being said, CP remains an interesting phenomenon. Why and how is our discrimination behavior linked to our categories? It is suggested that linguistic labels determine CP through a naming strategy to which participants resort while discriminating colors. This paper’s fi nal point is (3) that the naming strategy account is not enough. Beyond category labels, what seems to guide discrimination performance is category structure. (shrink)

Hellman [2003] raises interesting challenges to categorical structuralism. He starts citing Awodey [1996] which, as Hellman sees, is not intended as a foundation for mathematics. It offers a structuralist framework which could denned in any of many different foundations. But Hellman says Awodey's work is 'naturally viewed in the context of Mac Lane's repeated claim that category theory provides an autonomous foundation for mathematics as an alternative to set theory' (p. 129). Most of Hellman's paper 'scrutinizes the formulation of category (...) theory' specifically in 'its alleged role as providing a foundation' (p. 130). I will also focus on the foundational question. Page numbers in parentheses are page references to Hellman [2003]. (shrink)

We investigate effective categoricity for polymodal algebras. We prove that the class of polymodal algebras is complete with respect to degree spectra of nontrivial structures, effective dimensions, expansion by constants, and degree spectra of relations. In particular, this implies that every categoricity spectrum is the categoricity spectrum of a polymodal algebra.

The type-level abstraction is a formal way to represent molecular structures in biological practice. Graphical representations of molecular structures of biological objects are also used to identify functional processes of things. This paper will reveal that category theory is a formal mathematical language not only to visualize molecular structures of biological objects as type-level abstraction formally but also to understand how to infer biological functions from the molecular structures of biological objects. Category theory is a toolkit to understand biological knowledge (...) at the type-level formally, not individual token-level, as well as typical heuristic strategies in molecular biology. (shrink)

We provide here the first steps toward a Classification Theory ofElementary Classes with no maximal models, plus some mild set theoretical assumptions, when the class is categorical in some λ greater than its Löwenheim-Skolem number. We study the degree to which amalgamation may be recovered, the behaviour of non μ-splitting types. Most importantly, the existence of saturated models in a strong enough sense is proved, as a first step toward a complete solution to the o Conjecture for these classes. Further (...) results are in preparation. (shrink)

The hypothetical notion of consequence is normally understood as the transmission of a categorical notion from premisses to conclusion. In model-theoretic semantics this categorical notion is 'truth', in standard proof-theoretic semantics it is 'canonical provability'. Three underlying dogmas, (I) the priority of the categorical over the hypothetical, (II) the transmission view of consequence, and (III) the identification of consequence and correctness of inference are criticized from an alternative view of proof-theoretic semantics. It is argued that consequence is a basic semantical (...) concept which is directly governed by elementary reasoning principles such as definitional closure and definitional reflection, and not reduced to a categorical concept. This understanding of consequence allows in particular to deal with non-wellfounded phenomena as they arise from circular definitions. (shrink)

We investigate effective categoricity of computable equivalence structures . We show that is computably categorical if and only if has only finitely many finite equivalence classes, or has only finitely many infinite classes, bounded character, and at most one finite k such that there are infinitely many classes of size k. We also prove that all computably categorical structures are relatively computably categorical, that is, have computably enumerable Scott families of existential formulas. Since all computable equivalence structures are relatively (...) categorical, we further investigate when they are categorical. We also obtain results on the index sets of computable equivalence structures. (shrink)

We characterize the structure of computably categorical trees of finite height, and prove that our criterion is both necessary and sufficient. Intuitively, the characterization is easiest to express in terms of isomorphisms of (possibly infinite) trees, but in fact it is equivalent to a Σ03-condition. We show that all trees which are not computably categorical have computable dimension ω. Finally, we prove that for every n≥ 1 in ω, there exists a computable tree of finite height which is δ0n+1-categorical but (...) not δ0n-categorical. (shrink)

The question has been raised whether Nietzsche intends eternal recurrence to be like a categorical imperative. The obvious objection to understanding eternal recurrence as like a categorical imperative is that for a categorical imperative to make any sense, for moral obligation to make any sense, it must be possible for individuals to change themselves. And Nietzsche denies that individuals can change themselves. Magnus thinks the determinism “implicit in the doctine of the eternal recurrence of the same renders any imperative impotent…. (...) How can one will what must happen in any case?” At the other end of the spectrum, those who do hold that eternal recurrence is like a categorical imperative, for their part, tend to ignore or deny the determinism involved in eternal recurrence. This article explores the extent to which it can be claimed that eternal recurrence is like a categorical imperative without downplaying Nietzsche's dterminism. (shrink)

A well-known difficulty that affects all accounts of laws of nature according to which the latter are higher-order facts involving relations between universals (the so-called DTA accounts, from Dretske in Philosophy of Science 44:248–268, 1977; Tooley in Canadian Journal of Philosophy 7:667–698, 1977 and Armstrong (What is a Law of Nature?, Cambridge University Press, Cambridge, 1983)) is the Inference Problem: how can laws construed in that way determine the first-order regularities that we find in the actual world? Bird (Analysis 65:147–55, (...) 2005) has argued that there is no solution to the Inference Problem which is consistent with both categorical monism (that is, the view that all natural properties are categorical) and basic tenets of Armstrong’s account of the laws of nature. This paper shows that, given Armstrong’s view about laws as first-order structural universals whose instantiation ‘produce’ nomic regularities and under specific plausible metaphysical assumptions concerning nomic relations which are consistent with a broadly construed DTA approach to laws, there is no extra difficulty regarding the Inference Problem in a categorical monistic context besides the ones that beset structural universals in general. (shrink)

The results in this paper are in a context of abstract elementary classes identified by Shelah and Villaveces in which the amalgamation property is not assumed. The long-term goal is to solve Shelah’s Categoricity Conjecture in this context. Here we tackle a problem of Shelah and Villaveces by proving that in their context, the uniqueness of limit models follows from categoricity under the assumption that the subclass of amalgamation bases is closed under unions of bounded, -increasing chains.

What is sexual orientation? The contemporary consensus among philosophers is that it is a disposition. Unsurprisingly, recent debates about the metaphysics of sexual orientation are almost entirely intramural. Behavioral dispositionalists argue that sexual orientation is a disposition to behave sexually. Desire dispositionalists argue that it is a disposition to desire sexually. We argue that sexual orientation is not best understood in terms of dispositions to behave or dispositions to desire before arguing that dispositions tout court fail to illuminate sexual orientation. (...) We then introduce and defend the idea that sexual orientation is best understood in terms of categorical phenomenal properties of sexual arousal. (shrink)

During public health crises including the COVID-19 pandemic, resource scarcity and contagion risks may require health systems to shift—to some degree—from a usual clinical ethic, focused on the well-being of individual patients, to a public health ethic, focused on population health. Many triage policies exist that fall under the legal protections afforded by “crisis standards of care,” but they have key differences. We critically appraise one of the most fundamental differences among policies, namely the use of criteria to categorically exclude (...) certain patients from eligibility for otherwise standard medical services. We examine these categorical exclusion criteria from ethical, legal, disability, and implementation perspectives. Focusing our analysis on the most common type of exclusion criteria, which are disease-specific, we conclude that optimal policies for critical care resource allocation and the use of cardiopulmonary resuscitation (CPR) should not use categorical exclusions. We argue that the avoidance of categorical exclusions is often practically feasible, consistent with public health norms, and mitigates discrimination against persons with disabilities. (shrink)

Category theory has become central to certain aspects of theoretical physics. Bain has recently argued that this has significance for ontic structural realism. We argue against this claim. In so doing, we uncover two pervasive forms of category-theoretic generalization. We call these ‘generalization by duality’ and ‘generalization by categorifying physical processes’. We describe in detail how these arise, and explain their significance using detailed examples. We show that their significance is two-fold: the articulation of high-level physical concepts, and the generation (...) of new models. 1 Introduction2 Categories and Structuralism 2.1 Categories: abstract and concrete 2.2 Structuralism: simple and ontic3 Bain’s Two Strategies 3.1 A first strategy for defending Objectless 3.2 A second strategy for defending Objectless4 Two Forms of Categorical Generalization 4.1 Generalization by duality 4.2 Generalization by categorification 4.3 The role of category theory in physics5 Conclusion. (shrink)

The primary concern of this paper is to outline an explanation of how Kant derives morality from reason. We all know that Kant thought that morality comprises a set of demands that are unconditionally and universally valid. In addition, he thought that to support this understanding of moral principles, one must show that they originate in reason a priori, rather than in contingent facts about human psychology, or the circumstances of human life. But do we really understand how he tries (...) to establish that moral principles originate in reason? In at least two passages in the second section of the Groundwork, Kant insists upon the importance of grounding the moral law in practical reason a priori, and subsequently states a conception of practical reason from which he appears to extract a formulation of the Categorical Imperative. The reasoning employed in these passages would appear to be of central importance to the overall argument of the Groundwork, but in each case the route travelled from the definition of practical reason to the ensuing formulation of the moral law is obscure. My goal is to work out a plausible reconstruction of this portion of Kant’s argument. At the very least, I hope that my interpretation will illuminate the distinctive structure of the Kantian approach to questions of justification in ethics. What I understand of Kant’s view leads me to believe that its aims and overall shape are different in important respects from what is often assumed. It also represents an approach to foundational issues in ethics, which provides an alternative to many contemporary attempts to ground morality in reason. (shrink)

A categorical structure suitable for interpreting polymorphic lambda calculus (PLC) is defined, providing an algebraic semantics for PLC which is sound and complete. In fact, there is an equivalence between the theories and the categories. Also presented is a definitional extension of PLC including "subtypes", for example, equality subtypes, together with a construction providing models of the extended language, and a context for Girard's extension of the Dialectica interpretation.