최근 온/오프라인에서 자주 등장하는 페미니즘에 대한 공격은 페미니즘을 주관주의나 특권주의로 간주하는 경향을 갖는다. 이에 이 글에서 나는 페미니즘에 대한 적대시가 페미니즘 입장론에 대한 오해나 무지에서 비롯된 것임을 보여주고자 한다.BR이를 논증하기 위해 나는 이 글에서 1991년도에 『누구의 과학이며 누구의 지식인가?』에서 정식화된 샌드라 하딩(Sandra Harding)의 “지적으로 강력한 페미니스트 입장론”과 도나 해러웨이(Donna Haraway)의 『유인원, 사이보그 그리고 여자』에서 논의되는 “상황적 지식들”을 분석하는 가운데 이들의 입장을 “비판적 입장론”으로 수렴시키고자 한다. 페미니스트 비판적 입장론은 무위치나 상대적 위치에서 출발하는 인식론을 비판하는 가운데 여성의 삶이라는 체현된 위치에서 시작하는 인식론이 (...) 덜 왜곡된 지식을 위한 토대를 제공한다고 본다. 나아가 비판적 입장론은 대상뿐 아니라 대상을 다루는 주체에 대한 성찰성과 비판성을 강조하는 가운데 전통과학보다 더 강한 객관성을 보장하고자 한다. 나아가 비판적 입장론은 주체에 대한 비판 능력을 담보하는 가운데 다양한 모순들을 가로질러 생각할 수 있는 교차적 사고로 나아갈 수 있게 된다.BR이를 통해 나는 비판적 입장론이 기계적 평등에 기반하는 추상적 민주주의를 권력의 차이에 민감한 깊이 있는 민주주의로 한 단계 발전시키는 데 매우 중요한 역할을 수행하고 있음을 분명히 하고자 한다. (shrink)

Marilyn Strathern’s arguments against the possibility of feminist research bringing about a paradigm shift in social anthropology have led to a number of responses. Regarding one argument she presents, her own writings suggest a response: the argument that feminist research cannot bring about such a shift, because it is only concerned with part of society. A foray into the history of British social anthropology is of value for appreciating this argument and the response.

We show that a coherent theory of partially ordered connectives can be developed along the same line as partially ordered quantification. We estimate the expressive power of various partially ordered connectives and use methods like Ehrenfeucht games and infinitary logic to get various undefinability results.

In this work we propose the partial Wiener index as one possible measure of branching in phylogenetic evolutionary trees. We establish the connection between the generalized Robinson–Foulds (RF) metric for measuring the similarity of phylogenetic trees and partial Wiener indices by expressing the number of conflicting pairs of edges in the generalized RF metric in terms of partial Wiener indices. To do so we compute the minimum and maximum value of the partial Wiener index WT,r,n\documentclass[12pt]{minimal} (...) \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$W\left(T,r, n\right)$$\end{document}, where T\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$T$$\end{document} is a binary rooted tree with root r\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$r$$\end{document} and n\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$n$$\end{document} leaves. Moreover, under the Yule probabilistic model, we show how to compute the expected value of WT,r,n\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$W\left(T,r, n\right)$$\end{document}. As a direct consequence, we give exact formulas for the upper bound and the expected number of conflicting pairs. By doing so we provide a better theoretical understanding of the computational complexity of the generalized RF metric. (shrink)

Motivated by constraint satisfaction problems, Feder and Vardi (SIAM Journal of Computing, 28, 57–104, 1998) set out to search for fragments of satisfying the dichotomy property: every problem definable in is either in P or else NP-complete. Feder and Vardi considered in this connection two logics, strict NP (or SNP) and monadic, monotone, strict NP without inequalities (or MMSNP). The former consists of formulas of the form , where is a quantifier-free formula in a relational vocabulary; and the latter (...) is the fragment of SNP whose formulas involve only negative occurrences of relation symbols, only monadic second-order quantifiers, and no occurrences of the equality symbol. It remains an open problem whether MMSNP enjoys the dichotomy property. In the present paper, SNP and MMSNP are characterized in terms of partially ordered connectives. More specifically, SNP is characterized using the logic D of partially ordered connectives introduced in Blass and Gurevich (Annals of Pure and Applied Logic, 32, 1–16, 1986), Sandu and Väänänen (Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 38, 361–372 1992), and MMSNP employing a generalization C of D introduced in the present paper. (shrink)

Connections between partially ordered connectives and Henkin quantifiers are considered. It is proved that the logic with all partially ordered connectives and the logic with all Henkin quantifiers coincide. This implies that the hierarchy of partially ordered connectives is strongly hierarchical and gives several nondefinability results between some of them. It is also deduced that each Henkin quantifier can be defined by a quantifier of the form equation imagewhat is a strengthening of the Walkoe result. MSC: 03C80.

Why do relationships of friendship and love support partiality, but not relationships of hatred or commitments of racism? Where does partiality end and why? I take the intuitive starting point that important cases of partiality are meaningful. I develop a view whereby meaning is understood in terms of transcending self-limitations in order to connect with things of external value. I then show how this view can be used to distinguish central cases of legitimate partiality from cases of illegitimate partiality and (...) how it puts pressure on the traditional way of thinking about partiality. (shrink)

Starting from a connected, partially ordered set of events, it is shown that results of the measurement of time are elements of a partially ordered and filtering field, as used in a previous paper. Moreover, some relations between physical formulas and properties of the field are proved. Finally, some open problems and suggestions are pointed out. For the convenience of the reader not acquainted with elementary algebraic methods, proofs are given in detail.

A number of philosophers have recently argued for acknowledging non-augmented partial grounds, partial grounds that are not parts of full grounds. This paper shows how non-augmented partial grounds can be straightforwardly modelled within the framework of generalised identity. I argue that my proposal answers questions concerning the connections between partial grounding, full grounding, and nothing-over-and-aboveness in a motivated way. In this context, I propose and discuss a way to spell out nothing-over-and-aboveness in terms of generalised identity (...) that does justice to the claim that the fully grounded is nothing over and above its full grounds. It will turn out that the related question whether partial grounding and nothing-over-and-aboveness yield full grounding pertains to considerations concerning how finely factual content is individuated. The relationship between non-augmented partial grounding and nothing-over-and-aboveness crucially depends on whether one works with a representational or a worldly notion of grounding and how coarsely grained one takes worldly grounds to be. (shrink)

This paper provides a defence of the account of partial resemblances between properties according to which such resemblances are due to partial identities of constituent properties. It is argued, first of all, that the account is not only required by realists about universals à la Armstrong, but also useful (of course, in an appropriately re-formulated form) for those who prefer a nominalistic ontology for material objects. For this reason, the paper only briefly considers the problem of how to (...) conceive of the structural universals first posited by Armstrong in order to explain partial resemblances, and focuses instead on criticisms that have been levelled against the theory (by Pautz, Eddon, Denkel and Gibb) and that apply regardless of one’s preferred ontological framework. The partial identity account is defended from these objections and, in doing so, a hitherto quite neglected connection—between the debate about partial similarity as partial identity and that concerning ontological finitism versus infinitism—is looked at in some detail. (shrink)

In this paper we apply proof theoretic methods used for classical systems in order to obtain upper bounds for systems in partial logic. We focus on a truth predicate interpreted in a Kripke style way via strong Kleene; whereas the aim is to connect harmoniously the partial version of Kripke–Feferman with its intended semantics. The method we apply is based on infinitary proof systems containing an ω\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\omega $$\end{document}-rule.

It is argued that reasonable partiality allows an agent to attach value to particular objects of attachment via recognition of the value of the holding of that relation between agent and object. The reasonableness of partiality is ensured by a background context set by the agent's virtues, notably justice. It is argued that reasonable partiality is the only view that is compatible with our best account of the nature of self-knowledge. That account rules out any instrumental relationship between moral demands (...) and moral character, but that familiar claim is given an unfamiliar explanation. Instrumentality depends on a prior objectification of the self and it is that kind of objectification that, in the ethical case, represents a form of ethical evasion. Self-knowledge is transparent, incomplete and essentially connected with first person endorsement. The transparency condition is that knowledge of one's state of mind is "taken" transparently to its object. More specifically, ethical transparency is the feature that my virtues do not exhibit themselves to me in self-knowledge, but take me transparently to the way in which they saliently represent the world as containing evaluative properties calling for various forms of response. It is concluded that reasonable partiality grounded in the nature of the virtues is the only reflective account of morality compatible with the most plausible account of the nature of self-knowledge. The demands of impartiality are incompatible with a condition of having a personal point of view, namely, that a self can stand in a non-alienated relation to itself via its capacity for self-knowledge. (shrink)

We construct a a system PLRI which is the classical propositional logic supplied with a ternary construction , interpreted as the intensional identity of statements and in the context . PLRI is a refinement of Roman Suszko’s sentential calculus with identity (SCI) whose identity connective is a binary one. We provide a Hilbert-style axiomatization of this logic and prove its soundness and completeness with respect to some algebraic models. We also show that PLRI can be used to give a (...) class='Hi'>partial solution to the paradox of analysis. (shrink)

We study the synchronization of complex networks by using event-sampling information. The nodes of the network are connected with event-triggered communication via multiple couplings. The couplings are split into several channels. Not all the channels are connected. Only a part of the states of each node can be communicated by the channels. An event detector is designed for each channel to independently determine the sampling moments. The couplings of the network are partial and event-triggered. Both features make that less (...) information can be used for synchronization. The pinning controllers are also designed based on the sampled information. By establishing a time-dependent Lyapunov functional and utilizing an efficient event condition, we derive less conservative criteria for the synchronization of complex networks. Finally, the effectiveness of our main results is verified by an illustrative example, and comparisons are also presented to show how much conservatism can be reduced. (shrink)

Popper’s original definition of truthlikeness relied on a central insight: that truthlikeness combines truth and information, in the sense that a proposition is closer to the truth the more true consequences and the less false consequences it entails. As intuitively compelling as this definition may be, it is untenable, as proved long ago; still, one can arguably rely on Popper’s intuition to provide an adequate account of truthlikeness. To this aim, we mobilize some classical work on partial entailment in (...) defining a new measure of truthlikeness which satisfies a number of desiderata. The resulting account has some interesting and surprising connections with other accounts on the market, thus shedding new light on current attempts of systematizing different approaches to verisimilitude. (shrink)

In this paper we apply proof theoretic methods used for classical systems in order to obtain upper bounds for systems in partial logic. We focus on a truth predicate interpreted in a Kripke style way via strong Kleene; whereas the aim is to connect harmoniously the partial version of Kripke–Feferman with its intended semantics. The method we apply is based on infinitary proof systems containing an ω-rule.

We study partiality in propositional logics containing formulas with either undefined or over-defined truth-values. Undefined values are created by adding a four-place connective W termed transjunction to complete models which, together with the usual Boolean connectives is shown to be functionally complete for all partial functions. Transjunction is seen to be motivated from a game-theoretic perspective, emerging from a two-stage extensive form semantic game of imperfect information between two players. This game-theoretic approach yields an interpretation where partiality is generated (...) as a property of non-determinacy of games. Over-defined values are produced by adding a weak, contradictory negation or, alternatively, by relaxing the assumption that games are strictly competitive. In general, particular forms of extensive imperfect information games give rise to a generalised propositional logic where various forms of informational dependencies and independencies of connectives can be studied. (shrink)

At the outset of the Republic, Polemarchus advances the bold thesis that “justice is the art which gives benefit to friends and injury to enemies”. He quickly rejects the hypothesis, and what follows is a long tradition of neglecting the ethics of enmity. The parallel issue of how friendship affects the moral sphere has, by contrast, been greatly illuminated by discussions both ancient and contemporary. This article connects this existing work to the less explored topic of the normative significance of (...) our negative relationships. I explain how negative partiality should be conceptualized through reference to the positive analogue, and argue that at least some forms of negative partiality are justified. I further explore the connection between positive and negative relationships by showing how both are justified by ongoing histories of encounter. However, I also argue that these relationships are in some important ways asymmetrical. (shrink)

The new mathematical connection of De Donder’s differential entropy production with the differential changes of thermodynamic potentials (Helmholtz free energy, enthalpy, and Gibbs free energy) was obtained through the linear sequence of equations (direct, straightforward path), in which we use rigorous thermodynamic definitions of the partial molar thermodynamic properties. This new connection uses a global approach to the problem of reversibility and irreversibility, which is vital to global learners’ view and standardizes the linking procedure for thermodynamic potentials (...) (Helmholtz free energy, enthalpy, and and Gibbs free energy)—preferably to the sensing learners. It is shown that De Donder’s differential entropy production in an isolated composite system is equal to the differential change in total entropy and that De Donder’s equation agrees with Clausius’ inequality. The useful work of the irreversible process is discussed, which with the decrease of irreversibility tends towards the hypothetical maximum useful work of the reversible process. (shrink)

Popper’s original definition of truthlikeness relied on a central insight: that truthlikeness combines truth and information, in the sense that a proposition is closer to the truth the more true consequences and the less false consequences it entails. As intuitively compelling as this definition may be, it is untenable, as proved long ago; still, one can arguably rely on Popper’s intuition to provide an adequate account of truthlikeness. To this aim, we mobilize some classical work on partial entailment in (...) defining a new measure of truthlikeness which satisfies a number of desiderata. The resulting account has some interesting and surprising connections with other accounts on the market, thus shedding new light on current attempts of systematizing different approaches to verisimilitude. (shrink)

The problem of future contingents is regarded as an important philosophical problem in connection with determinism and it should be treated by tense logic. Prior’s early work focused on the problem, and later Prior studied branching-time tense logic which was invented by Kripke. However, Prior’s idea to use three-valued logic for the problem seems to be still alive. In this paper, we consider partial and paraconsistent approaches to the problem of future contingents. These approaches theoretically meet Aristotle’s interpretation (...) of future contingents. (shrink)

Numerous studies of the beliefs of people with anorexia nervosa (AN) suggest that a subset of such individuals may experience delusions. We first describe what makes a belief delusional and conclude that such characteristics can be appropriately applied to some beliefs of people with AN. Next, we outline how delusional beliefs may relate to the broader psychopathological process in AN, including: (1) they may be epiphenomenal; (2) they may be an initial partial cause of AN; (3) they may be (...) caused by aspects of AN; or (4) they may be sustaining causes, possibly involved in reciprocal causal relations with aspects of AN. We argue that there is good reason to believe that delusional beliefs of people with AN are not merely epiphenomenal, but rather that they’re causally connected to AN. Because of this, empirical studies can be designed to test for the presence of causal relations. We describe how these studies should be designed. The results of such studies have important implications for understanding the experience of individuals with AN and for the treatment of AN. We outline these implications. (shrink)

This paper extends earlier work by its authors on formal aspects of the processes of contracting a theory to eliminate a proposition and revising a theory to introduce a proposition. In the course of the earlier work, Gardenfors developed general postulates of a more or less equational nature for such processes, whilst Alchourron and Makinson studied the particular case of contraction functions that are maximal, in the sense of yielding a maximal subset of the theory (or alternatively, of one of (...) its axiomatic bases), that fails to imply the proposition being eliminated. In the present paper, the authors study a broader class, including contraction functions that may be less than maximal. Specifically, they investigate "partial meet contraction functions", which are defined to yield the intersection of some nonempty family of maximal subsets of the theory that fail to imply the proposition being eliminated. Basic properties of these functions are established: it is shown in particular that they satisfy the Gardenfors postulates, and moreover that they are sufficiently general to provide a representation theorem for those postulates. Some special classes of partial meet contraction functions, notably those that are "relational" and "transitively relational", are studied in detail, and their connections with certain "supplementary postulates" of Gardenfors investigated, with a further representation theorem established. (shrink)

This is part one of a two-part paper, in which we develop an axiomatic theory of the relation of partial ground. The main novelty of the paper is the of use of a binary ground predicate rather than an operator to formalize ground. This allows us to connect theories of partial ground with axiomatic theories of truth. In this part of the paper, we develop an axiomatization of the relation of partial ground over the truths of arithmetic (...) and show that the theory is a proof-theoretically conservative extension of the theory PT of positive truth. We construct models for the theory and draw some conclusions for the semantics of conceptualist ground. (shrink)

This paper uses a partially ordered set of syntactic categories to accommodate optionality and licensing in natural language syntax. A complex but well-studied data set pertaining to the syntax of quantifier scope and negative polarity licensing in Hungarian is used to illustrate the proposal. The presentation is geared towards both linguists and logicians. The paper highlights that the main ideas can be implemented in different grammar formalisms, and discusses in detail an implementation where the partial ordering on categories is (...) given by the derivability relation of a calculus with residuated and Galois-connected unary operators. (shrink)

Truthmaker monism is the view that the one and only truthmaker is the world. Despite its unpopularity, this view has recently received an admirable defence by Schaffer :307–324, 2010b). Its main defect, I argue, is that it omits partial truthmakers. If we omit partial truthmakers, we lose the intimate connection between a truth and its truthmaker. I further argue that the notion of a minimal truthmaker should be the key notion that plays the role of constraining ontology (...) and that truthmaker monism is not necessary for an appropriate solution to the problem of finding truthmakers for negative truths. I conclude that we should reject truthmaker monism once and for all. (shrink)

This paper gives a new, proof-theoretic explanation of partial-order reasoning about time in a nonmonotonic theory of action. The explanation relies on the technique of lifting ground proof systems to compute results using variables and unification. The ground theory uses argumentation in modal logic for sound and complete reasoning about specifications whose semantics follows Gelfond and Lifschitz’s language. The proof theory of modal logic A represents inertia by rules that can be instantiated by sequences of time steps or events. (...) Lifting such rules introduces string variables and associates each proof with a set of string equations; these equations are equivalent to a set of partial-order tree-constraints that can be solved efficiently. The defeasible occlusion of inertia likewise imposes partial-order constraints in the lifted system. By deriving an auxiliary partial order representation of action from the underlying logic, not the input formulas or proofs found, this paper strengthens the connection between practical planners and formal theories of action. Moreover, the general correctness of the theory of action justifies partial-order representations not only for forward reasoning from a completely specified start state, but also for explanatory reasoning and for reasoning by cases. (shrink)

It is a well-known fact that MV-algebras, the algebraic counterpart of Łukasiewicz logic, correspond to a certain type of partial algebras: lattice-ordered effect algebras fulfilling the Riesz decomposition property. The latter are based on a partial, but cancellative addition, and we may construct from them the representing ℓ-groups in a straightforward manner. In this paper, we consider several logics differing from Łukasiewicz logics in that they contain further connectives: the PŁ-, PŁ'-, PŁ'△-, and ŁΠ-logics. For all their algebraic (...) counterparts, we characterise the corresponding type of partial algebras. We moreover consider the representing f-rings. All in all, we get three-fold correspondences: the total algebras - the partial algebras - the representing rings. (shrink)

Speculation about the evolutionary origins of morality has yet to show how a biologically based capacity for morality might be connected to moral reasoning. Applying an evolutionary approach to three kinds of cases where partiality may or may not be morally reasonable, this paper explores a possible connection between a psychological capacity for morality and processes of wide reflective moral equilibrium. The central hypothesis is that while we might expect a capacity for morality to include aspects of partiality, we (...) might also expect these same aspects of the capacity to produce systemic forms of performance-based error. Understanding these errors helps point the way toward a theory of moral competence that includes aspects of both partiality and impartiality. (shrink)

Bell non-locality and Kochen–Specker contextuality are logically independent concepts, fuel different protocols with quantum vs classical advantage, and have distinct classical simulation costs. A natural question is what are the relations between these concepts, advantages, and costs. To address this question, it is useful to have a map that captures all the connections between Bell non-locality and KS contextuality in quantum theory. The aim of this work is to introduce such a map. After defining the theory-independent notions of Bell non-locality (...) and KS contextuality for ideal measurements, we show that, in quantum theory, due to Neumark’s dilation theorem, every quantum Bell non-local behavior can be mapped to a formally identical KS contextual behavior produced in a scenario with identical relations of compatibility but where measurements are ideal and no space-like separation is required. A more difficult problem is identifying connections in the opposite direction. We show that there are “one-to-one” and partial connections between KS contextual behaviors and Bell non-local behaviors for some KS scenarios, but not for all of them. However, there is also a method that transforms any KS contextual behavior for quantum systems of dimension d into a Bell non-local behavior between two quantum subsystems each of them of dimension d. We collect all these connections in map and list some problems which can benefit from this map. (shrink)

This paper explores the interconnectedness of persons with disabilities, technologies and the environment by problematizing Western notions of the independent, autonomous subject. Drawing from Deleuze and Guattari’s reconfiguration of the static subject as active becoming, prevailing discourses valorizing independence are critiqued as contributing to the marginalization of bodies marked as disabled. Three examples of disability “dependencies”—man-dog, man-machine, and woman-woman connectivities—are used to illustrate that subjectivity is partial and transitory. Disability connectivity thus serves a signpost for an expanded understanding of (...) subjectivity and suggests a radically altered ethics that is no longer premised on individual rights. (shrink)

We analyse the connection between the computability and continuity of functions in the case of homomorphisms between topological algebraic structures. Inspired by the Pour-El and Richards equivalence theorem between computability and boundedness for closed linear operators on Banach spaces, we study the rather general situation of partial homomorphisms between metric partial universal algebras. First, we develop a set of basic notions and results that reveal some of the delicate algebraic, topological and effective properties of partial algebras. (...) Our main computability concepts are based on numerations and include those of effective metric partial algebras and effective partial homomorphisms. We prove a general equivalence theorem that includes a version of the Pour-El and Richards Theorem, and has other applications. Finally, the Pour-El and Richards axioms for computable sequence structures on Banach spaces are generalised to computable partial sequence structures on metric algebras, and we prove their equivalence with our computability model based on numerations. (shrink)

The goal of this paper is to generalize a notion of characteristic (or Jankov) formula by using finite partial Heyting algebras instead of the finite subdirectly irreducible algebras: with every finite partial Heyting algebra we associate a characteristic formula, and we study the properties of these formulas. We prove that any intermediate logic can be axiomatized by such formulas. We further discuss the correlations between characteristic formulas of finite partial algebras and canonical formulas. Then with every well-connected (...) Heyting algebra we associate a set of characteristic formulas that correspond to each finite relative subalgebra of this algebra. Finally, we demonstrate that in many respects these sets enjoy the same properties as regular characteristic formulas. In the last section we outline an approach how to generalize these obtained results to the broad classes of algebras. (shrink)

We analyse the connection between the computability and continuity of functions in the case of homomorphisms between topological algebraic structures. Inspired by the Pour-El and Richards equivalence theorem between computability and boundedness for closed linear operators on Banach spaces, we study the rather general situation of partial homomorphisms between metric partial universal algebras. First, we develop a set of basic notions and results that reveal some of the delicate algebraic, topological and effective properties of partial algebras. (...) Our main computability concepts are based on numerations and include those of effective metric partial algebras and effective partial homomorphisms. We prove a general equivalence theorem that includes a version of the Pour-El and Richards Theorem, and has other applications. Finally, the Pour-El and Richards axioms for computable sequence structures on Banach spaces are generalised to computable partial sequence structures on metric algebras, and we prove their equivalence with our computability model based on numerations. (shrink)

We introduce a family of rank functions and related notions of total transcendence for Galois types in abstract elementary classes. We focus, in particular, on abstract elementary classes satisfying the condition known as tameness, where the connections between stability and total transcendence are most evident. As a byproduct, we obtain a partial upward stability transfer result for tame abstract elementary classes stable in a cardinal $\lambda$ satisfying $\lambda^{\aleph_{0}}\gt \lambda$, a substantial generalization of a result of Baldwin, Kueker, and VanDieren.

According to the preference-centric approach to understanding partial belief, the connection between partial beliefs and preferences is key to understanding what partial beliefs are and how they’re measured. As Ramsey put it, the ‘degree of a belief is a causal property of it, which we can express vaguely as the extent to which we are prepared to act on it’ The Foundations of Mathematics and Other Logical Essays, Routledge, Oxon, pp 156–198, 1931). But this idea is (...) not as popular as it once was. Nowadays, the preference-centric approach is frequently dismissed out-of-hand as behaviouristic, unpalatably anti-realist, and/or prone to devastating counterexamples. Cases like Eriksson and Hájek’s :183–213, 2007) preferenceless Zen monk and Christensen’s :356–376, 2001) other roles argument have suggested to many that any account of partial belief that ties them too closely to preferences is irretrievably flawed. In this paper I provide a defence of preference-centric accounts of partial belief. (shrink)

This paper outlines the process of verbal communication of emotion as this occurs through the phases of the referential process, including arousal of an emotion schema; detailed and specific descriptions of images and episodes that are exemplars of emotion schemas; and reflection and reorganization, which may include emotion labels and other types of categorical terms. The concepts of emotion schemas and the referential process are defined in the theoretical framework of multiple code theory which includes subsymbolic sensory, visceral and motoric (...) processes, symbolic images and words. Emotion schemas are defined as clusters of representations of events incorporating similar bodily, sensory and motoric processes activated in relation to different people in different contexts. Through the referential process subsymbolic components of a schema that have been activated in a speaker or writer and that may be connected only partially to words may be evoked in a listener or reader. The concept of the emotion schemas is examined in relation to current work in emotion theory and neuroscience. The unique effects of detailed descriptions of episodes in conveying complex aspects of emotional experience are discussed, as recognized by writers, and as demonstrated in empirical research. Computerized measures of the phases of the referential process are presented, focusing particularly on the central measure, the Weighted Referential Activity Dictionary which identifies points of narrative and imagery. The operation of the function words that dominate the WRAD are examined in relation to the structure of narrative expression underlying the verbal representation of emotion schemas. (shrink)

An effect algebra is a partial algebraic structure, originally formulated as an algebraic base for unsharp quantum measurements. In this article we present an approach to the study of lattice effect algebras (LEAs) that emphasizes their structure as algebraic models for the semantics of (possibly) non-standard symbolic logics. This is accomplished by focusing on the interplay among conjunction, implication, and negation connectives on LEAs, where the conjunction and implication connectives are related by a residuation law. Special cases of LEAs (...) are MV-algebras and orthomodular lattices. The main result of the paper is a characterization of LEAs in terms of so-called Sasaki algebras. Also, we compare and contrast LEAs, Hájek's BL-algebras, and the basic algebras of Chajda, Halaš, and Kühr. (shrink)

Problems are defined as abstract procedures. An explication of procedures as used in Transparent Intensional Logic and called constructions is presented and the subclass of constructions called concepts is defined. Concepts as closed constructions modulo α- and η-conversion can be associated with meaningful expressions of a natural or professional language in harmony with Church’s conception. Thus every meaningful expression expresses a concept. Since every problem can be unambiguously determined by a concept we can state that every problem is a concept (...) and every concept can be viewed as a problem.Kolmogorov’s idea of a connection between problems and Heyting’s calculus is examined and the non-classical features of the latter are shown to be compatible with realistic logic using partial functions. (shrink)

The classical propositional logic is known to be sound and complete with respect to the set semantics that interprets connectives as set operations. The paper extends propositional language by a new binary modality that corresponds to partial recursive function type constructor under the above interpretation. The cases of deterministic and non-deterministic functions are considered and for both of them semantically complete modal logics are described and decidability of these logics is established.

Background: Electroconvulsive therapy is one of the most effective treatments for major depressive disorder. Recently, there has been increasing attention to evaluate the effect of ECT on resting-state functional magnetic resonance imaging. This study aims to compare rs-fMRI of depressive disorder patients with healthy participants, investigate whether pre-ECT dynamic functional network connectivity network estimated from patients rs-fMRI is associated with an eventual ECT outcome, and explore the effect of ECT on brain network states.Method: Resting-state functional magnetic resonance imaging data were (...) collected from 119 patients with depression or depressive disorder, and 61 healthy participants, with an age mean of 52.25 years old. The pre-ECT and post-ECT Hamilton Depression Rating Scale were 25.59 ± 6.14 and 11.48 ± 9.07, respectively. Twenty-four independent components from default mode and cognitive control network were extracted, using group-independent component analysis from pre-ECT and post-ECT rs-fMRI. Then, the sliding window approach was used to estimate the pre-and post-ECT dFNC of each subject. Next, k-means clustering was separately applied to pre-ECT dFNC and post-ECT dFNC to assess three distinct states from each participant. We calculated the amount of time each subject spends in each state, which is called “occupancy rate” or OCR. Next, we compared OCR values between HC and DEP participants. We also calculated the partial correlation between pre-ECT OCRs and HDRS change while controlling for age, gender, and site. Finally, we evaluated the effectiveness of ECT by comparing pre- and post-ECT OCR of DEP and HC participants.Results: The main findings include depressive disorder patients had significantly lower OCR values than the HC group in state 2, where connectivity between cognitive control network and default mode network was relatively higher than other states, Pre-ECT OCR of state, with more negative connectivity between CCN and DMN components, is linked with the HDRS changes. This means that those DEP patients who spent less time in this state showed more HDRS change, and The post-ECT OCR analysis suggested that ECT increased the amount of time DEP patients spent in state 2.Conclusion: Our finding suggests that dynamic functional network connectivity features, estimated from CCN and DMN, show promise as a predictive biomarker of the ECT outcome of DEP patients. Also, this study identifies a possible underlying mechanism associated with the ECT effect on DEP patients. (shrink)

Two stages of the creative writing process were characterized through mobile scalp electroencephalography in a 16-week creative writing workshop. Portable dry EEG systems with synchronized head acceleration, video recordings, and journal entries, recorded mobile brain-body activity of Spanish heritage students. Each student's brain-body activity was recorded as they experienced spaces in Houston, Texas, and while they worked on their creative texts. We used Generalized Partial Directed Coherence to compare the functional connectivity among both stages. There was a trend of (...) higher gPDC in the Preparation stage from right temporo-parietal to left anterior-frontal brain scalp areas within 1–50 Hz, not reaching statistical significance. The opposite directionality was found for the Generation stage, with statistical significant differences restricted to the delta band. There was statistically higher gPDC observed for the inter-hemispheric connections AF07–AF08 in the delta and theta bands, and AF08 to TP09 in the alpha and beta bands. The left anterior-frontal recordings showed higher power localized to the gamma band for the Generation stage. An ancillary analysis of Sample Entropy did not show significant difference. The information transfer from anterior-frontal to temporal-parietal areas of the scalp may reflect multisensory interpretation during the Preparation stage, while brain signals originating at temporal-parietal toward frontal locations during the Generation stage may reflect the final decision making process to translate the multisensory experience into a creative text. (shrink)

The nature of truth has occupied philosophers since the very beginning of the field. Our goal is to clarify the notion of scientific truth, in particular the notion of partial truth of facts. Our strategy consists to brake the problem into smaller, more manageable, questions. Thus, we distinguish the truth of a scientific theory, what we call the "global" truth value of a theory, from the truth of a particular scientific proposition, what we call the "local" truth values of (...) a theory. We will present a new local theory of partial truth and will have few things to say about the global level. Moreover, we will also introduce some purely formal results, the most important being the introduction of a new class of algebraic structures which have some interesting connections with classical logic. (shrink)

The problem of the interpretation of theoretical terms is outlined, and some difficulties connected with the distinction between partial definitions and empirical postulates are discussed. A reconstruction is sketched which is intended to explicate the 'definitional' character of partial definitions. Finally, some implications for the methodology of theory construction are indicated.

We study the partial orderings of the form ⟨P,⊂⟩\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\langle \mathbb{P}, \subset\rangle}$$\end{document}, where X\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb{X}}$$\end{document} is a binary relational structure with the connectivity components isomorphic to a strongly connected structure Y\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb{Y}}$$\end{document} and P\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb{P} }$$\end{document} is the set of substructures of X\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} (...) \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb {X}}$$\end{document} isomorphic to X\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb{X}}$$\end{document}. We show that, for example, for a countable X\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb{X}}$$\end{document}, the poset ⟨P,⊂⟩\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\langle \mathbb {P}, \subset\rangle}$$\end{document} is either isomorphic to a finite power of P\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb{P} }$$\end{document} or forcing equivalent to a separative atomless σ-closed poset and, consistently, to P/fin. In particular, this holds for each ultrahomogeneous structure X\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb{X}}$$\end{document} such that X\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb{X}}$$\end{document} or Xc\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb{X}^{c}}$$\end{document} is a disconnected structure and in this case Y\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb{Y}}$$\end{document} can be replaced by an ultrahomogeneous connected digraph. (shrink)