Vacuolar ATPases (V‐ATPases, V1Vo‐ATPases) are rotary motor proton pumps that acidify intracellular compartments, and, when localized to the plasma membrane, the extracellular space. V‐ATPase is regulated by a unique process referred to as reversible disassembly, wherein V1‐ATPase disengages from Vo proton channel in response to diverse environmental signals. Whereas the disassembly step of this process is ATP dependent, the (re)assembly step is not, but requires the action of a heterotrimeric chaperone referred to as the RAVE complex. Recently, an alternative pathway (...) of holoenzyme disassembly was discovered that involves binding of Oxidation Resistance 1 (Oxr1p), a poorly characterized protein implicated in oxidative stress response. Unlike conventional reversible disassembly, which depends on enzyme activity, Oxr1p induced dissociation can occur in absence of ATP. Yeast Oxr1p belongs to the family of TLDc domain containing proteins that are conserved from yeast to mammals, and have been implicated in V‐ATPase function in a variety of tissues. This brief perspective summarizes what we know about the molecular mechanisms governing both reversible (ATP dependent) and Oxr1p driven (ATP independent) V‐ATPase dissociation into autoinhibited V1 and Vo subcomplexes. (shrink)

In this paper, I discuss two concerns for pluralist truth theories: a concern about a key detail of these theories and a concern about their viability. The detail-related concern is that pluralists have relied heavily upon the notion of a domain, but it is not transparent what they take domains to be. Since the notion of a domain has been present in philosophy for some time, it is important for many theorists, not only truth pluralists, to be clear (...) on what domains are and what work they can do. The viability-related concern is that it’s not clear how a pluralist truth theory could explain the truth-conditions of mixed atomic propositions. To address this concern, truth pluralists should recognize something to which they have not been sufficiently attentive: that some atomic propositions belong to more than one domain. But, recognizing this requires rethinking the relationships between the nature of propositions, their membership in domains, and their truth. I address these issues and propose an understanding of them that is preferable to the best existing account of them, that offered by Michael Lynch. (shrink)

Abstract:This article sets out two central theses. Both theses primarily involve a fundamental criticism of current contractarian business ethics (CBE), but if these can be sustained, they also constitute two boundary conditions for any future contractarian theory of business ethics. The first, which I label the self-discipline thesis, claims that current CBE would gain considerably in focus if more attention were paid to the logic of the social contract argument. By this I mean the aims set by the theorist and (...) method of reasoning by which normative conclusions are drawn in the contract model. The second, to which I refer as the domain-specificity thesis, argues that current CBE needs to be better adapted to its field of application and the specific goals which it aims to establish. I will substantiate these two theses on the basis of a comparative analysis of CBE with two earlier families of social contract theories. (shrink)

Abramsky, S., Domain theory in logical form, Annals of Pure and Applied Logic 51 1–77. The mathematical framework of Stone duality is used to synthesise a number of hitherto separate developments in theoretical computer science.• Domain theory, the mathematical theory of computation introduced by Scott as a foundation for detonational semantics• The theory of concurrency and systems behaviour developed by Milner, Hennesy based on operational semantics.• Logics of programsStone duality provides a junction between semantics and logics . Moreover, (...) the underlying logic is geometric, which can be computationally interpreted as the logic of observable properties—i.e., properties which can be determined to hold of a process on the basis of a finite amount of information about its execution.These ideas lead to the following programme. A metalanguage is introduced, comprising• types = universes of discourse for various computational situations;• terms = PROGRAMS = syntactic intensions for models or points. A standard denotational interpretation of the metalanguage is given, assigning domains to types and domain elements to terms. The metalanguage is also given a logical interpretation, in which types are interpreted as propositional theories and terms are interpreted via a program logic, which axiomatises the properties they satisfy. The two interpretations are related by showing that they are Stone duals of each other. Hence, semantics and logic are guaranteed to be in harmony with each other, and in fact each determines the other up to isomorphism. This opens the way to a whole range of applications. Given a denotational description of a computational situation in our metalanguage, we can turn the handle to obtain a logic for that situation. (shrink)

Source domain verification has not received as much attention as criteria for metaphor identification in the study of conceptual metaphor. In this paper, we provide a replicable approach to source...

Domain extension in mathematics occurs whenever a given mathematical domain is augmented so as to include new elements. Manders argues that the advantages of important cases of domain extension are captured by the model-theoretic notions of existential closure and model completion. In the specific case of domain extension via ideal elements, I argue, Manders’s proposed explanation does not suffice. I then develop and formalize a different approach to domain extension based on Dedekind’s Habilitationsrede, to which (...) Manders’s account is compared. I conclude with an examination of three possible stances towards extensions via ideal elements. (shrink)

It is often possible to know what a speaker intends to communicate without knowing what they intend to say. In such cases, speakers need not intend to say anything at all. Stanley and Szabó's influential survey of possible analysis of quantifier domain restriction is, therefore, incomplete and the arguments made by Clapp and Buchanan against Truth Conditional Compositionality and propositional speaker-meaning are flawed. Two theories should not always be viewed as incompatible when they associate the same utterance with different (...) propositions, as there may be many ways to interpret speakers that are compatible with their intentions. (shrink)

Artificial intelligence (AI) has become nearly ubiquitous in modern society, from components of mobile applications to medical support systems, and everything in between. In societally impactful systems imbued with AI, there has been increasing concern related to opaque AI, that is, artificial intelligence where it is unclear how or why certain decisions are reached. This has led to a recent boom in research on “explainable AI” (XAI), or approaches to making AI more explainable and understandable to human users. In the (...) military domain, numerous bodies have argued that autonomous and AI-enabled weapon systems ought not incorporate unexplainable AI, with the International Committee of the Red Cross and the United States Department of Defense both explicitly including explainability as a relevant factor in the development and use of such systems. In this article, I present a cautiously critical assessment of this view, arguing that explainability will be irrelevant for many current and near-future autonomous systems in the military (which do not incorporate any AI), that it will be trivially incorporated into most military systems which do possess AI (as these generally possess simpler AI systems), and that for those systems with genuinely opaque AI, explainability will prove to be of more limited value than one might imagine. In particular, I argue that explainability, while indeed a virtue in design, is a virtue aimed primarily at designers and troubleshooters of AI-enabled systems, but is far less relevant for users and handlers actually deploying these systems. I further argue that human–machine teaming is a far more important element of responsibly using AI for military purposes, adding that explainability may undermine efforts to improve human–machine teamings by creating a prima facie sense that the AI, due to its explainability, may be utilized with little (or less) potential for mistakes. I conclude by clarifying that the arguments are not against XAI in the military, but are instead intended as a caution against over-inflating the value of XAI in this domain, or ignoring the limitations and potential pitfalls of this approach. (shrink)

This book is about normativity and reasons.

Cross-domain descriptions are descriptions of features pertaining to one domain in terms of vocabulary primarily associated with another domain. Notably, we routinely describe psychological features in terms of the sensory domain and vice versa. Sorrow is said to be ‘bitter’ and fear ‘cold’. Music can be described as ‘happy’, ‘sad’, ‘mournful’, and so on. Such descriptions are rife in both everyday discourse and literary writings. What is it about psychological features that invites descriptions in sensory terms (...) and what is it about the sensory that invites descriptions in terms of the psychological? Drawing on the literature on polysemy, this paper sheds light on cross-domain descriptions pertaining to the sensory and the psychological domains. (shrink)

Inspired by a framework of multi lingual sequent calculus, we introduce a formal logical system called locally continuous sequent calculus to represent _L_-domains. By considering the logic states defined on locally continuous sequent calculi, we show that the collection of all logic states of a locally continuous sequent calculus with respect to set inclusion forms an _L_-domain, and every _L_-domain can be obtained in this way. Moreover, we define conjunctive consequence relations as morphisms between our sequent calculi, and (...) prove that the category of locally continuous sequent calculi and conjunctive consequence relations is equivalent to that of _L_-domains and Scott-continuous functions. This result extends Abramsky’s “Domain theory in logical form” to a continuous setting. (shrink)

Metacognition is the capacity to evaluate the success of one's own cognitive processes in various domains; for example, memory and perception. It remains controversial whether metacognition relies on a domain-general resource that is applied to different tasks or if self-evaluative processes are domain specific. Here, we investigated this issue directly by examining the neural substrates engaged when metacognitive judgments were made by human participants of both sexes during perceptual and memory tasks matched for stimulus and performance characteristics. By (...) comparing patterns of fMRI activity while subjects evaluated their performance, we revealed both domain-specific and domain-general metacognitive representations. Multivoxel activity patterns in anterior prefrontal cortex predicted levels of confidence in a domain-specific fashion, whereas domain-general signals predicting confidence and accuracy were found in a widespread network in the frontal and posterior midline. The demonstration of domain-specific metacognitive representations suggests the presence of a content-rich mechanism available to introspection and cognitive control. (shrink)

Abstract:Diagnostic classification systems in psychiatry have continued to rely on clinical phenomenology, despite limitations inherent in that approach. In view of these limitations and recent progress in neuroscience, the National Institute of Mental Health (NIMH) has initiated the Research Domain Criteria (RDoC) project to develop a more neuroscientifically based system of characterizing and classifying psychiatric disorders. The RDoC initiative aims to transform psychiatry into an integrative science of psychopathology in which mental illnesses will be defined as involving putative dysfunctions (...) in neural nodes and networks. However, conceptual, methodological, neuroethical, and social issues inherent in and/or derived from the use of RDoC need to be addressed before any attempt is made to implement their use in clinical psychiatry. This article describes current progress in RDoC; defines key technical, neuroethical, and social issues generated by RDoC adoption and use; and posits key questions that must be addressed and resolved if RDoC are to be employed for psychiatric diagnoses and therapeutics. Specifically, we posit that objectivization of complex mental phenomena may raise ethical questions about autonomy, the value of subjective experience, what constitutes normality, what constitutes a disorder, and what represents a treatment, enablement, and/or enhancement. Ethical issues may also arise from the (mis)use of biomarkers and phenotypes in predicting and treating mental disorders, and what such definitions, predictions, and interventions portend for concepts and views of sickness, criminality, professional competency, and social functioning. Given these issues, we offer that a preparatory neuroethical framework is required to define and guide the ways in which RDoC-oriented research can—and arguably should—be utilized in clinical psychiatry, and perhaps more broadly, in the social sphere. (shrink)

What counts as human rationality: reasoning processes that embody content-independent formal theories, such as propositional logic, or reasoning processes that are well designed for solving important adaptive problems? Most theories of human reasoning have been based on content-independent formal rationality, whereas adaptive reasoning, ecological or evolutionary, has been little explored. We elaborate and test an evolutionary approach, Cosmides' social contract theory, using the Wason selection task. In the first part, we disentangle the theoretical concept of a “social contract” from that (...) of a “cheater-detection algorithm”. We demonstrate that the fact that a rule is perceived as a social contract — or a conditional permission or obligation, as Cheng and Holyoak proposed — is not sufficient to elicit Cosmides' striking results, which we replicated. The crucial issue is not semantic, but pragmatic: whether a person is cued into the perspective of a party who can be cheated. In the second part, we distinguish between social contracts with bilateral and unilateral cheating options. Perspective change in contracts with bilateral cheating options turns P & not-Q responses into not-P & Q responses. The results strongly support social contract theory, contradict availability theory, and cannot be accounted for by pragmatic reasoning schema theory, which lacks the pragmatic concepts of perspectives and cheating detection. (shrink)

Domain constraint, the requirement that analogues be selected from "the same category," inheres in the popular saying "you can't compare apples and oranges" and the textbook principle "the greater the number of shared properties, the stronger the argument from analogy." I identify roles of domains in biological, linguistic, and legal analogy, supporting the account of law with a computer word search of judicial decisions. I argue that the category treatments within these disciplines cannot be exported to general informal logic, (...) where the relevance of properties, not their number, must be the logically prior criterion for evaluating analogical arguments. (shrink)

We present a survey of the recent applications of continuous domains for providing simple computational models for classical spaces in mathematics including the real line, countably based locally compact spaces, complete separable metric spaces, separable Banach spaces and spaces of probability distributions. It is shown how these models have a logical and effective presentation and how they are used to give a computational framework in several areas in mathematics and physics. These include fractal geometry, where new results on existence and (...) uniqueness of attractors and invariant distributions have been obtained, measure and integration theory, where a generalization of the Riemann theory of integration has been developed, and real arithmetic, where a feasible setting for exact computer arithmetic has been formulated. We give a number of algorithms for computation in the theory of iterated function systems with applications in statistical physics and in period doubling route to chaos; we also show how efficient algorithms have been obtained for computing elementary functions in exact real arithmetic. (shrink)

It is well known that occurrences of sentences such as “Every bottle is empty” will sometimes be understood relative to a subset of the set of all bottles in the universe. Much has been written about what mechanism should be used to model this phenomenon of domain restriction. However, comparatively little attention has been paid to the question of when domain restriction is triggered. I will begin by challenging a recent partial answer to this question. I will then (...) develop my own partial answer based on observations pertaining to information structure. (shrink)

The contributions to this special issue on cognitive development collectively propose ways in which learning involves developing constraints that shape subsequent learning. A learning system must be constrained to learn efficiently, but some of these constraints are themselves learnable. To know how something will behave, a learner must know what kind of thing it is. Although this has led previous researchers to argue for domain-specific constraints that are tied to different kinds/domains, an exciting possibility is that kinds/domains themselves can (...) be learned. General cognitive constraints, when combined with rich inputs, can establish domains, rather than these domains necessarily preexisting prior to learning. Knowledge is structured and richly differentiated, but its “skeleton” must not always be preestablished. Instead, the skeleton may be adapted to fit patterns of co-occurrence, task requirements, and goals. Finally, we argue that for models of development to demonstrate genuine cognitive novelty, it will be helpful for them to move beyond highly preprocessed and symbolic encodings that limit flexibility. We consider two physical models that learn to make tone discriminations. They are mechanistic models that preserve rich spatial, perceptual, dynamic, and concrete information, allowing them to form surprising new classes of hypotheses and encodings. (shrink)

In this note we exhibit a continuity principle for real-valued functions on C[–1, 1] that is not validated by realizability over domains although it is validated by Kleene's functional realizability corresponding to Weihrauch's theory of type 2 effectivity.

The proposition expressed by an utterance of a quantified sentence depends on a domain of discourse somehow determined by the context. How does the context of utterance determine the content of the domain of discourse? Many philosophers would approach this question from the point of view of an expressive theory of linguistic communication, according to which the primary function of language is to enable speakers to convey the propositional contents of their thoughts to hearers. This paper argues that (...) from this point of view there is no persuasive treatment of the determinants of the domain of discourse. The argument focuses on an abnormal case in which the domain the speaker has in mind is not evident to the hearer. In this way the question concerning the determinants of the domain of discourse is used to challenge the expressive theory of communication. (shrink)

The purpose of this paper is to provide a simple yet comprehensive organizing scheme for the responsible conduct of research (RCR). The heuristic offered here should prove helpful in research ethics education, where the many and heterogeneous elements of RCR can be bewildering, as well as research into research integrity and efforts to form RCR policy and regulations. The six domains are scientific integrity, collegiality, protection of human subjects, animal welfare, institutional integrity, and social responsibility.

Drawing on the work–family enrichment theory, the present study investigates the cross-domain effects of ethical leadership on employees’ family and life satisfaction. Moreover, it focuses on the mediating role of work–family enrichment and the moderated mediation process of family-supportive supervisor behaviors underlying the relationship between ethical leadership and employees’ family and life satisfaction. Using a sample of 371 employees and their immediate supervisors in China, we found that WFE mediated the relationship between ethical leadership and employee-rated and supervisor-rated family (...) and life satisfaction. Moreover, FSSB positively moderated the relationship between ethical leadership and WFE, such that the relationship was strengthened when FSSB were higher. Furthermore, the mediations of WFE between ethical leadership and employee-rated and supervisor-rated family and life satisfaction were also positively moderated by FSSB, such that the indirect effects were stronger when FSSB were higher. The theoretical and managerial implications of our findings are further discussed. (shrink)

This article offers a unified theory of the licensing of Negative and Positive Polarity Items, focusing on the acceptability conditions of PPIs of the some-type, and NPIs of the any-type. It argues that licensing has both a syntactic and a semantic component. On the syntactic side, the acceptability of PIs is checked in constituents; in fact, for any given PI, only some constituents, referred to as `domains', are eligible for the evaluation of that PI. The semantic dimension of licensing consists (...) in the sensitivity of PIs to the monotonicity properties of the syntactic environments they find themselves in. Two pieces of evidence support the semantic dimension of what I call the ‘environment-based’ approach defended here: PIs are subject to flip-flop and certain inferences affect their acceptability by modifying the monotonicity of their environment. A third property, called ‘entanglement’ and so far unnoticed, is described: the acceptability of PIs depends on the acceptability of other PIs in the same syntactic environment. The latter property is exploited to determine what semantic property some is sensitive to: it turns out that, contrary to the consensus among researchers, some is acceptable in the complement of the set of environments in which any is acceptable, and vice versa. (shrink)

Wulf Gaertner provides a comprehensive account of an important and complex issue within social choice theory: how to establish a social welfare function while restricting the spectrum of individual preferences in a sensible way. Gaertner's starting point is K. J. Arrow's famous 'Impossibility Theorem', which showed that no welfare function could exist if an unrestricted domain of preferences is to be satisfied together with some other appealing conditions. A number of leading economists have tried to provide avenues out of (...) this 'impossibility' by restricting the variety of preferences: here, Gaertner provides a clear and detailed account, using standardized mathematical notation, of well over forty theorems associated with domain conditions. Domain Conditions in Social Choice Theory will be an essential addition to the library of social choice theory for scholars and their advanced graduate students. (shrink)

National <.lt> domain name disputes in Lithuania are the ones which courts must decide without having any specific legal regulation. In such cases courts shall apply analogy of law, customs and general principals of law. Last but not least, the courts must address international legal practice as regards the domain name disputes, i.e. take into account the famous ICANN Uniform Domain Name Dispute Resolution Policy adopted in 1999 and mostly applied by the panels of WIPO Arbitration and (...) Mediation Centre while dealing with disputes on generic top level domain names <.com>, <.net>, <.org>, also analyse the practice of ADR cases of Czech Arbitration Court which has the jurisdiction over <.eu> domain name disputes. This article deals with the case-law of Lithuanian courts in <.lt> domain name disputes and analysis the trends of Lithuanian internet law as regards the protection of the owners of intellectual property in Lithuania. The special attention is given to the phenomenon of cybersquatting in Lithuania and the lack of effective means to fight such unfair practices on the net. (shrink)

Suppose there is a domain of discourse of English, then everything of which any predicate is true is a member of that domain. If English has a domain of discourse, then, since ‘is a domain of discourse of English’ is itself a predicate of English and true of that domain, that domain is a member of itself. But nothing is a member of itself. Thus English has no domain of discourse. We defend this (...) argument and go on to argue to the same conclusion without relying on the supposition that English is a language which contains the predicate ‘is a domain of discourse of English’. (shrink)

Videogames present deep challenges for traditional concepts of sport and games. Cybersport in particular suggests that sport might be transposed into digital arenas, and videogames in general provide apparently striking counterexamples to the orthodox Suitsian theory of games, seeming to lack strictly prelusory goals and perhaps even also constitutive rules. I argue as follows: if any cybersports count as genuine sports, it will be those most closely resembling uncontroversial core instances of sport, those that essentially involve gross motor skill. Even (...) so, we might reject cybersports as sport by distinguishing physical skills’ domain of execution from their domain of application, sport implying the non-virtual status of both. Although, like chess, videogames appear to lack prelusory goals, chess conventions and nominal descriptions of the object of any videogame suggest the possibility of Suitsian compliance, as does the inclusion of ‘cheat codes’ in videogame programming. Perhaps such... (shrink)

(Open Access.) Quantifiers frequently figure in works of fiction. But occurrences of quantificational expressions within fictions seem no more inevitably to be associated with real domains than uses of names within fictions seem inevitably to be associated with existing referents. The paper outlines some philosophical puzzles resulting from this apparent lack of associated domains, puzzles that are broadly analogous to more familiar ones raised by the apparently nonreferential nature of many fictional names. The paper argues, in the light of an (...) important disanalogy between quantifiers and names, that the quantificational puzzles are substantive, in that they cannot be resolved merely by appealing to the possibility of empty domains. It then argues that, despite the cited parallels between occurrences of quantifiers and names within fictions, promising treatments of fictional names do not always straightforwardly generalise to provide accounts of the quantificational phenomena: the quantificational puzzles are therefore not only substantive but also distinctive. The paper provides further testament to the depth and interest of the problems involving content that are generated by fiction, by identifying a very wide range of previously neglected cases, while also helping to situate within a broader context the notoriously hard philosophical challenges posed by fictional names. (shrink)

We argue that a comprehensive theory of reciprocals must rely on a general taxonomy of restrictions on the interpretation of relational expressions. Developing such a taxonomy, we propose a new principle for interpreting reciprocals that relies on the interpretation of the relation in their scope. This principle, the Maximal Interpretation Hypothesis (MIH), analyzes reciprocals as partial polyadic quantifiers. According to the MIH, the partial quantifier denoted by a reciprocal requires the relational expression REL in its scope to denote a maximal (...) relation in REL’s interpretation domain. In this way the MIH avoids a priori assumptions on the available readings of reciprocal expressions, which are necessary in previous accounts. Relying extensively on the work of Dalrymple et al. (Ling Philos 21:159–210, 1998), we show that the MIH also exhibits some observational improvements over Dalrymple et al.’s Strongest Meaning Hypothesis (SMH). In addition to deriving some attested reciprocal interpretations that are not expected by the SMH, the MIH offers a more restrictive account of the way context affects the interpretation of reciprocals through its influence on relational domains. Further, the MIH generates a reciprocal interpretation at the predicate level, which is argued to be advantageous to Dalrymple et al.’s propositional selection of reciprocal meanings. More generally, we argue that by focusing on restrictions on relational domains, the MIH opens the way for a more systematic study of the ways in which lexical meaning, world knowledge and contextual information interact with the interpretation of quantificational expressions. (shrink)

a discussion of contextual factors determining the domains of quantifiers. Since the time it was written, much more satisfying work on the topic has been done by Stanley, Williamson, Bach, and Gauker.

This paper develops co-ordinated multiple-domain supervenience relations to model determination and dependence relations between complex entities and their constituents by appealing to R-related pairs and by making use of associated isomorphisms. Supervenience relations are devised for order-sensitive and repetition-sensitive mereologies, for mereological systems that make room for many-many composition relations, as well as for hierarchical mereologies that incorporate compositional and hylomorphic structure. Finally, mappings are provided for theories that consider wholes to be prior to their parts.

Classical generalized quantifier (GQ) theory posits that quantificational determiners (Q-dets) combine with a nominal argument of type et, a first order predicate, to form a GQ. In a recent paper, Matthewson (2001) challenges this position by arguing that the domain of a Q-det is not of type et, but e, an entity. In this paper, I defend the classical GQ view, and argue that the data that motivated Matthewson’s revision actually suggest that the domain set can, and indeed (...) in certain languages must, be contextually restricted overtly. (shrink)