The Reeh-Schlieder theorem asserts the vacuum and certain other states to be spacelike superentangled relative to local fields. This motivates an inquiry into the physical status of various concepts of localization. It is argued that a covariant generalization of Newton-Wigner localization is a physically illuminating concept. When analyzed in terms of nonlocally covariant quantum fields, creating and annihilating quanta in Newton-Wigner localized states, the vacuum is seen to not possess the spacelike superentanglement that the Reeh-Schlieder (...) theorem displays relative to local fields, and to be locally empty as well as globally empty. Newton-Wigner localization is then shown to be physically interpretable in terms of a covariant generalization of the center of energy, the two localizations being identical if the system has no internal angular momentum. Finally, some of the counterintuitive features of Newton-Wigner localization are shown to have close analogues in classical special relativity. (shrink)

Many of the "counterintuitive" features of relativistic quantum field theory have their formal root in the Reeh-Schlieder theorem, which in particular entails that local operations applied to the vacuum state can produce any state of the entire field. It is of great interest then that I.E. Segal and, more recently, G. Fleming (in a paper entitled "Reeh-Schlieder meets Newton-Wigner") have proposed an alternative "Newton-Wigner" localization scheme that avoids the Reeh-Schlieder theorem. In this (...) paper, I reconstruct the Newton-Wigner localization scheme and clarify the <em>limited</em> extent to which it avoids the counterintuitive consequences of the Reeh-Schlieder theorem. I also argue that there is no coherent interpretation of the Newton-Wigner localization scheme that renders it free from act-outcome correlations at spacelike separation. (shrink)

The Reeh-Schlieder theorem asserts the vacuum and certain other states to be spacelike superentangled relative to local quantum fields. This motivates an inquiry into the physical status of various concepts of localization. It is argued that a covariant generalization of Newton-Wigner localization is a physically illuminating concept. When analyzed in terms of nonlocally covariant quantum fields, creating and annihilating quanta in Newton-Wigner localized states, the vacuum is seen to not possess the spacelike superentanglement that the Reeh- (...) class='Hi'>Schlieder theorem displays relative to local fields, and to be locally empty as well as globally empty. Newton-Wigner localization is then shown to be physically interpretable in terms of a covariant generalization of the center of energy, the two localizations being identical if the system has no internal angular momentum. Finally, some of the counterintuitive features of Newton-Wigner localization are shown to have close analogues in classical special relativity. (shrink)

Remote state preparation is generation of a desired state by a remote observer. In spite of causality, it is well known, according to the Reeh–Schlieder theorem, that it is possible for relativistic quantum field theories, and a “physical” process achieving this task, involving superoscillatory functions, has recently been introduced. In this work we deal with non-relativistic fields, and show that remote state preparation is also possible for them, hence obtaining a Reeh–Schlieder-like result for general fields. (...) Interestingly, in the nonrelativistic case, the process may rely on completely different resources than the ones used in the relativistic case. (shrink)

This essay touches on a number of topics in philosophy of quantum field theory from the point of view of the LSZ asymptotic approach to scattering theory. First, particle/field duality is seen to be a property of free field theory and not of interacting QFT. Second, it is demonstrated how LSZ side-steps the implications of Haag's theorem. Finally, a recent argument due to Redhead, Malament and Arageorgis against the concept of localized particle states is addressed. Briefly, the argument observes (...) that the Reeh-Schlieder theorem entails that correlations between spacelike separated vacuum expectation values of local field operators are always present, and this, according to the above authors, dictates against the notion of a localized particle state. I claim that this moral is excessive and that a coherent notion of localized particles is given by the LSZ approach. The underlying moral to be drawn from this analysis is that questions concerning the ontology of interacting QFT cannot be appropriately addressed if one restricts oneself to the free theory. (shrink)

In this work we try to study theories of causation based upon causal processes and causal interactions in the context of classical and quantum physics. Our central aim is to find out whether such causal theories are compatible with the world picture suggested by contemporary theories of physics. In the first part, we review, compare and try to place among more general taxonomical schemes, the causal theories by Russell (the causal lines approach), Reichenbach (mark method, probabilistic causality and the principle (...) of common cause), Salmon (mark method, structure, invariant and conserved quantities approaches) and Dowe (conserved quantity theory). In the second part of the work, we deal with some problems that process theories of causation face whenever one tries to define, rigorously, causal concepts (e.g. “causal process” or “conjunctive common cause”) in the context of classical relativistic physical theories (van Dam – Wigner particle theory, the free Klein-Gordon field, classical electromagnetic theory) as well as quantum theories (algebraic relativistic quantum field theory). In this vein, special attention has been given to the locality problem in physical theories as it emerges from the structure of local classical the quantum theories (semantic locality), the relation between global and local conditions for physical systems (global and local determinism) as well as the problem of action at a distance, which is of central importance for the theories of causation under examination (Bell’s inequalities, EPR paradox, Reeh-Schlieder theorem and local independence conditions). We argue for three different theses: first, there are physical theories in the context of which it is impossible even to formulate the necessary physical hypotheses that allow us to define basic causal concepts and causal principles; second, there are physical theories which allow us to formulate these hypotheses only ad hoc; finally, in some cases it is necessary to revise basic causal principles and concepts bequeathed by the philosophical tradition. (shrink)

According to a Received View, relativistic quantum field theories (RQFTs) do not admit particle interpretations. This view requires that particles be localizable and countable, and that these characteristics be given mathematical expression in the forms of local and unique total number operators. Various results (the Reeh-Schlieder theorem, the Unruh Effect, Haag's theorem) then indicate that formulations of RQFTs do not support such operators. These results, however, do not hold for nonrelativistic QFTs. I argue that this is (...) due to the absolute structure of the classical spacetimes associated with such theories. This suggests that the intuitions that underlie the Received View are non-relativistic. Thus, to the extent that such intuitions are inappropriate in the relativistic context, they should be abandoned when it comes to interpreting RQFTs. (shrink)

Debates over the significance of the particle concept, and the problem of locality-how do we represent localized phenomena?-appear to presuppose that particles and observed phenomena are things rather than events. Well-known theorems (Hergerfelt, Reeh-Schlieder), and a recent variant of Hergerfelt's theorem due to David Malement, present a problem of locality only given the tacit appeal to the concept of thing, in fact an individual, in a sense contrary to particle indistinguishability. There is no difficulty with the particle (...) concept per se, but it is a global construction more than one step removed from events actually observed, which are represented by local integrals over self-adjoint field densities. (shrink)

Reality has become an increasingly prominent topic in contemporary philosophy. The book’s contributors are responding to the challenge to use the philosophically underexplored potential of film to disclose what the editors propose to call “the real of reality.”.

This article considers film as a form of artificial intelligence (AI). This non-anthropocentric hypothesis was first formulated in 1946 by filmmaker and theorist Jean Epstein and regards film as the thinking performance of a technical apparatus, the cinematograph, which is a manifestation of machine thinking based on the holistic entanglement of thought and world, film and philosophy. The article pursues an enquiry into ‘thinking’: one of the most prominent and oldest topics considered in philosophy, and also essential to art and (...) film. Thinking is not only characterised as a sense (like sight or taste) but as a creative and, ultimately, intra-active act. The possibility of film as AI is approached not only from a Deleuzian angle, long appraised by film-philosophy, but also through questions recently raised by theories of artistic research and the speculative-materialist turn in contemporary philosophy. The latter have as a common denominator a strong critique of anthropocentrism in Western philosophy; the article enquires into this criticism from different angles and applies it to the main hypothesis of this analysis – to regard film as a form of AI. (shrink)

In contrast to Pylyshyn's view, there is no such thing as “reasoning in general.” Different types of reasoning tasks are solved with different reasoning strategies. A more specific null hypothesis is that spatial inference with mental images involves the same representational formalism as that of spatial inference with mental models. There is no evidence that this hypothesis must be rejected.

Often, when one faces a choice between alternative actions, there are reasons both for and against each alternative. On one way of understanding these words, what one “ought to do all things considered (ATC)” is determined by the totality of these reasons. So, these reasons can somehow be “combined” or “aggregated” to yield an ATC verdict on these alternatives. First, various assumptions about this sort of aggregation of reasons are articulated. Then it is shown that these assumptions allow for the (...) proof of a “Reasons Aggregation Theorem” – parallel to John Harsanyi’s 1955 “Social Aggregation Theorem”. All reasons for action are grounded in reason-providing values; and, for every such reason-providing value, there is in principle a way of measuring how strongly this value counts against each alternative. The theorem tells us that the appropriate measure of how much reason ATC there is against each alternative is simply a weighted sum of the strengths with which these values count against that alternative; the agent ought not ATC to perform an action iff there is ATC more reason against it than against some available alternative. (shrink)

There is a theorem that shows that it is impossible for an algorithm to jointly satisfy the statistical fairness criteria of Calibration and Equalised Odds non-trivially. But what about the recently advocated alternative to Calibration, Base Rate Tracking? Here, we show that Base Rate Tracking is strictly weaker than Calibration, and then take up the question of whether it is possible to jointly satisfy Base Rate Tracking and Equalised Odds in non-trivial scenarios. We show that it is not, thereby (...) establishing an even more general impossibility theorem. (shrink)

Kurt Godel, the greatest logician of our time, startled the world of mathematics in 1931 with his Theorem of Undecidability, which showed that some statements in mathematics are inherently "undecidable." His work on the completeness of logic, the incompleteness of number theory, and the consistency of the axiom of choice and the continuum theory brought him further worldwide fame. In this introductory volume, Raymond Smullyan, himself a well-known logician, guides the reader through the fascinating world of Godel's incompleteness theorems. (...) The level of presentation is suitable for anyone with a basic acquaintance with mathematical logic. As a clear, concise introduction to a difficult but essential subject, the book will appeal to mathematicians, philosophers, and computer scientists. (shrink)

We are going to prove a key theorem that tells us just a bit more about the structure of the non-standard countable models of first-order Peano Arithmetic; and then we will very briefly consider whether any broadly philosophical morals can be drawn from the technical result.

Representation theorems are often taken to provide the foundations for decision theory. First, they are taken to characterize degrees of belief and utilities. Second, they are taken to justify two fundamental rules of rationality: that we should have probabilistic degrees of belief and that we should act as expected utility maximizers. We argue that representation theorems cannot serve either of these foundational purposes, and that recent attempts to defend the foundational importance of representation theorems are unsuccessful. As a result, we (...) should reject these claims, and lay the foundations of decision theory on firmer ground. (shrink)

Jury theorems are mathematical theorems about the ability of collectives to make correct decisions. Several jury theorems carry the optimistic message that, in suitable circumstances, ‘crowds are wise’: many individuals together (using, for instance, majority voting) tend to make good decisions, outperforming fewer or just one individual. Jury theorems form the technical core of epistemic arguments for democracy, and provide probabilistic tools for reasoning about the epistemic quality of collective decisions. The popularity of jury theorems spans across various disciplines such (...) as economics, political science, philosophy, and computer science. This entry reviews and critically assesses a variety of jury theorems. It first discusses Condorcet's initial jury theorem, and then progressively introduces jury theorems with more appropriate premises and conclusions. It explains the philosophical foundations, and relates jury theorems to diversity, deliberation, shared evidence, shared perspectives, and other phenomena. It finally connects jury theorems to their historical background and to democratic theory, social epistemology, and social choice theory. (shrink)

We give a review and critique of jury theorems from a social-epistemology perspective, covering Condorcet’s (1785) classic theorem and several later refinements and departures. We assess the plausibility of the conclusions and premises featuring in jury theorems and evaluate the potential of such theorems to serve as formal arguments for the ‘wisdom of crowds’. In particular, we argue (i) that there is a fundamental tension between voters’ independence and voters’ competence, hence between the two premises of most jury theorems; (...) (ii) that the (asymptotic) conclusion that ‘huge groups are infallible’, reached by many jury theorems, is an artifact of unjustified premises; and (iii) that the (nonasymptotic) conclusion that ‘larger groups are more reliable’, also reached by many jury theorems, is not an artifact and should be regarded as the more adequate formal rendition of the ‘wisdom of crowds’. (shrink)

The representation theorems of expected utility theory show that having certain types of preferences is both necessary and sufficient for being representable as having subjective probabilities. However, unless the expected utility framework is simply assumed, such preferences are also consistent with being representable as having degrees of belief that do not obey the laws of probability. This fact shows that being representable as having subjective probabilities is not necessarily the same as having subjective probabilities. Probabilism can be defended on the (...) basis of the representation theorems only if attributions of degrees of belief are understood either antirealistically or purely qualitatively, or if the representation theorems are supplemented by arguments based on other considerations (simplicity, consilience, and so on) that single out the representation of a person as having subjective probabilities as the only true representation of the mental state of any person whose preferences conform to the axioms of expected utility theory. (shrink)

This paper introduces Agreement Theorems to dynamic-epistemic logic. We show first that common belief of posteriors is sufficient for agreement in epistemic-plausibility models, under common and well-founded priors. We do not restrict ourselves to the finite case, showing that in countable structures the results hold if and only if the underlying plausibility ordering is well-founded. We then show that neither well-foundedness nor common priors are expressible in the language commonly used to describe and reason about epistemic-plausibility models. The static agreement (...) result is, however, finitely derivable in an extended modal logic. We provide the full derivation. We finally consider dynamic agreement results. We show they have a counterpart in epistemic-plausibility models, and provide a new form of agreements via public announcements. (shrink)

Textbook on Gödel’s incompleteness theorems and computability theory, based on the Open Logic Project. Covers recursive function theory, arithmetization of syntax, the first and second incompleteness theorem, models of arithmetic, second-order logic, and the lambda calculus.

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

Peer review is often taken to be the main form of quality control on academic research. Usually journals carry this out. However, parts of maths and physics appear to have a parallel, crowd-sourced model of peer review, where papers are posted on the arXiv to be publicly discussed. In this paper we argue that crowd-sourced peer review is likely to do better than journal-solicited peer review at sorting papers by quality. Our argument rests on two key claims. First, crowd-sourced peer (...) review will lead on average to more reviewers per paper than journal-solicited peer review. Second, due to the wisdom of the crowds, more reviewers will tend to make better judgments than fewer. We make the second claim precise by looking at the Condorcet Jury Theorem as well as two related jury theorems developed specifically to apply to peer review. (shrink)

A splitting of an r.e. set A is a pair A1, A2 of disjoint r.e. sets such that A1 A2 = A. Theorems about splittings have played an important role in recursion theory. One of the main reasons for this is that a splitting of A is a decomposition of A in both the lattice, , of recursively enumerable sets and in the uppersemilattice, R, of recursively enumerable degrees . Thus splitting theor ems have been used to obtain results about (...) the structure of , the structure of R, and the relationship between the two structures. Furthermore it is fair to say that questions about splittings have often generated important new technical developments in recursion theory. In this article we survey most of the results and techniques associated with splitting properties of r.e. sets in ordinary recursion theory. (shrink)

It is well known that classical propositional logic can be interpreted in intuitionistic propositional logic. In particular Glivenko's theorem states that a formula is provable in the former iff its double negation is provable in the latter. We extend Glivenko's theorem and show that for every involutive substructural logic there exists a minimum substructural logic that contains the first via a double negation interpretation. Our presentation is algebraic and is formulated in the context of residuated lattices. In the (...) last part of the paper, we also discuss some extended forms of the Kolmogorov translation and we compare it to the Glivenko translation. (shrink)

There is an extensive literature in social choice theory studying the consequences of weakening the assumptions of Arrow's Impossibility Theorem. Much of this literature suggests that there is no escape from Arrow-style impossibility theorems unless one drastically violates the Independence of Irrelevant Alternatives (IIA). In this paper, we present a more positive outlook. We propose a model of comparing candidates in elections, which we call the Advantage-Standard (AS) model. The requirement that a collective choice rule (CCR) be rationalizable by (...) the AS model is in the spirit of but weaker than IIA; yet it is stronger than what is known in the literature as weak IIA (two profiles alike on x, y cannot have opposite strict social preferences on x and y). In addition to motivating violations of IIA, the AS model makes intelligible violations of another Arrovian assumption: the negative transitivity of the strict social preference relation P. While previous literature shows that only weakening IIA to weak IIA or only weakening negative transitivity of P to acyclicity still leads to impossibility theorems, we show that jointly weakening IIA to AS rationalizability and weakening negative transitivity of P leads to no such impossibility theorems. Indeed, we show that several appealing CCRs are AS rationalizable, including even transitive CCRs. (shrink)

This paper begins with a puzzle regarding Lewis' theory of radical interpretation. On the one hand, Lewis convincingly argued that the facts about an agent's sensory evidence and choices will always underdetermine the facts about her beliefs and desires. On the other hand, we have several representation theorems—such as those of (Ramsey 1931) and (Savage 1954)—that are widely taken to show that if an agent's choices satisfy certain constraints, then those choices can suffice to determine her beliefs and desires. In (...) this paper, I will argue that Lewis' conclusion is correct: choices radically underdetermine beliefs and desires, and representation theorems provide us with no good reasons to think otherwise. Any tension with those theorems is merely apparent, and relates ultimately to the difference between how 'choices' are understood within Lewis' theory and the problematic way that they're represented in the context of the representation theorems. For the purposes of radical interpretation, representation theorems like Ramsey's and Savage's just aren't very relevant after all. (shrink)

Any intermediate propositional logic can be extended to a calculus with epsilon- and tau-operators and critical formulas. For classical logic, this results in Hilbert’s $\varepsilon $ -calculus. The first and second $\varepsilon $ -theorems for classical logic establish conservativity of the $\varepsilon $ -calculus over its classical base logic. It is well known that the second $\varepsilon $ -theorem fails for the intuitionistic $\varepsilon $ -calculus, as prenexation is impossible. The paper investigates the effect of adding critical $\varepsilon $ (...) - and $\tau $ -formulas and using the translation of quantifiers into $\varepsilon $ - and $\tau $ -terms to intermediate logics. It is shown that conservativity over the propositional base logic also holds for such intermediate ${\varepsilon \tau }$ -calculi. The “extended” first $\varepsilon $ -theorem holds if the base logic is finite-valued Gödel–Dummett logic, and fails otherwise, but holds for certain provable formulas in infinite-valued Gödel logic. The second $\varepsilon $ -theorem also holds for finite-valued first-order Gödel logics. The methods used to prove the extended first $\varepsilon $ -theorem for infinite-valued Gödel logic suggest applications to theories of arithmetic. (shrink)

We systematically study conservation theorems on theories of semi-classical arithmetic, which lie in-between classical arithmetic $\mathsf {PA}$ and intuitionistic arithmetic $\mathsf {HA}$. Using a generalized negative translation, we first provide a structured proof of the fact that $\mathsf {PA}$ is $\Pi _{k+2}$ -conservative over $\mathsf {HA} + {\Sigma _k}\text {-}\mathrm {LEM}$ where ${\Sigma _k}\text {-}\mathrm {LEM}$ is the axiom scheme of the law-of-excluded-middle restricted to formulas in $\Sigma _k$. In addition, we show that this conservation theorem is optimal in (...) the sense that for any semi-classical arithmetic T, if $\mathsf {PA}$ is $\Pi _{k+2}$ -conservative over T, then ${T}$ proves ${\Sigma _k}\text {-}\mathrm {LEM}$. In the same manner, we also characterize conservation theorems for other well-studied classes of formulas by fragments of classical axioms or rules. This reveals the entire structure of conservation theorems with respect to the arithmetical hierarchy of classical principles. (shrink)

Along the same line as that in Ono (Ann Pure Appl Logic 161:246–250, 2009), a proof-theoretic approach to Glivenko theorems is developed here for substructural predicate logics relative not only to classical predicate logic but also to arbitrary involutive substructural predicate logics over intuitionistic linear predicate logic without exponentials QFLe. It is shown that there exists the weakest logic over QFLe among substructural predicate logics for which the Glivenko theorem holds. Negative translations of substructural predicate logics are studied by (...) using the same approach. First, a negative translation, called extended Kuroda translation is introduced. Then a translation result of an arbitrary involutive substructural predicate logics over QFLe is shown, and the existence of the weakest logic is proved among such logics for which the extended Kuroda translation works. They are obtained by a slight modification of the proof of the Glivenko theorem. Relations of our extended Kuroda translation with other standard negative translations will be discussed. Lastly, algebraic aspects of these results will be mentioned briefly. In this way, a clear and comprehensive understanding of Glivenko theorems and negative translations will be obtained from a substructural viewpoint. (shrink)

Bayes' Theorem is a simple mathematical formula used for calculating conditional probabilities. It figures prominently in subjectivist or Bayesian approaches to epistemology, statistics, and inductive logic. Subjectivists, who maintain that rational belief is governed by the laws of probability, lean heavily on conditional probabilities in their theories of evidence and their models of empirical learning. Bayes' Theorem is central to these enterprises both because it simplifies the calculation of conditional probabilities and because it clarifies significant features of subjectivist (...) position. Indeed, the Theorem's central insight — that a hypothesis is confirmed by any body of data that its truth renders probable — is the cornerstone of all subjectivist methodology. (shrink)

The standard representation theorem for expected utility theory tells us that if a subject’s preferences conform to certain axioms, then she can be represented as maximising her expected utility given a particular set of credences and utilities—and, moreover, that having those credences and utilities is the only way that she could be maximising her expected utility. However, the kinds of agents these theorems seem apt to tell us anything about are highly idealised, being always probabilistically coherent with infinitely precise (...) degrees of belief and full knowledge of all a priori truths. Ordinary subjects do not look very rational when compared to the kinds of agents usually talked about in decision theory. In this paper, I will develop an expected utility representation theorem aimed at the representation of those who are neither probabilistically coherent, logically omniscient, nor expected utility maximisers across the board—that is, agents who are frequently irrational. The agents in question may be deductively fallible, have incoherent credences, limited representational capacities, and fail to maximise expected utility for all but a limited class of gambles. (shrink)

We prove covering theorems for K, where K is the core model below the sharp for a strong cardinal, and give an application to stationary set reflection.

Two partition-theorems are proved for a particular causal decision theory. One is restricted to a certain kind of partition of circumstances, and analyzes the utility of an option in terms of its utilities in conjunction with circumstances in this partition. The other analyzes an option's utility in terms of its utilities conditional on circumstances and is quite unrestricted. While the first form seems more useful for applications, the second form may be of theoretical importance in foundational exercises. Comparisons are made (...) with theorems of Richard Jeffrey, Brad Armendt, and Peter Fishburn. (shrink)

Here’s one version G¨ odel’s 1931 First Incompleteness Theorem: If T is a nice, sound theory of arithmetic, then it is incomplete, i.e. there are arithmetical sentences ϕ such that T proves neither ϕ nor ¬ϕ. There are three things here to explain straight away.

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

Contemporary decision theory places crucial emphasis on a family of mathematical results called representation theorems, which relate criteria for evaluating the available options to axioms pertaining to the decision-maker’s preferences. Various claims have been made concerning the reasons for the importance of these results. The goal of this article is to assess their semantic role: representation theorems are purported to provide definitions of the decision-theoretic concepts involved in the evaluation criteria. In particular, this claim shall be examined from the perspective (...) of philosophical theories of the meaning of theoretical terms. (shrink)

Linnebo and Shapiro have recently given an analysis of potential infinity using modal logic. A key technical component of their account is to show that under a suitable translation ◊ of nonmodal language into modal language, nonmodal sentences ϕ 1, …, ϕ n entail ψ just in case ϕ 1 ◊, …, ϕ n ◊ entail ψ ◊ in the modal logic S4.2. Linnebo and Shapiro establish this result in nonfree logic. In this note I argue that their analysis of (...) potential infinity should be carried out in a free logic. I then extend their key theorems to the setting of negative free logic. (shrink)

Computer assisted theorem proving is an increasingly important part of mathematical methodology, as well as a long-standing topic in artificial intelligence (AI) research. However, the current generation of theorem proving software have limited functioning in terms of providing new proofs. Importantly, they are not able to discriminate interesting theorems and proofs from trivial ones. In order for computers to develop further in theorem proving, there would need to be a radical change in how the software functions. Recently, (...) machine learning results in solving mathematical tasks have shown early promise that deep artificial neural networks could learn symbolic mathematical processing. In this paper, I analyze the theoretical prospects of such neural networks in proving mathematical theorems. In particular, I focus on the question how such AI systems could be incorporated in practice to theorem proving and what consequences that could have. In the most optimistic scenario, this includes the possibility of autonomous automated theorem provers (AATP). Here I discuss whether such AI systems could, or should, become accepted as active agents in mathematical communities. (shrink)