O artigo aborda o ponto de vista do pensar como uma ‘virtude’ em vez de habilidade cognitiva. A noção do pensamento e da alegria em Espinosa é o fulcro de uma concepção não-instrumental da filosofia. A comunidade de investigaçâo da Filosofia com as Crianças é uma prática na que pode-se ver refletida esta inspiração espinosana.Partindo da noção do pensamento como uma expressão da potência essencial de cada indivíduo, são exploradas aqui as noções de diversão e tédio para argumentar que, embora (...) sem garantias, a experiência da filosofia é uma forma de virtude e auto-afirmação do que chamamos espinosamente de alegria do pensar na escola. (shrink)

En el presente escrito indagamos en representaciones de docentes en torno a la experiencia de llevar adelante propuestas de filosofía con niños. Para ello, proponemos, primero, precisar las implicancias de lo que denominamos escenas filosóficas, definimos a la enseñanza de la filosofía como un problema filosófico y caracterizamos, luego, la práctica a partir de una polémica sobre su denominación de filosofía para niños o filosofía con niños. Para relevar estas representaciones, realizamos seis entrevistas en profundidad a docentes que tienen amplia (...) experiencia en esta práctica, y, a partir de un análisis de las entrevistas, ponemos el énfasis en la potencia de la reflexión sobre la experiencia. Recuperamos, en las narraciones, la revisión de la propia formación, de la idea de planificación y del modo en el que irrumpen las infancias. Por último, subrayamos el reconocimiento del carácter transformador del hacer filosofía con niños que relatan los docentes. (shrink)

We study model theory of actions of finite groups on substructures of a stable structure. We give an abstract description of existentially closed actions as above in terms of invariants and PAC structures. We show that if the corresponding PAC property is first order, then the theory of such actions has a model companion. Then, we analyze some particular theories of interest (mostly various theories of fields of positive characteristic) and show that in all the cases considered the PAC property (...) is first order. (shrink)

We introduce and study the notions of a PAC-substructure of a stable structure, and a bounded substructure of an arbitrary substructure, generalizing [10]. We give precise definitions and equivalences, saying what it means for properties such as PAC to be first order, study some examples (such as differentially closed fields) in detail, relate the material to generic automorphisms, and generalize a "descent theorem" for pseudo-algebraically closed fields to the stable context. We also point out that the elementary invariants of pseudo-algebraically (...) closed fields from [6] are also valid for pseudo-differentially closed fields. (shrink)

We compute that the index set of PAC-learnable concept classes is m-complete Σ30\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\Sigma^{0}_{3}}$$\end{document} within the set of indices for all concept classes of a reasonable form. All concept classes considered are computable enumerations of computable Π10\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\Pi^{0}_{1}}$$\end{document} classes, in a sense made precise here. This family of concept classes is sufficient to cover all standard examples, and also has the property that PAC learnability (...) is equivalent to finite VC dimension. (shrink)

The Probably Approximately Correct (PAC) learning is a machine learning model introduced by Leslie Valiant in 1984. The PACi reducibility refers to the PAC reducibility independent of size and computation time. This reducibility in PAC learning resembles the reducibility in Turing computability. The ordering of concept classes under PAC reducibility is nonlinear, even when restricted to particular concrete examples.Due to the resemblance to Turing Reducibility, we suspected that there could be incomparable PACi and PAC degrees for the PACi and PAC (...) reducibilities as in Turing incomparable degrees. In 1957 Friedberg and in 1956 Muchnik independently solved the Post problem by constructing computably enumerable sets A and B of incomparable degrees using the priority construction method. We adapt this idea to PACi and PAC reducibilities and construct two effective concept classes C and D such that C is not reducible to D and vice versa. When considering PAC reducibility it was necessary to work on the size of an effective concept class, thus we use Kolmogorov complexity to obtain the size. The non-learnability of concept classes in the PAC learning model is explained by the existence of PAC incomparable degrees.Analogous to the Turing jump, we give a jump operation on effective concept classes for the zero jump. To define the zero jump operator for PACi degrees the join of all the effective concept classes is constructed and proved that it is a greatest element. There are many properties proven for existing degrees. Thus we can explore proving those properties to PACi and PAC degrees. But if we prove an embedding from those degrees to PACi and PAC degrees then those properties will be true for PACi and PAC degrees without explicitly proving them.Abstract prepared by Dodamgodage Gihnee M. Senadheera and taken directly from the thesisE-mail: [email protected]: https://www.proquest.com/docview/2717762461/abstract/ACD19F29A8774AF6PQ/1?accountid=13864. (shrink)

The essays that follow grew out of a workshop held at the Center for Buddhist Studies, University of California, Berkeley, in March 2018, on the topic of conceptuality and non-conceptuality in Buddhist philosophy. Discussions at the workshop focused specifically on the tenability of the claim made by the two Buddhist epistemologists Dignāga and Dharmakīrti that perceptual cognitions are non-conceptual and yet also contribute to the contents of conceptual thought. The four contributions collected here present just a few of the resulting (...) reflections.This essay explores the Dharmakīrtian1 notion of a "concept" in the specific context of a "pseudo-perception", that is, cognitive events that... (shrink)

Computer scientists have provided a distinct justification of Occam’s Razor. Using the probably approximately correct framework, they provide a theorem that they claim demonstrates that we should favor simpler hypotheses. The argument relies on a philosophical interpretation of the theorem. I argue that the standard interpretation of the result in the literature is misguided and that a better reading does not, in fact, support Occam’s Razor at all. To this end, I state and prove a very similar theorem that, if (...) interpreted the same way, would justify the contradictory Anti-Occam’s Razor—the principle that we should favor more complex hypotheses. (shrink)

We generalize a well-known theorem binding the elementary equivalence relation on the level of PAC fields and the isomorphism type of their absolute Galois groups. Our results concern two cases: saturated PAC structures and nonsaturated PAC structures.

Corporate political action committees (PACs) play a prominent role in the political strategies of U.S. organizations, and the ability of firms to influence political outcomes is highly controversial. To the extent that PACs enable groups of firms to pursue corporate agendas at the expense of the social good, they promote socially suboptimal outcomes. This study examines the impact of corporate PACs on entry restriction in manufacturing industries and finds a negative relationship between corporate PAC spending and the entry of new (...) firms. Results suggest that PACs are used to shape industry structure to the economic benefit of incumbents. (shrink)

Corporate political action committees (PACs) have been pragmatic contributors to election campaigns since 1974. They consistently have sought access to incumbents regardless of party affiliation or political philosophy and ordinarily have shunned making funds available to challengers or open seat contestants with the rare exception of conservative Republicans. The circumstances surrounding the 1992 election enhanced the potential for success among non-incumbents, both challengers and particularly, open seat contestants. Many of these candidates were women, often liberal Democrats, a group which historically (...) had received little, if any, corporate PAC contributions. In order to maintain access to these likely incumbents in the new Congress, corporate PACs were forced to revise their pragmatic strategies and to contribute in a manner previously associated with ideological PACs. (shrink)

The present article takes a simple observation as a starting point for its subsequent reflection on the epistemological and methodological issues surrounding the resort to small corpora: the latter have survived when the rise of corpus linguistics and the development of big data have multiplied resources. To us, this survival is proof of the material and logistical necessity as well as the scientific relevance of small corpora, which we explore from the particular angle of spoken language and within the specific (...) domain of phonology. We explain why this field has a unique connection to its linguistic object and consequently a privileged relation to corpora and rethink the viability of corpora not in terms of size but in terms of purpose. We then defend the methodology and ambitions put forward by the PAC program whose database on contemporary oral English exclusively relies on small specialized corpora built in the various English-speaking areas around the world. Not only do we demonstrate how relevant these small corpora are individually for the quantitative and qualitative study of specific phenomena, such as levelling in the Mancunian variety of northern English for instance, but also show how they collectively allow for the comparative and cumulative analysis as well as the theoretical modelling of such phenomena as rhoticity and r-sandhi in the different varieties of English spoken worldwide. Therefore, we illustrate how the results yielded by the in-depth study of the small PAC corpora help us take into account the system dynamics of the varieties of English and the sociolinguistic weight of local identities, especially along the north-south axis, in the description and understanding of their phonetic and phonological characteristics. In addition, by supporting small corpora, we implicitly defend corpus phonology and question the automatic superiority that large corpora enjoy as far as the in-depth analysis of spoken language and of the evolution of the varieties of English spoken worldwide is concerned. (shrink)

We achieve several results. First, we develop a variant of the theory of absolute Galois groups in the context of many sorted structures. Second, we provide a method for coding absolute Galois groups of structures, so they can be interpreted in some monster model with an additional predicate. Third, we prove the “Weak Independence Theorem” for pseudo-algebraically closed (PAC) substructures of an ambient structure with no finite cover property (nfcp) and the property [Formula: see text]. Fourth, we describe Kim-dividing in (...) these PAC substructures and show several results related to the SOPnhierarchy. Fifth, we characterize the algebraic closure in PAC structures. (shrink)

Denef and Loeser defined a map from the Grothendieck ring of sets definable in pseudo-finite fields to the Grothendieck ring of Chow motives, thus enabling to apply any cohomological invariant to these sets. We generalize this to perfect, pseudo algebraically closed fields with pro-cyclic Galois group. In addition, we define some maps between different Grothendieck rings of definable sets which provide additional information, not contained in the associated motive. In particular we infer that the map of Denef-Loeser is not injective.

"The Marriage Translation" argues that a Benjaminian account of translation can shed new light on the ways in which contemporary practices of queer alliance transform, and are transformed by, legal and political discourse. In a constellation of readings—of arguments for the French pacs, of Benjamin's essays on translation, and on Goethe's Elective Affinities, as well as of two photos of the illegal weddings celebrated in San Francisco and in Bègles, France—the article emphasizes the ways social contexts are sometimes reinvigorated and (...) at other times ignored by the demand for certain forms of legal recognition. (shrink)

Building on philosophy of science literature and two original studies, this paper argues for the necessity of incorporating all three portions of Wood''s (1991) theoretical model of corporate social performance (CSP) into its measurement. It begins by describing the two studies of an organizational phenomenon not commonly studied – internal fund drives to employees. Insights from these studies of corporate PAC and United Way campaigns are then used to illustrate how important it is to incorporate all three portions of Wood''s (...) model into the measurement of CSP to prevent drawing faulty conclusions. The paper concludes by providing a matrix for use in testing the validity of CSP measures. (shrink)

We produce a model of \ such that no outer model of \ has the same pure sets, answering a question asked privately by Eric Hall.

We prove that the theory of all sentences in the language of rings which are true in for almost all is decidable. Here is the field of all algebraic numbers; is the ring of all algebraic integers; is the absolute Galois group of ; for each , is the fixed field of σ1,…,σe in ; and the clause ‘almost all’ is used in the sense of the Haar measure of.

Bounded PAC substructures of models of stable theory T are generalizations of bounded PAC fields and bounded PAC beautiful pairs generalize Poizat's beautiful pairs. Both notions were introduced in the authors Ph.D. thesis. In this paper, we prove that under the assumption that the PAC property is first order for T, the theory of any bounded PAC structure is simple. Moreover, if the PAC property is first order for T and T does not have the finite cover property, then the (...) theory of any bounded PAC beautiful pair is simple. We, also, give a characterization of dividing in both cases. (shrink)

Offering wisdom for everyone, along with colorful original illustrations, arcade icon Pac-Man shares a collection of his most famous inspirational and feel-good quotes.

In this paper, we investigate a new model theoretical tree property (TP), called the antichain tree property (ATP). We develop combinatorial techniques for ATP. First, we show that ATP is always witnessed by a formula in a single free variable, and for formulas, not having ATP is closed under disjunction. Second, we show the equivalence of ATP and [Formula: see text]-ATP, and provide a criterion for theories to have not ATP (being NATP). Using these combinatorial observations, we find algebraic examples (...) of ATP and NATP, including pure groups, pure fields and valued fields. More precisely, we prove Mekler’s construction for groups, Chatzidakis’ style criterion for pseudo-algebraically closed (PAC) fields, and the AKE-style principle for valued fields preserving NATP. We give a construction of an antichain tree in the Skolem arithmetic and atomless Boolean algebras. (shrink)

This article looks at the ways in which Spanish American women exploited the political and social turmoil of the late 18th and early 19th centuries to move beyond their traditional sphere of influence in the home. Women directly participated in the Túpac Amaru Rebellion (1780–1781) and in the Wars of Independence (1810–1825) providing funding, food supplies, infrastructure and reinforcements for the troops, and nursing the wounded. Others contributed by taking part in the physical fighting (both openly and disguised as men) (...) and a few led troops into battle. This article looks at some of the individuals behind the statistics and reveals their determination to participate despite the punishments imposed on women found guilty of disloyalty to the Spanish crown. Spanish colonial law had to be amended to ensure that women dissidents were given as equally harsh sentences as men. In the immediate post-independence period, rather than be seen as misfits or a threat to the patriarchal system, several of these women were given national awards. (shrink)

Identifying biomarkers of developing mental disorder is crucial to improving early identification and treatment—a key strategy for reducing the burden of mental disorders. Cross-frequency coupling between two different frequencies of neural oscillations is one such promising measure, believed to reflect synchronization between local and global networks in the brain. Specifically, in adults phase–amplitude coupling (PAC) has been shown to be involved in a range of cognitive processes, including working and long-term memory, attention, language, and fluid intelligence. Evidence suggests that increased (...) PAC mediates both temporary and lasting improvements in working memory elicited by transcranial direct-current stimulation and reductions in depressive symptoms after transcranial magnetic stimulation. Moreover, research has shown that abnormal patterns of PAC are associated with depression and schizophrenia in adults. PAC is believed to be closely related to cortico-cortico white matter (WM) microstructure, which is well established in the literature as a structural mechanism underlying mental health. Some cognitive findings have been replicated in adolescents and abnormal patterns of PAC have also been linked to ADHD in young people. However, currently most research has focused on cross-sectional adult samples. Whereas initial hypotheses suggested that PAC was a state-based measure due to an early focus on cognitive, task-based research, current evidence suggests that PAC has both state-based and stable components. Future longitudinal research focusing on PAC throughout adolescent development could further our understanding of the relationship between mental health and cognition and facilitate the development of new methods for the identification and treatment of youth mental health. (shrink)

Viebahn (Pac Philos Q 99:749–762, 2018. https://doi.org/10.1111/papq.1222) has recently argued that several tests for ambiguity, such as the conjunction-reduction test, are not reliable as tests for polysemy, but only as tests for homonymy. I look at the more fine-grained distinction between regular and irregular polysemy and I argue for a more nuanced conclusion: the tests under discussion provide systematic evidence for homonymy and irregular polysemy but need to be used with more care to test for regular polysemy. I put this (...) conclusion at work in the context of the debate over the alleged referential-attributive ambiguity of the definite article. In reply to various criticisms, defenders of the ambiguity view argue that this is a case of polysemy. But opponents object that the dual use of the definite article fails tests for ambiguity. The debate seems to have come to stalemate, unless the relevance of the tests is determined for cases of alleged polysemy. I conclude that the balance of considerations incline towards rejecting the ambiguity thesis. (shrink)

We study computable PAC (CPAC) learning as introduced by Agarwal et al. (2020). First, we consider the main open question of finding characterizations of proper and improper CPAC learning. We give a characterization of a closely related notion of strong CPAC learning, and provide a negative answer to the COLT open problem posed by Agarwal et al. (2021) whether all decidably representable VC classes are improperly CPAC learnable. Second, we consider undecidability of (computable) PAC learnability. We give a simple general (...) argument to exhibit such ndecidability, and initiate a study of the arithmetical complexity of learnability. We briefly discuss the relation to the undecidability result of Ben-David et al. (2019), that motivated the work of Agarwal et al. (shrink)

Some opponents of abortion claim that fetuses are persons from the moment of conception. Following Berg (2017), let us call these individuals “Personhood-At-Conception” (or PAC), opponents of abortion. Berg argues that if fetuses are persons from the moment of conception, then miscarriage kills far more people than abortion. As such, PAC opponents of abortion face the following dilemma: They must “immediately” and “substantially” shift their attention, resources, etc., toward preventing miscarriage or they must admit that they do not actually believe (...) that fetuses are persons from the moment of conception (or, at least, they must recognize that they are not acting in ways that are consistent with this belief). In this essay, I show that Berg’s argument fails at each step. Specifically, after outlining her argument (in section 1), I consider the central claim of Berg’s style of argument: That “miscarriage…is much deadlier than abortion.” In section 2, I argue that this claim is false (when taken literally) and misleading otherwise. In section 3, I show that Berg’s style of argument is identical in structure to a criticism that is sometimes levied against the recent “Black Lives Matter” movement. In the latter context, the argument has been vehemently rejected. I argue that Berg’s style of argument should be rejected for the same reasons. Finally, in section 4, I show that Berg’s suggestion that opponents of abortion should divert “substantial” amounts of money and attention to miscarriage prevention faces two problems. First, these claims are made without any evidence regarding the actual priorities and spending habits of PAC opponents of abortion. If we are told “not enough is being done,” one wonders: What is being done and how much counts as “enough”? Berg gives no answer to either question. Second, even if it is true that opponents of abortion do not pay substantial attention to miscarriage prevention, Berg fails to notice that this may be for good reason. I conclude that PAC opponents of abortion do not face the dilemma that Berg presents. (shrink)

One tradition in relevant and paraconsistent logics has been to develop sys- tems intended for applications to arithmetic and computability theory. The aspiration, as in Meyer [38] and others, is to recover enough working mathe- maticsforrealcomputation, butwithoutthelimitativeresultsofTuring, Gödel, etc.; or more cautiously, as in Dunn [22], to respect relevance and with that be insulated against the possibility of a genuine inconsistency. We distill these goals into guiding questions, and study the options for logics within a range of relevant systems. We (...) focus on strong truth functional logics RM3and PAC [6] and their expansions, with application to inconsistent arithmetics [62, 63]. We argue that this approach, while having many virtues, does not fully answer our guiding questions. This points to weak relevant logics like Routley/Sylvan’s DKQ [54], Brady’s MCQ [14], and Logan and Boccuni’s DL2Qt,f c [31]. The recurring theme is that paraconsistent computability struggles with functional- ity [17, 41, 43]. A method for advancing on the ‘function problem’ is sketched with Kleene’s theorem as a worked example. (shrink)

We study structures equipped with generic predicates and/or automorphisms, and show that in many cases we obtain simple theories. We also show that a bounded PAC field is simple. 1998 Published by Elsevier Science B.V. All rights reserved.

Background: Classical computability and complexity theory analyze how costly a computation is in time or space, assuming inputs are already encoded as finite strings. The knowledge-representation tradition recognizes that representation choices constrain inference—most notably through the expressiveness–tractability tradeoff—but focuses on the complexity of querying a fixed representation, not on whether certain representational resources are necessary for a task to be expressible at all. Meanwhile, deep learning systems exhibit systematic failures on compositional and multi-object reasoning, symbolic systems face the classical symbol-grounding (...) problem, and neuro-symbolic architectures lack a formal account of which representational resources are required for which tasks. -/- Objectives: I aim to develop a computability-theoretic framework that classifies computational tasks by their minimal representational requirements—an axis orthogonal to time–space complexity—thereby providing formal criteria for determining when connectionist, symbolic, or neuro-symbolic architectures are representationally adequate, or provably inadequate, for a given task. -/- Methods: I introduce the Hierarchical Representational Machine (HRM), which stratifies representational resources into four layers: Structured Input Space (L1), grounded in Type-2 Theory of Effectivity; Equivalence and Measurement (L2), formalized via computable quotient spaces and representational measurement theory; Formal Symbolic Representation (L3), providing compositional syntax with effective derivation; and Admissibility Constraints (L4), supplying decidable meta-level filters for safety, legality, and verification. For each layer, I define necessity schemas that identify structural conditions on tasks—invariance, unbounded compositionality, and hard admissibility—under which that layer is provably required. I establish separation results via diagonal and undecidability arguments, and introduce the meta-problem HRM-Classify with the minimal requirement operator Req(T). -/- Results: The main results are: (i) three necessity schemas identifying when specific layers are unavoidable; (ii) separation theorems establishing strict gaps between layer-restricted solvability classes—{L1} ⊊ {L1,L2}, {L3} ⊊ {L1,L2,L3}, and {L1,L2,L3} ⊊ {L1,L2,L3,L4} under external-standard semantics—demonstrating that these layers correspond to genuine computability-theoretic distinctions even for constant-output tasks; and (iii) a solvability classification via Req(T) with worked examples spanning object recognition, program verification, and autonomous driving that illustrate the full layer hierarchy. -/- Conclusions: HRM provides a formal vocabulary for diagnosing representational insufficiency in AI systems: distribution-shift brittleness is identified as missing invariance structure, systematic compositional failures as insufficient symbolic resources, and constraint violations as absent admissibility gates. The framework serves as a principled pre-architectural analysis tool that determines minimal representational commitments before algorithm selection. Because HRM addresses representational feasibility rather than computational efficiency, it complements existing frameworks such as PAC/VC theory, knowledge compilation, and category-theoretic approaches, and is applicable wherever the question "what must be representable?" precedes "how hard is inference?". (shrink)

It is widely agreed that play and games contribute to the good life. One might naturally wonder how games in particular so contribute? Granted, games can be very good, what exactly is so good about them when they are good? Although a natural starting point, this question is perhaps naive. Games come in all shapes and sizes, and different games are often good in very different ways. Chess, Bridge, Bingo, Chutes and Ladders, Football, Spin the Bottle, Dungeons & Dragons, Pac-Man, (...) Minecraft and Charades are all games, and can all contribute to a good life, but each will characteristically enrich someone’s life in its own distinctive way. Some games facilitate socializing and sociability, other games improve physical fitness, some develop a sense of fair play and reciprocity, while others enhance concentration and analytic skills. Asking “What is good about games?” and assuming a simple answer is as naïve as asking “What is good about fiction?” or “What is good about sex?” However, a less naïve question and philosophically interesting question is not hard to formulate. Plausibly, much of the heterogeneity of the value of games stems from the different kinds of instrumental value of different games. Perhaps we should therefore ask in what ways the activity of playing games is characteristically good for its own sake. Unfortunately, the philosophical literature on the noninstrumental value of playing games is sparse. One of the few sustained treatments of the topic can be found in an underappreciated exchange between Thomas Hurka and John Tasioulas. Interestingly, despite taking different views of what it is to play a game, they both make room for the noninstrumental value of play and achievement in game play and they both argue that these two goods stand in important an important explanatory relation. However, they take diametrically opposed views as to which of these good is more basic. Roughly, on Hurka’s view, the good of achievement is more basic, and it is because of the non-instrumental value of achievement that what Hurka calls “playing in a game,” which involves playing (full-stop), is itself noninstrumentally good because of the noninstrumental value of achievement. The idea is that if something is noninstrumentally good then loving that thing is also noninstrumentally good, and that playing in a game involves loving the activity for its own sake. In this way, the value of achievement in a game grounds the value of playing in a game. Tasioulas takes exactly the opposite approach. He argues that there must be something independently good about playing a game which grounds the value of achievement in that game. On his view, the typical grounding good or “framing value” of games is play itself—what I am here calling “playing (full-stop).” In this essay, I raise some objections to both Hurka’s view and Tasioulas’s view and develop a positive alternative conception of the non-instrumental value of games. I argue that while each view is insightful in its own way, neither gets things exactly right. For a start, the way in which they characterize the key concepts is problematic. Hurka’s definition of ‘play a game’, which he lifts from Suits, is problematic (for reasons Tasioulas notes), while both of their characterizations of play are problematic for reasons I rehearse here. They also take an unduly narrow view of the possible role of achievement in game play, both effectively conflating achievement with “excellence.” I argue, by contrast, that there is an important sense in which even someone who is not very good at the game by any objective standard can still reap the goods of achievements in games. At the same time, those who play games typically do not do so for the sake of achievements as such, though they may do something which is in a sense tantamount to this, or so I shall argue. Finally, I argue that neither Hurka’s “achievement first” order of explanation nor Tasioulas’s “play first” order of explanation is fully correct. I argue for what I call a “variable priority” view. On this view, the value of play (at least partly) sometimes grounds the value of achievement in a game, while in other cases the independently grounded value of achievement in a game provides a further ground for the value of play, though even in that case play is independently good for its own sake. (shrink)

This research assesses the relative impact on legislative decision making of several prevalent types of corporate political activities: political action committee (PAC) contributions, constituency building, executive lobbying, use of professional lobbyists, and advocacy advertising. Two separate groups of expert informants provided data on both the usage and the effectiveness of these different influence tactics. The results indicate convergent support for constituency-centered models of legislative decision making that are based on public choice theory. Further research is suggested to explore how, when, (...) and why firms implement different mixes of these activities and what determines the effectiveness of the overall political strategies that result. (shrink)

I consider the problem of learning from data corrupted by underrepresentation bias, where positive examples are filtered out at different, unknown rates for a fixed number of sensitive groups. I show that with a small amount of unbiased data, I can efficiently estimate the group-wise drop-out rates, even in settings where intersectional group membership makes learning each intersectional rate computationally infeasible. Using these estimates, I construct a reweighting scheme that allows me to approximate the loss of any hypothesis on the (...) true distribution and present an algorithm encapsulating this process. Finally, I define a bespoke notion of PAC learnability for the underrepresentation and intersectional bias setting and show that my algorithm allows efficient learning for model classes of finite VC dimension. (shrink)

The frequency of death from miscarriage is very high, greater than the number of deaths from induced abortion or major diseases.Berg (2017, Philosophical Studies 174:1217–26) argues that, given this, those who contend that personhood begins at conception (PAC) are obliged to reorient their resources accordingly—towards stopping miscarriage, in preference to stopping abortion or diseases. This argument depends on there being a basic moral similarity between these deaths. I argue that, for those that hold to PAC, there are good reasons to (...) think that there is no such similarity. There is a morally relevant difference between preventing killing and letting die, giving PAC supporters reasons to prioritize reducing abortion over reducing miscarriage. And the time-relative interest account provides a morally relevant difference in the badness of death of miscarriages and deaths of born adults, justifying attempts to combat major diseases over attempts to combat miscarriage. I consider recent developments in the literature and contend that these new arguments are unsuccessful in establishing moral similarities between deaths from miscarriage and abortion, and deaths from miscarriage and disease. (shrink)