The categorical dualities presented are: (first) for the category of bi-algebraic lattices that belong to the variety generated by the smallest non-modular lattice with complete (0,1)-lattice homomorphisms as morphisms, and (second) for the category of non-trivial (0,1)-lattices belonging to the same variety with (0,1)-lattice homomorphisms as morphisms. Although the two categories coincide on their finite objects, the presented dualities essentially differ mostly but not only by the fact that the duality for the second category uses topology. Using the presented (...) dualities and some known in the literature results we prove that the Q-lattice of any non-trivial variety of (0,1)-lattices is either a 2-element chain or is uncountable and non-distributive. (shrink)

Finitely algebraizable deductive systems were introduced by Blok and Pigozzi to capture the essential properties of those deductive systems that are very tightly connected to quasivarieties of universal algebras. They include the equivalential logics of Czelakowski. Based on Blok and Pigozzi’s work, Herrmann defined algebraizable deductive systems. These are the equivalential deductive systems that are also truth-equational, in the sense that the truth predicate of the class of their reduced matrix models is explicitly definable by some set of unary equations. (...) Raftery undertook the task of characterizing the property of truth-equationality for arbitrary deductive systems. In this paper, following Raftery, we extend the notion of truth-equationality for logics formalized as $\pi$-institutions and abstract several of the results that hold for deductive systems in this more general categorical context. (shrink)

In [9] it is proved the categorical isomorphism of two varieties: bounded commutative BCK-algebras and MV -algebras. The class of MV -algebras is the algebraic counterpart of the infinite valued propositional calculus L of Lukasiewicz . The main objective of the present paper is to study that isomorphism from the perspective of logic. The B-C-K logic is algebraizable and the quasivariety of BCKalgebras is the equivalent algebraic semantics for that logic . We call commutative B-C-K logic, briefly cBCK, (...) to the extension of B-C-K logic associated to the variety of commutative BCK–algebras. Moreover, we present the extension Boc of cBCK obtained by adding the axiom of “boundness”. We prove that the deductive system Boc is equivalent to L. We observe that cBCK admits two interesting extensions: the logic Boc, treated in this paper, which is equivalent to the system L of Lukasiewicz, and the logic Co that is naturally associated to the system Balo of `-groups . This constructions establish a link between L and Balo , that would be a logical approach to the categorical relationship between MV–algebras and `-groups. (shrink)

Relatively congruence regular quasivarieties and quasivarieties of logic have noticeable similarities. The paper provides a unifying framework for them which extends the Blok-Pigozzi theory of elementarily algebraizable (and protoalgebraic) deductive systems. In this extension there are two parameters: a set of terms and a variable. When the former is empty or consists of theorems, the Blok-Pigozzi theory is recovered, and the variable is redundant. On the other hand, a class of membership logics is obtained when the variable is the only (...) element of the set of terms. For these systems the appropriate variant of equivalent algebraic semantics encompasses the relatively congruence regular quasivarieties. (shrink)

In this paper we show that the quasivariety generated by an infinite simple MV-algebra only depends on the rationals which it contains. We extend this property to arbitrary families of simple MV-algebras.

In this paper, we concentrate on finite quasivarieties (i.e. classes of finite algebras defined by quasi-identities). We present a motivation for studying finite quasivarieties. We introduce a new type of conditions that is well suited for defining finite quasivarieties and compare these new conditions with quasi-identities.

For quasivarieties of algebras, we consider the property of having definable relative principal subcongruences, a generalization of the concepts of definable relative principal congruences and definable principal subcongruences. We prove that a quasivariety of algebras with definable relative principal subcongruences has a finite quasiequational basis if and only if the class of its relative (finitely) subdirectly irreducible algebras is strictly elementary. Since a finitely generated relatively congruence-distributive quasivariety has definable relative principal subcongruences, we get a new proof of (...) the result due to D. Pigozzi: a finitely generated relatively congruence-distributive quasivariety has a finite quasi-equational basis. (shrink)

In this paper we study some questions concerning Łukasiewicz implication algebras. In particular, we show that every subquasivariety of Łukasiewicz implication algebras is, in fact, a variety. We also derive some characterizations of congruence permutable algebras. The starting point for these results is a representation of finite Łukasiewicz implication algebras as upwardly-closed subsets in direct products of MV-chains.

A quasivariety of algebras has the joint embedding property (JEP) if and only if it is generated by a single algebra A. It is structurally complete if and only if the free ℵ0‐generated algebra in can serve as A. A consequence of this demand, called ‘passive structural completeness’ (PSC), is that the nontrivial members of all satisfy the same existential positive sentences. We prove that if is PSC then it still has the JEP, and if it has the JEP (...) and its nontrivial members lack trivial subalgebras, then its relatively simple members all belong to the universal class generated by one of them. Under these conditions, if is relatively semisimple then it is generated by one ‐simple algebra. We also prove that a quasivariety of finite type, with a finite nontrivial member, is PSC if and only if its nontrivial members have a common retract. The theory is then applied to the variety of De Morgan monoids, where we isolate the sub(quasi)varieties that are PSC and those that have the JEP, while throwing fresh light on those that are structurally complete. The results illuminate the extension lattices of intuitionistic and relevance logics. (shrink)

In this paper, we give a classification of ℵ0-categorical coloured linear orders, generalizing Rosenstein's characterization of ℵ0-categorical linear orderings. We show that they can all be built from coloured singletons by concatenation and ℚn-combinations . We give a method using coding trees to describe all structures in our list.

Quasi-MV algebras are generalisations of MV algebras arising in quantum computational logic. Although a reasonably complete description of the lattice of subvarieties of quasi-MV algebras has already been provided, the problem of extending this description to the setting of quasivarieties has so far remained open. Given its apparent logical repercussions, we tackle the issue in the present paper. We especially focus on quasivarieties whose generators either are subalgebras of the standard square quasi-MV algebra S , or can be obtained therefrom (...) through the addition of some fixpoints for the inverse. (shrink)

The quasivariety of BCK-algebras is widely known and investigated class of algebras. It is a natural semantic for the BCK-logic but there are also others quasivarieties of algebras with the above property and there are even some varieties among them. The aim of this note is to bring to the reader’s a attention the lattice they form. In what follows we shall only consider classes of algebras of type.

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)

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 (...) class='Hi'>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)

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)

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)

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 and Zermelo’s quasi-categoricity (...) theorem for second-order —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)

Vann McGee has recently argued that Belnap’s criteria constrain the formal rules of classical natural deduction to uniquely determine the semantic values of the propositional logical connectives and quantifiers if the rules are taken to be open-ended, i.e., if they are truth-preserving within any mathematically possible extension of the original language. The main assumption of his argument is that for any class of models there is a mathematically possible language in which there is a sentence true in just those models. (...) I show that this assumption does not hold for the class of models of classical propositional logic. In particular, I show that the existence of non-normal models for negation undermines McGee’s argument. (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 paper describes the isomorphic lattices of quasivarieties of commutative quasigroup modes and of cancellative commutative binary modes. Each quasivariety is characterised by providing a quasi-equational basis. A structural description is also given. Both lattices are uncountable and distributive.

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)

In this paper we study some questions concerning Łukasiewicz implication algebras. In particular, we show that every subquasivariety of Łukasiewicz implication algebras is, in fact, a variety. We also derive some characterizations of congruence permutable algebras. The starting point for these results is a representation of finite Łukasiewicz implication algebras as upwardly-closed subsets in direct products of MV-chains.

Let FΛ be a finite dimensional path algebra of a quiver Λ over a field F. Let L and R denote the varieties of all left and right FΛ-modules respectively. We prove the equivalence of the following statements. • The subvariety lattice of L is a sublattice of the subquasivariety lattice of L. • The subquasivariety lattice of R is distributive. • Λ is an ordered forest.

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.

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)

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.

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)

Let \(\textbf{K}\) and \(\textbf{M}\) be locally finite quasivarieties of finite type such that \(\textbf{K}\subset \textbf{M}\). If \(\textbf{K}\) is profinite then the filter \([\textbf{K},\textbf{M}]\) in the quasivariety lattice \(\textrm{Lq}(\textbf{M})\) is an atomic lattice and \(\textbf{K}\) has an independent quasi-equational basis relative to \(\textbf{M}\). Applications of these results for lattices, unary algebras, groups, unary algebras, and distributive algebras are presented which concern some well-known problems on standard topological quasivarieties and other problems.

Kant has argued that moral requirements are categorical. Kant's claim has been challenged by some contemporary philosophers; this article defends Kant's doctrine. I argue that Kant's claim captures the unique feature of moral requirements. The main arguments against Kant's claim focus on one condition that a categorical imperative must meet: to be independent of desires. I argue that there is another important, but often ignored, condition that a categorical imperative must meet, and this second condition is crucial (...) to understanding why moral requirements are not hypothetical. I also argue that the claim that moral requirements are not categorical because they depend on desires for motivation is beside the point. The issue of whether moral requirements are categorical is not an issue about whether moral desires or feelings are necessary for moral motivation but are rather an issue about the ground of moral desires or moral feelings. Moral requirements are categorical because they are requirements of reason, and reason makes moral desires or feelings possible. (shrink)

Let S denote the variety of Sugihara algebras. We prove that the lattice (K) of subquasivarieties of a given quasivariety K S is finite if and only if K is generated by a finite set of finite algebras. This settles a conjecture by Tokarz [6]. We also show that the lattice (S) is not modular.

Husserl's two notions of "definiteness" enabled him to clarify the problem of imaginary numbers. The exact meaning of these notions is a topic of much controversy. A "definite" axiom system has been interpreted as a syntactically complete theory, and also as a categorical one. I discuss whether and how far these readings manage to capture Husserl's goal of elucidating the problem of imaginary numbers, raising objections to both positions. Then, I suggest an interpretation of "absolute definiteness" as semantic completeness (...) and argue that this notion does not suffice to explain Husserl's solution to the problem of imaginary numbers. (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.

ZusammenfassungIm Zuge des „empirical turn“ der Medizin- und Bioethik ist von verschiedenen Autoren in den vergangenen Jahren die Idee einer „evidenzbasierten Ethik“ diskutiert worden. Die Analogie zwischen evidenzbasierter Medizin und „evidenzbasierter Ethik“ soll in diesem Beitrag kritisch diskutiert und dabei gezeigt werden, dass der Ausdruck „evidenzbasierte Ethik“ irreführend ist. Zentraler Ausgangspunkt der Kritik ist die unterschiedliche Bedeutung, die empirische Informationen für das medizinisch-klinische Urteil zum einen und das ethische Urteil in der Medizin zum anderen haben. Im medizinisch-klinischen Urteil können mit (...) Hilfe empirischer Informationen hypothetische Handlungsnormen generiert werden, welche auf den der Medizin inhärenten Zwecksetzungen basieren. Bei Fragen der Ethik in der Medizin hingegen sind die Handlungsziele selbst Gegenstand des Urteils; diese aber können allein aus empirischem Wissen heraus nicht zureichend bestimmt werden. Die Diskussion um die Möglichkeit einer „evidenzbasierten Ethik“ eröffnet weiterhin aufschlussreiche Perspektiven in Bezug auf empirische Forschung und den Umgang mit empirischen Informationen in der Angewandten Ethik und das Aufgabenfeld der Medizinethik. (shrink)

We give an axiomatic framework for the non-modular simple 0-categorical structures constructed by Hrushovski. This allows us to verify some of their properties in a uniform way, and to show that these properties are preserved by iterations of the construction.

Based on existence equations, quasivarieties of heterogeneous partial algebras have the same algebraic description as those of total algebras. Because of the restriction of the valuations to the free variables of a formula — the usual reference to the needed variables e.g. for identities (in order to get useful and manageable results) is essentially replaced here by the use of the logical Craig projections — already varieties of heterogeneous partial algebras behave to some extent rather like quasivarieties than having the (...) properties known from varieties of total homogeneous algebras. It is one of the main aims of this note to make this more explicit. On the other hand we want to list several results known for quasivarieties of heterogeneous partial algebras — and adopt them to the extended signature — after having recalled the language and the main concepts necessary for the understanding of the results. (shrink)

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)

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)

Using the category of metric spaces as a template, we develop a metric analogue of the categorical semantics of classical/intuitionistic logic, and show that the natural notion of predicate in this “continuous semantics” is equivalent to the a priori separate notion of predicate in continuous logic, a logic which is independently well-studied by model theorists and which finds various applications. We show this equivalence by exhibiting the real interval $[0,1]$ in the category of metric spaces as a “continuous subobject (...) classifier” giving a correspondence not only between the two notions of predicate, but also between the natural notion of quantification in the continuous semantics and the existing notion of quantification in continuous logic.Along the way, we formulate what it means for a given category to behave like the category of metric spaces, and afterwards show that any such category supports the aforementioned continuous semantics. As an application, we show that categories of presheaves of metric spaces are examples of such, and in fact even possess continuous subobject classifiers. (shrink)

The paper addresses the capabilities and limitations of extrafoveal processing during a categorical visual search. Previous research has established that a target could be identified from the very first or without any saccade, suggesting that extrafoveal perception is necessarily involved. However, the limits in complexity defining the processed information are still not clear. We performed four experiments with a gradual increase of stimuli complexity to determine the role of extrafoveal processing in searching for the categorically defined geometric shape. The (...) series of experiments demonstrated a significant role of extrafoveal processing while searching for simple two‐dimensional shapes and its gradual decrease in a condition with more complicated three‐dimensional shapes. The factors of objects’ spatial orientation and distractor homogeneity significantly influenced both reaction time and the number of saccades required to identify a categorically defined target. An analysis of the individual p‐value distributions revealed pronounced individual differences in using extrafoveal analysis and allowed examination of the performance of each particular participant. The condition with the forced prohibition of eye movements enabled us to investigate the efficacy of covert attention in the condition with complicated shapes. Our results indicate that both foveal and extrafoveal processing are simultaneously involved during a categorical search, and the specificity of their interaction is determined by the spatial orientation of objects, type of distractors, the prohibition to use overt attention, and individual characteristics of the participants. (shrink)

Is the assimilation of these two formulations of the moral principle by Kant and some of his expositors justified? In the Analytic of Pure Practical Reason Kant claims that his view of morality agrees with the ancient command that man should love his neighbour as himself. Also in the Fundamental Principles of the Metaphysic of Morals he regards the Golden Rule as a deduction, though with several limitations, from the second version of the Categorical Imperative.

We argue that the basic notions of mathematics can only be properly formulated in an informal way. Mathematical notions transcend formalizations and their study involves the consideration of other mathematical notions. We explain the fundamental role of categoricity theorems in making these studies possible. We arrive at the conclusion that the enterprise of mathematics is not infallible and that it ultimately relies on degrees of evidence.

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].

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.

In this paper the author considers a number of objections to the views he expressed in "kant's examples of the first formulation of the categorical imperative" ("the philosophical quarterly", Volume 7, Number 26, January, 1973) by professor kemp in "kant's examples of the categorical imperative" ("the philosophical quarterly", Volume 8, Number 30, January, 1957) and does what he can to reply to them.