We construct a machine that knows its own code, at the price of not knowing its own factivity.

We argue that C. Darwin and more recently W. Hennig worked at times under the simplifying assumption of an eternal biosphere. So motivated, we explicitly consider the consequences which follow mathematically from this assumption, and the infinite graphs it leads to. This assumption admits certain clusters of organisms which have some ideal theoretical properties of species, shining some light onto the species problem. We prove a dualization of a law of T.A. Knight and C. Darwin, and sketch a decomposition result (...) involving the internodons of D. Kornet, J. Metz and H. Schellinx. A further goal of this paper is to respond to B. Sturmfels’ question, “Can biology lead to new theorems?”. (shrink)

We study the structure of families of theories in the language of arithmetic extended to allow these families to refer to one another and to themselves. If a theory contains schemata expressing its own truth and expressing a specific Turing index for itself, and contains some other mild axioms, then that theory is untrue. We exhibit some families of true self-referential theories that barely avoid this forbidden pattern.

Elementary patterns of resemblance notate ordinals up to the ordinal of Pi^1_1-CA_0. We provide ordinal multiplication and exponentiation algorithms using these notations.

Reinhardt’s conjecture, a formalization of the statement that a truthful knowing machine can know its own truthfulness and mechanicalness, was proved by Carlson using sophisticated structural results about the ordinals and transfinite induction just beyond the first epsilon number. We prove a weaker version of the conjecture, by elementary methods and transfinite induction up to a smaller ordinal.

We present a game mechanic called pseudo-visibility for games inhabited by non-player characters (NPCs) driven by reinforcement learning (RL). NPCs are incentivized to pretend they cannot see pseudo-visible players: the training environment simulates an NPC to determine how the NPC would act if the pseudo-visible player were invisible, and penalizes the NPC for acting differently. NPCs are thereby trained to selectively ignore pseudo-visible players, except when they judge that the reaction penalty is an acceptable tradeoff (e.g., a guard might accept (...) the penalty in order to protect a treasure because losing the treasure would hurt even more). We describe an RL agent transformation which allows RL agents that would not otherwise do so to perform some limited self-reflection to learn the training environments in question. (shrink)

Can an AGI create a more intelligent AGI? Under idealized assumptions, for a certain theoretical type of intelligence, our answer is: “Not without outside help”. This is a paper on the mathematical structure of AGI populations when parent AGIs create child AGIs. We argue that such populations satisfy a certain biological law. Motivated by observations of sexual reproduction in seemingly-asexual species, the Knight-Darwin Law states that it is impossible for one organism to asexually produce another, which asexually produces another, and (...) so on forever: that any sequence of organisms (each one a child of the previous) must contain occasional multi-parent organisms, or must terminate. By proving that a certain measure (arguably an intelligence measure) decreases when an idealized parent AGI single-handedly creates a child AGI, we argue that a similar Law holds for AGIs. (shrink)

Legg and Hutter, as well as subsequent authors, considered intelligent agents through the lens of interaction with reward-giving environments, attempting to assign numeric intelligence measures to such agents, with the guiding principle that a more intelligent agent should gain higher rewards from environments in some aggregate sense. In this paper, we consider a related question: rather than measure numeric intelligence of one Legg- Hutter agent, how can we compare the relative intelligence of two Legg-Hutter agents? We propose an elegant answer (...) based on the following insight: we can view Legg-Hutter agents as candidates in an election, whose voters are environments, letting each environment vote (via its rewards) which agent (if either) is more intelligent. This leads to an abstract family of comparators simple enough that we can prove some structural theorems about them. It is an open question whether these structural theorems apply to more practical intelligence measures. (shrink)

We define a notion of the intelligence level of an idealized mechanical knowing agent. This is motivated by efforts within artificial intelligence research to define real-number intelligence levels of compli- cated intelligent systems. Our agents are more idealized, which allows us to define a much simpler measure of intelligence level for them. In short, we define the intelligence level of a mechanical knowing agent to be the supremum of the computable ordinals that have codes the agent knows to be codes (...) of computable ordinals. We prove that if one agent knows certain things about another agent, then the former necessarily has a higher intelligence level than the latter. This allows our intelligence no- tion to serve as a stepping stone to obtain results which, by themselves, are not stated in terms of our intelligence notion (results of potential in- terest even to readers totally skeptical that our notion correctly captures intelligence). As an application, we argue that these results comprise evidence against the possibility of intelligence explosion (that is, the no- tion that sufficiently intelligent machines will eventually be capable of designing even more intelligent machines, which can then design even more intelligent machines, and so on). (shrink)

After generalizing the Archimedean property of real numbers in such a way as to make it adaptable to non-numeric structures, we demonstrate that the real numbers cannot be used to accurately measure non-Archimedean structures. We argue that, since an agent with Artificial General Intelligence (AGI) should have no problem engaging in tasks that inherently involve non-Archimedean rewards, and since traditional reinforcement learning rewards are real numbers, therefore traditional reinforcement learning probably will not lead to AGI. We indicate two possible ways (...) traditional reinforcement learning could be altered to remove this roadblock. (shrink)

We provide an intuitive motivation for the hyperreal numbers via electoral axioms. We do so in the form of a Socratic dialogue, in which Protagoras suggests replacing big-oh complexity classes by real numbers, and Socrates asks some troubling questions about what would happen if one tried to do that. The dialogue is followed by an appendix containing additional commentary and a more formal proof.

Do we live in a computer simulation? I will present an argument that the results of a certain experiment constitute empirical evidence that we do not live in, at least, one type of simulation. The type of simulation ruled out is very specific. Perhaps that is the price one must pay to make any kind of Popperian progress.

A fundamental question asked in modal logic is whether a given theory is consistent. But consistent with what? A typical way to address this question identifies a choice of background knowledge axioms (say, S4, D, etc.) and then shows the assumptions codified by the theory in question to be consistent with those background axioms. But determining the specific choice and division of background axioms is, at least sometimes, little more than tradition. This paper introduces generic theories for propositional modal logic (...) to address consistency results in a more robust way. As building blocks for background knowledge, generic theories provide a standard for categorical determinations of consistency. We argue that the results and methods of this paper help to elucidate problems in epistemology and enjoy sufficient scope and power to have purchase on problems bearing on modalities in judgement, inference, and decision making. (shrink)

One shortcoming of the chain rule is that it does not iterate: it gives the derivative of f(g(x)), but not (directly) the second or higher-order derivatives. We present iterated differentials and a version of the multivariable chain rule which iterates to any desired level of derivative. We first present this material informally, and later discuss how to make it rigorous (a discussion which touches on formal foundations of calculus). We also suggest a finite calculus chain rule (contrary to Graham, Knuth (...) and Patashnik's claim that "there's no corresponding chain rule of finite calculus"). (shrink)

We propose that, for the purpose of studying theoretical properties of the knowledge of an agent with Artificial General Intelligence (that is, the knowledge of an AGI), a pragmatic way to define such an agent’s knowledge (restricted to the language of Epistemic Arithmetic, or EA) is as follows. We declare an AGI to know an EA-statement φ if and only if that AGI would include φ in the resulting enumeration if that AGI were commanded: “Enumerate all the EA-sentences which you (...) know.” This definition is non-circular because an AGI, being capable of practical English communication, is capable of understanding the everyday English word “know” independently of how any philosopher formally defines knowledge; we elaborate further on the non-circularity of this circular-looking definition. This elegantly solves the problem that different AGIs may have different internal knowledge definitions and yet we want to study knowledge of AGIs in general, without having to study different AGIs separately just because they have separate internal knowledge definitions. Finally, we suggest how this definition of AGI knowledge can be used as a bridge which could allow the AGI research community to import certain abstract results about mechanical knowing agents from mathematical logic. (shrink)

Inspired by recent progress in multi-agent Reinforcement Learning (RL), in this work we examine the collective intelligent behaviour of theoretical universal agents by introducing a weighted mixture operation. Given a weighted set of agents, their weighted mixture is a new agent whose expected total reward in any environment is the corresponding weighted average of the original agents' expected total rewards in that environment. Thus, if RL agent intelligence is quantified in terms of performance across environments, the weighted mixture's intelligence is (...) the weighted average of the original agents' intelligences. This operation enables various interesting new theorems that shed light on the geometry of RL agent intelligence, namely: results about symmetries, convex agent-sets, and local extrema. We also show that any RL agent intelligence measure based on average performance across environments, subject to certain weak technical conditions, is identical (up to a constant factor) to performance within a single environment dependent on said intelligence measure. (shrink)

I present an argument that for any computer-simulated civilization we design, the mathematical knowledge recorded by that civilization has one of two limitations. It is untrustworthy, or it is weaker than our own mathematical knowledge. This is paradoxical because it seems that nothing prevents us from building in all sorts of advantages for the inhabitants of said simulation.

A variation of Fitch’s paradox is given, where no special rules of inference are assumed, only axioms. These axioms follow from the familiar assumptions which involve rules of inference. We show (by constructing a model) that by allowing that possibly the knower doesn’t know his own soundness (while still requiring he be sound), Fitch’s paradox is avoided. Provided one is willing to admit that sound knowers may be ignorant of their own soundness, this might offer a way out of the (...) paradox. (shrink)

We consider an extended notion of reinforcement learning in which the environment can simulate the agent and base its outputs on the agent's hypothetical behavior. Since good performance usually requires paying attention to whatever things the environment's outputs are based on, we argue that for an agent to achieve on-average good performance across many such extended environments, it is necessary for the agent to self-reflect. Thus weighted-average performance over the space of all suitably well-behaved extended environments could be considered a (...) way of measuring how self-reflective an agent is. We give examples of extended environments and introduce a simple transformation which experimentally seems to increase some standard RL agents' performance in a certain type of extended environment. (shrink)

In their thought-provoking paper, Legg and Hutter consider a certain abstrac- tion of an intelligent agent, and define a universal intelligence measure, which assigns every such agent a numerical intelligence rating. We will briefly summarize Legg and Hutter’s paper, and then give a tongue-in-cheek argument that if one’s goal is to become more intelligent by cultivating music appreciation, then it is bet- ter to use classical music (such as Bach, Mozart, and Beethoven) than to use more recent pop music. The (...) same argument could be adapted to other media: books beat films, card games beat first-person shooters, parables beat dissertations, etc. We leave it to the reader to decide whether this argument tells us something about classical music, something about Legg-Hutter intelligence, or something about both. (shrink)

Can you find an xy-equation that, when graphed, writes itself on the plane? This idea became internet-famous when a Wikipedia article on Tupper’s self-referential formula went viral in 2012. Under scrutiny, the question has two flaws: it is meaningless (it depends on fonts) and it is trivial. We fix these flaws by formalizing the problem.

Mathematicians and software developers use the word "function" very differently, and yet, sometimes, things that are in practice implemented using the software developer's "function", are mathematically formalized using the mathematician's "function". This mismatch can lead to inaccurate formalisms. We consider a special case of this meta-problem. Various kinds of agents might, in actual practice, make use of private memory, reading and writing to a memory-bank invisible to the ambient environment. In some sense, we humans do this when we silently subvocalize (...) thoughts about the actions we are taking (at least when the environment we're in is too primitive to probe the contents of our brains). Mathematical function formalizations of agents often ignore this ability. We show that in a general agent-environment framework (of which reinforcement learning is a special case), in a technical sense, such private memories do not enable qualitatively different agent behavior. (shrink)

In his dissertation, Wadge defined a notion of guessability on subsets of the Baire space and gave two characterizations of guessable sets. A set is guessable if and only if it is in the second ambiguous class, if and only if it is eventually annihilated by a certain remainder. We simplify this remainder and give a new proof of the latter equivalence. We then introduce a notion of guessing with an ordinal limit on how often one can change one’s mind. (...) We show that for every ordinal $\alpha$, a guessable set is annihilated by $\alpha$ applications of the simplified remainder if and only if it is guessable with fewer than $\alpha$ mind changes. We use guessability with fewer than $\alpha$ mind changes to give a semi-characterization of the Hausdorff difference hierarchy, and indicate how Wadge’s notion of guessability can be generalized to higher-order guessability, providing characterizations of ${\mathbf{\Delta}}^{0}_{\alpha}$ for all successor ordinals $\alpha\gt 1$. (shrink)

A suprise may occur if we use a similar strategy to the Liar's paradox to mathematically formalize "This sentence does not contain the symbol X".

A biologically unavoidable sequence is an infinite gender sequence which occurs in every gendered, infinite genealogical network satisfying certain tame conditions. We show that every eventually periodic sequence is biologically unavoidable (this generalizes König's Lemma), and we exhibit some biologically avoidable sequences. Finally we give an application of unavoidable sequences to cellular automata.

In their paper 'Reward is enough', Silver et al conjecture that the creation of sufficiently good reinforcement learning (RL) agents is a path to artificial general intelligence (AGI). We consider one aspect of intelligence Silver et al did not consider in their paper, namely, that aspect of intelligence involved in designing RL agents. If that is within human reach, then it should also be within AGI's reach. This raises the question: is there an RL environment which incentivises RL agents to (...) design RL agents? (shrink)

This is a paper about the general theory of measuring or estimating social intelligence via benchmarks. Hernández-Orallo and Dowe described a problem with certain proposed intelligence measures. The problem suggests that those intelligence measures might not accurately capture social intelligence. We argue that Hernández-Orallo and Dowe's problem is even more general than how they stated it, applying to many subdomains of AGI, not just the one subdomain in which they stated it. We then propose a solution. In our solution, instead (...) of using test-cases within the given AGI subdomain to estimate an AI's intelligence, one would use test-cases in an extended subdomain where test-cases have the ability to simulate the AI being tested. Surprisingly, AIs only designed for the original subdomain can be tested with test-cases in the extended subdomain anyway. By extending the subdomain in this way, we might avoid Hernández-Orallo and Dowe's problem. (shrink)

Internodons are a formalization of Hennig's concept of species. We present an alternative construction of internodons imposing a tree structure on the genealogical network. We prove that the segments (trivial unary trees) from this tree structure are precisely the internodons. We obtain the following spin-offs. First, the generated tree turns out to be an organismal tree of life. Second, this organismal tree is homeomorphic to the phylogenetic Hennigian species tree of life, implying the discovery of a multi-level tree of life: (...) this phylogenetic tree can be obtained by zooming out from the organismal tree, or conversely, the organismal tree of life can be generated by expanding the phylogenetic nodes into unary trees. Finally, the definition of the organismal tree allows an efficient algorithmic transformation of a given genealogical network into its corresponding phylogenetic species tree of life. The latter will be presented in a separate paper. (shrink)

We describe in our own words a visual phenomenon first described by Gallagher and Tsuchiya in 2020. The key to the phenomenon (as we describe it) is to direct one’s left eye at the image of one's left eye, while simultaneously directing one's right eye at the image of one's right eye. We suggest that one would naturally arrive at this phenomenon if one took a sufficiently literal reading of certain words of Socrates preserved in Plato's Alcibiades. We speculate that (...) perhaps Socrates was aware of the visual phenomenon in question. (shrink)

Fitch's Paradox and the Paradox of the Knower both make use of the Factivity Principle. The latter also makes use of a second principle, namely the Knowledge-of-Factivity Principle. Both the principle of factivity and the knowledge thereof have been the subject of various discussions, often in conjunction with a third principle known as Closure. In this paper, we examine the well-known Surprise Examination paradox considering both the principles on which this paradox rests and some formal characterisations of the surprise notion, (...) crucial in this paradox. Standard formalizations of the Surprise Examination paradox in modal logic do not seem, at first glance, to depend on either factivity or knowledge-of-factivity, but we will argue that both factivity and knowledge-of-factivity play a key implicit role in the paradox. Namely, they are implicitly, perhaps unintentionally, used in order to simplify the definition of surprise. We analyze modal logical formalizations of three versions of the paradox concluding that the Surprise Examination paradox is the result of two flaws: the assumption of knowledge-of-factivity, and the over-simplification of the definition of "surprise" accordingly. By fixing these two flaws, the Surprise Examination paradox vanishes. (shrink)

This essay examines Gloria Anzaldúa’s critical appropriation of two Mexican philosophers in the writing of Borderlands/La Frontera: Samuel Ramos and Octavio Paz. We argue that although neither of these authors is cited in her seminal work, Anzaldúa had them both in mind through the writing process and that their ideas are present in the text itself. Through a genealogical reading of Borderlands/La Frontera, and aided by archival research, we demonstrate how Anzaldúa’s philosophical vision of the “new mestiza” is a (...) critical continuation of the broader tradition known as la filosofía de lo mexicano, which flourished during a golden age of Mexican philosophy (1910–1960). Our aim is to open new directions in Latinx and Latin American philosophy by presenting Anzaldúa’s Borderlands/La Frontera as a profound scholarly encounter with two classic works of Mexican philosophy, Ramos’ Profile of Man and Culture in Mexico and Paz’s The Labyrinth of Solitude. (shrink)

Our paper examines Gloria Anzaldúa’s critical appropriation of Mexican philosophical sources, especially in the writing of Borderlands/La Frontera. We demonstrate how Anzaldúa developed a transnational Philosophy of Mexicanness, effectively contributing to what has been recently characterized as the “multi-generational project to pursue philosophy from and about Mexican circumstances” (Vargas). More specifically, we recover “La Mexicana en la Chicana” by paying careful attention to Anzaldúa’s Mexican sources, both those she explicitly cites and those we have discovered while conducting archival research using (...) the Gloria Evangelina Anzaldúa Papers from the Benson Latin American Collection at the University of Texas at Austin. The three sections of our paper: 1) define the terms Mexican and philosophy in conversation with Anzaldúa’s work, 2) examine the Mexican philosophical sources that Anzaldúa cites in Borderlands/La Frontera, and 3) present the other major Mexican philosophical influences on Anzaldúa that we have found in her archive. The eight Mexican philosophical sources we discuss here include: José Vasconcelos (1882-1959), Miguel León-Portilla (1926-2019), Juana Armanda Alegría (1938- ), Octavio Paz (1914-1998), Samuel Ramos (1897-1959), Rosario Castellanos (1925-1974), Sor Juana Inés de La Cruz (1648-1695), and Jorge Carrión (1913-2005). (shrink)

Samuel Alexander was a central figure of the new wave of realism that swept across the English-speaking world in the early twentieth century. His Space, Time, and Deity (1920a, 1920b) was taken to be the official statement of realism as a metaphysical system. But many historians of philosophy are quick to point out the idealist streak in Alexander’s thought. After all, as a student he was trained at Oxford in the late 1870s and early 1880s as British (...) Idealism was beginning to flourish. This naturally had some effect on his philosophical outlook and it is said that his early work is overtly idealist. In this paper I examine his neglected and understudied reactions to British Idealism in the 1880s. I argue that Alexander was not an idealist during this period and should not be considered as part of the British Idealist tradition, philosophically speaking. (shrink)

Samuel Alexander was one of the first realists of the twentieth century to defend a theory of categories. He thought that the categories are genuinely real and grounded in the intrinsic nature of Space-Time. I present his reduction of the categories in terms of Space-Time, articulate his account of categorial structure and completeness, and offer an interpretation of what he thought the nature of the categories really were. I then argue that his theory of categories has some advantages (...) over competing theories of his day, and finally draw some important lessons that we can learn from his realist yet reductionist theory of categories. (shrink)

Prior scholarly approaches to meaningful work have largely fallen into two camps. One focuses on identifying how work can contribute to a meaningful life. The other studies the antecedents and outcomes of workers experiencing their work as meaningful. Neither of these approaches, however, captures what people look for when they seek meaningful work—or so I argue. In this paper, I give a new, commitment-based account of meaningful work by focusing on the reasons people have to choose meaningful work over other (...) options. I draw on philosopher Ruth Chang’s account of voluntarist reasons (reasons that arise from an act of the will) to argue that commitments can create distinctive reasons to pursue certain work. It is the presence of these distinctive reasons that makes work meaningful. (shrink)

Decision theory has had a long-standing history in the behavioural and social sciences as a tool for constructing good approximations of human behaviour. Yet as artificially intelligent systems (AIs) grow in intellectual capacity and eventually outpace humans, decision theory becomes evermore important as a model of AI behaviour. What sort of decision procedure might an AI employ? In this work, I propose that policy-based causal decision theory (PCDT), which places a primacy on the decision-relevance of predictors and simulations of agent (...) behaviour, may be such a procedure. I compare this account to the recently-developed functional decision theory (FDT), which is motivated by similar concerns. I also address potentially counterintuitive features of PCDT, such as its refusal to condition on observations made at certain times. (shrink)

Can an agent's intelligence level be negative? We extend the Legg-Hutter agent-environment framework to include punishments and argue for an affirmative answer to that question. We show that if the background encodings and Universal Turing Machine (UTM) admit certain Kolmogorov complexity symmetries, then the resulting Legg-Hutter intelligence measure is symmetric about the origin. In particular, this implies reward-ignoring agents have Legg-Hutter intelligence 0 according to such UTMs.

In 2011, Hibbard suggested an intelligence measure for agents who compete in an adversarial sequence prediction game. We argue that Hibbard’s idea should actually be considered as two separate ideas: first, that the intelligence of such agents can be measured based on the growth rates of the runtimes of the competitors that they defeat; and second, one specific (somewhat arbitrary) method for measuring said growth rates. Whereas Hibbard’s intelligence measure is based on the latter growth-rate-measuring method, we survey other methods (...) for measuring function growth rates, and exhibit the resulting Hibbard-like intelligence measures and taxonomies. Of particular interest, we obtain intelligence taxonomies based on Big-O and Big-Theta notation systems, which taxonomies are novel in that they challenge conventional notions of what an intelligence measure should look like. We discuss how intelligence measurement of sequence predictors can indirectly serve as intelligence measurement for agents with Artificial General Intelligence (AGIs). (shrink)

Achieving space situational awareness requires, at a minimum, the identification, characterization, and tracking of space objects. Leveraging the resultant space object data for purposes such as hostile threat assessment, object identification, and conjunction assessment presents major challenges. This is in part because in characterizing space objects we reference a variety of identifiers, components, subsystems, capabilities, vulnerabilities, origins, missions, orbital elements, patterns of life, operational processes, operational statuses, and so forth, which tend to be defined in highly heterogeneous and sometimes inconsistent (...) ways. The Space Domain Ontologies are designed to provide a consensus-based realist framework for formulating such characterizations in a way that is both consistent and computable. Space object data are aligned with classes and relations in a suite of ontologies built around the existing Space Object Ontology. They are stored in a dynamically updated Resource Description Framework triple store, which can be queried to support space situational awareness and the needs of spacecraft operators and analysts. This paper provides an overview of the Space Domain Ontologies and their development and use. It presents the motivation for and advantages of the Space Domain Ontologies, including the benefits they provide for enhancing and maintaining long-term space situational awareness. (shrink)

I argue that Hubert Dreyfus’ work on embodied coping, the intentional arc, solicitations and the background as well as his anti-representationalism rest on introspection. I denote with ‘introspection’ the methodological malpractice of formulating ontological statements about the conditions of possibility of phenomena merely based on descriptions. In order to illustrate the insufficiencies of Dreyfus’ methodological strategy in particular and introspection in general, I show that Heidegger, to whom Dreyfus constantly refers as the foundation of his own work, derives ontological statements (...) about the conditions of possibility of phenomena not merely from descriptions, but also from analyses. I further show that deriving ontological statements directly from descriptions entails implausible results. I do so by discussing representative cases. Based on these general methodological considerations, I show that Dreyfus’ work on action, skill and understanding is introspective. First, I demonstrate that Dreyfus’ influential claim that rules and representations do not govern skillful actions is the result of introspection, because it is merely founded on the absence of rules and representations in representative descriptions of skillful actions. Second, I show that Dreyfus’ work on embodied coping, the intentional arc, solicitations and the background is also based on introspection. These ontological structures are merely reifications of descriptions and are not further substantiated by analyses. (shrink)

Despite the frequency of stillbirths, the subsequent implications are overlooked and underappreciated. We present findings from comprehensive, systematic literature reviews, and new analyses of published and unpublished data, to establish the effect of stillbirth on parents, families, health-care providers, and societies worldwide. Data for direct costs of this event are sparse but suggest that a stillbirth needs more resources than a livebirth, both in the perinatal period and in additional surveillance during subsequent pregnancies. Indirect and intangible costs of stillbirth are (...) extensive and are usually met by families alone. This issue is particularly onerous for those with few resources. Negative effects, particularly on parental mental health, might be moderated by empathic attitudes of care providers and tailored interventions. The value of the baby, as well as the associated costs for parents, families, care providers, communities, and society, should be considered to prevent stillbirths and reduce associated morbidity. (shrink)

Joint attention is a social-cognitive phenomenon in which two or more agents direct their attention together towards the same object. Definitions range from this rather broad conception to more specific definitions which require that, in addition, attention be directed to the same aspect of that object and that agents need to be mutually aware of their jointly attending. Joint attention is an important coordination mechanism in joint action. The capacity for engaging in joint attention, in particular in the sense of (...) this narrower definition, is frequently taken to indicate the presence of theory of mind in the participating agents, and is also implicated in the development of theory of mind. However, the prominence of sensorimotor components in establishing and sustaining episodes of joint attention — e.g., eye and head movements, pointing and vocalizations — suggests that sensorimotor approaches to social interaction may be well-placed to account for important parts of joint attention without invoking theory-of-mind abilities, and may therefore provide a valuable alternative to approaches emphasizing theory of mind. In particular, sensorimotor accounts may explain aspects of joint attention through the dynamics and regularities in the sensorimotor processes that coordinate the activities of the agents. (shrink)

In ‘Excusing Mistakes of Law’, Gideon Yaffe sets out to ‘vindicate’ the claim ‘that mistakes of law never excuse’ by ‘identifying the truth that is groped for but not grasped by those who assert that ignorance of law is no excuse’. Yaffe does not offer a defence of the claim that mistakes of law never excuse. That claim, Yaffe argues, is false. Yaffe’s article is, rather, an effort to assess what plausible thought might be behind the idea that mistakes of (...) law often should not excuse. (Yaffe is interested in more than just the descriptive claim that in Anglo-American legal jurisdictions mistakes of law routinely do not, in fact, excuse.) More particularly, Yaffe is interested in what plausible normative justification there might be for this asymmetric pattern: -/- Asymmetry: False beliefs about non-legal facts often excuse, but false beliefs about the law rarely excuse. -/- Yaffe offers a complex argument in support of Asymmetry. This paper is organised around my reconstruction of Yaffe’s argument. I argue that Yaffe’s argument does not succeed, but that his argument provides a template for an argument that could succeed. (shrink)

I provide a theory of the metaphysical foundations of identity: an account what grounds facts of the form a=b. In particular, I defend the claim that indiscernibility grounds identity. This is typically rejected because it is viciously circular; plausible assumptions about the logic of ground entail that the fact that a=b partially grounds itself. The theory I defend is immune to this circularity.

Many take Kantian ethics to founder when it comes to our duties to animals. In this paper, I advocate a novel approach to this problem. The paper is divided into three sections. In the first, I canvass various passages from Kant in order to set up the problem. In the second, I introduce a novel approach to this problem. In the third, I defend my approach from various objections. By way of preview: I advocate rejecting the premise that nonhuman animals (...) are nonrational. (shrink)