Let ⪯R be the preorder of embeddability between countable linear orders colored with elements of Rado's partial order . We show that ⪯R has fairly high complexity with respect to Borel reducibility , although its exact classification remains open.

We study the complexity of infinite chains and antichains in computable partial orderings. We show that there is a computable partial ordering which has an infinite chain but none that is ${\Sigma _{1}^{1}}$ or ${\Pi _{1}^{1}}$ , and also obtain the analogous result for antichains. On the other hand, we show that every computable partial ordering which has an infinite chain must have an infinite chain that is the difference of two ${\Pi _{1}^{1}}$ sets. Our main result (...) is that there is a computably axiomatizable theory K of partial orderings such that K has a computable model with arbitrarily long finite chains but no computable model with an infinite chain. We also prove the corresponding result for antichains. Finally, we prove that if a computable partial ordering ${\mathcal{A}}$ has the feature that for every ${\mathcal{B} \cong \mathcal{A}}$ , there is an infinite chain or antichain that is ${\Delta _{2}^{0}}$ relative to ${\mathcal{B}}$ , then we have uniform dichotomy: either for all copies ${\mathcal{B}}$ of ${\mathcal{A}}$ , there is an infinite chain that is ${\Delta _{2}^{0}}$ relative to ${\mathcal{B}}$ , or for all copies ${\mathcal{B}}$ of ${\mathcal{A}}$ , there is an infinite antichain that is ${\Delta _{2}^{0}}$ relative to ${\mathcal{B}}$. (shrink)

Emotional stimuli (e.g. words, images) are often remembered better than neutral stimuli. However, little is known about how memory is affected by an environmentally induced emotional state (without any overtly emotional occurrences) – the focus of this study. Participants were randomly assigned to discovery (n = 305) and replication (n = 306) subsamples and viewed a desktop virtual environment before rating their emotions and completing objective (i.e. item, temporal-order, duration) and subjective (e.g. vividness, sensory detail, coherence) memory measures. In (...) both samples, a Partial Least Squares Correlation analysis showed that an emotional state characterised by high negative emotion (i.e. threat, fear, anxiety) and arousal was reliably associated with better memory in both objective (i.e. item) and subjective (i.e. vividness and sensory detail) domains. No reliable associations were observed for any temporal memory measures (objective or subjective). Thus, an environmentally induced state of negative emotion corresponds with enhanced memory for indices of episodic memory pertaining to “what” happened, but not necessarily “when” it happened. (shrink)

By constructing a maximal incomplete d.r.e. degree, the nondensity of the partial order of the d.r.e. degrees is established. An easy modification yields the nondensity of the n-r.e. degrees and of the ω-r.e. degrees.

Significant research has been devoted to detecting people in images and videos. In this paper we describe a human de- tection method that augments widely used edge-based fea- tures with texture and color information, providing us with a much richer descriptor set. This augmentation results in an extremely high-dimensional feature space (more than 170,000 dimensions). In such high-dimensional spaces, classical machine learning algorithms such as SVMs are nearly intractable with respect to training. Furthermore, the number of training samples is much (...) smaller than the dimensionality of the feature space, by at least an order of magnitude. Finally, the extraction of features from a densely sampled grid structure leads to a high degree of multicollinearity. To circumvent these data characteristics, we employ Partial Least Squares (PLS) analysis, an effi- cient dimensionality reduction technique, one which pre- serves significant discriminative information, to project the data onto a much lower dimensional subspace (20 dimen- sions, reduced from the original 170,000). Our human de- tection system, employing PLS analysis over the enriched descriptor set, is shown to outperform state-of-the-art tech- niques on three varied datasets including the popular INRIA pedestrian dataset, the low-resolution gray-scale Daim- lerChrysler pedestrian dataset, and the ETHZ pedestrian dataset consisting of full-length videos of crowded scenes. (shrink)

In the study of categories whose morphisms display a behaviour similar to that of partial functions, the concept of morphism domain is, obviously, central. In this paper an operation defined on morphisms describes those properties which are related to morphisms being regarded as abstractions of partial functions. This operation allows us to characterise the morphism domains directly, and gives rise to an algebra defined by a simple set of identities. No product-like categorical structures are needed therefore. We also (...) develop the construction of topologies together with the notion of continuous morphism, in order to test the effectiveness of this approach. It is interesting to see how much of the computational character of the morphisms is translated into continuity. (shrink)

By constructing a maximal incomplete d.r.e. degree, the nondensity of the partial order of the d.r.e. degrees is established. An easy modification yields the nondensity of the n-r.e. degrees and of the ω-r.e. degrees.

The demand of many scientific areas for the usage of fractional partial differential equations to explain their real-world systems has been broadly identified. The solutions may portray dynamical behaviors of various particles such as chemicals and cells. The desire of obtaining approximate solutions to treat these equations aims to overcome the mathematical complexity of modeling the relevant phenomena in nature. This research proposes a promising approximate-analytical scheme that is an accurate technique for solving a variety of noninteger partial (...) differential equations. The proposed strategy is based on approximating the derivative of fractional-order and reducing the problem to the corresponding partial differential equation. Afterwards, the approximating PDE is solved by using a separation-variables technique. The method can be simply applied to nonhomogeneous problems and is proficient to diminish the span of computational cost as well as achieving an approximate-analytical solution that is in excellent concurrence with the exact solution of the original problem. In addition and to demonstrate the efficiency of the method, it compares with two finite difference methods including a nonstandard finite difference method and standard finite difference technique, which are popular in the literature for solving engineering problems. (shrink)

This paper argues for a comprehensive conception of empathy as comprising epistemic, affective, and motivational elements and introduces the ancient Stoic theory of attachment as a model for describing the embodied, emotional response to others that we take to be distinctive of empathy. Our argument entails that in order to provide a suitable conceptual framework for the interdisciplinary study of empathy one must extend the scope of recent “simulationalist” and “enactivist” accounts of empathy in two important respects. First, against (...) the enactivist assumption that human mindreading capacities primarily rely on an immediate, quasi-perceptual understanding of other’s intentional states, we draw on Alfred Schutz’ analysis of social understanding to argue that reflective types of understanding play a distinct, but equally fundamental role in empathic engagements. Second, we insist that empathy also involves an affective response toward the other and their situation. We suggest analyzing this response in terms of the Stoic concepts of attachment, concern, and a fundamental type of prosocial motivation, that can best be described as an “extended partiality.” By way of conclusion, we integrate the above concepts into a comprehensive conceptual framework for the study of empathy and briefly relate them to current debates about empathic perception and prosocial motivation. The result, we argue, is an account that stays neutral with regard to the exact nature of the processes involved in producing empathy and can therefore accommodate discussion across theoretical divides—e.g., those between enactivist, simulationalist, and so-called theory-theorist approaches. (shrink)

I advance a decision principle called the "weak dominance principle" (WDP) based on the interval notion of probability to deal with the Ellsberg type paradox (ETP). Given ETP, I explain three things: (i) Why WDP is a better principle than many principles e.g. Kyburg's principle and Gardenfors and Sahlin's principle, (ii) Why one should not, contrary to many principles, expect a unique solution in ETP, and (iii) What is the relationship between WDP and the principles mentioned above. I prove also (...) that WDP induces a strict partial ordering on the intervals to which it is applied. (shrink)

The aim of this paper is to criticise the well-discussed Principle of Procreative Beneficence (PB) lately refined by Julian Savulescu and Guy Kahane. First, it is argued that advocates of PB leave us with an implausible justification for the moral partiality towards the child (or children) reproducers decide to bring into existence as compared with all other individuals. This is implausible because the reasons given in favour of the partiality of PB, which are based on practical reason and common-sense morality, (...) can just as well be used to guide reproducers to make choices that do not support partiality towards one’s possible children. This seems to be true as least in some situations. Secondly, it is argued that Jakob Elster’s recent critique of PB is problematic, and specifically that a counterexample designed by Elster to criticise PB because of its partiality towards one’s own children misses the target. Finally, a genuine counterexample to PB is developed in order to show that the partiality of PB means it gives the wrong answer in a specific case. (shrink)

Robotic and Autonomous Agricultural Technologies (RAAT) are increasingly available yet may fail to be adopted. This paper focusses specifically on cognitive factors that affect adoption including: inability to generate trust, loss of farming knowledge and reduced social cognition. It is recommended that agriculture develops its own framework for the performance and safety of RAAT drawing on human factors research in aerospace engineering including human inputs (individual variance in knowledge, skills, abilities, preferences, needs and traits), trust, situational awareness and cognitive load. (...) The kinds of cognitive impacts depend on the RAATs level of autonomy, ie whether it has automatic, partial autonomy and autonomous functionality and stage of adoption, ie adoption, initial use or post-adoptive use. The more autonomous a system is, the less a human needs to know to operate it and the less the cognitive load, but it also means farmers have less situational awareness about on farm activities that in turn may affect strategic decision-making about their enterprise. Some cognitive factors may be hidden when RAAT is first adopted but play a greater role during prolonged or intense post-adoptive use. Systems with partial autonomy need intuitive user interfaces, engaging system information, and clear signaling to be trusted with low level tasks; and to compliment and augment high order decision-making on farm. (shrink)

This paper defends partiality as an inherent, essential part of ethical decision-making. First, the concept of charity as a kind of universal benevolence is spelled out, drawing on key ideas from classical religious thinking. I then argue that any justification of partiality must appeal to the good first, rather than rights. There follows a justification of partiality via an argument from the idea of control over the good. The next section seeks to harmonize partialistic preference with universal charity, explaining the (...) concept of love of neighbour. There follows an outline of the key principles required for setting out an order of charity based on different kinds of special relationship. While not all of this theistically driven approach to the order of charity translates easily into secular moral thought, enough does to suggest that the view defended is at the least worthy of consideration and not to be dismissed lightly. At best, it has much in it that is commendable to secular common sense. (shrink)

We study the relationship between algebraic structures and their inverse semigroups of partial automorphisms. We consider a variety of classes of natural structures including equivalence structures, orderings, Boolean algebras, and relatively complemented distributive lattices. For certain subsemigroups of these inverse semigroups, isomorphism of the subsemigroups yields isomorphism of the underlying structures. We also prove that for some classes of computable structures, we can reconstruct a computable structure, up to computable isomorphism, from the isomorphism type of its inverse semigroup of (...) computable partial automorphisms. (shrink)

We describe a knowledge representation and inference formalism, based on an intensional propositional semantic network, in which variables are structures terms consisting of quantifier, type, and other information. This has three important consequences for natural language processing. First, this leads to an extended, more natural formalism whose use and representations are consistent with the use of variables in natural language in two ways: the structure of representations mirrors the structure of the language and allows re-use phenomena such as pronouns and (...) ellipsis. Second, the formalism allows the specification of description subsumption as a partial ordering on related concepts (variable nodes in a semantic network) that relates more general concepts to more specific instances of that concept, as is done in language. Finally, this structured variable representation simplifies the resolution of some representational difficulties with certain classes of natural language sentences, namely, donkey sentences and sentences involving branching quantifiers. The implementation of this formalism is called ANALOG (A NAtural LOGIC) and its utility for natural language processing tasks is illustrated. (shrink)

The model theoretic `back and forth' construction of isomorphisms and automorphisms is based on the proof by Cantor that the theory of dense linear orderings without endpoints is ℵ 0 -categorical. However, Cantor's method is slightly different and for many other structures it yields an injection which is not surjective. The purpose here is to examine Cantor's method (here called `going forth') and to determine when it works and when it fails. Partial answers to this question are found, extending (...) those earlier given by Cameron. We also give fuller characterisations of when forth suffices for model theoretic classes such as structures containing Jordan sets for the automorphism group, and ℵ 0 -categorical ω-stable structures. The work is based on the author's Ph.D. thesis. (shrink)

A structure ${\mathbb Y}$ of a relational language L is called almost chainable iff there are a finite set $F \subset Y$ and a linear order $\,<$ on the set $Y\setminus F$ such that for each partial automorphism $\varphi $ of the linear order $\langle Y\setminus F, <\rangle $ the mapping $\mathop {\mathrm {id}}\nolimits _F \cup \varphi $ is a partial automorphism of ${\mathbb Y}$. By theorems of Fraïssé and Pouzet, an infinite structure ${\mathbb Y}$ is (...) almost chainable iff the profile of ${\mathbb Y}$ is bounded; namely, iff there is a positive integer m such that ${\mathbb Y}$ has $\leq m$ non-isomorphic substructures of size n, for each positive integer n. A complete first order L-theory ${\mathcal T}$ having infinite models is called almost chainable iff all models of ${\mathcal T}$ are almost chainable and it is shown that the last condition is equivalent to the existence of one countable almost chainable model of ${\mathcal T}$. In addition, it is proved that an almost chainable theory has either one or continuum many non-isomorphic countable models and, thus, the Vaught conjecture is confirmed for almost chainable theories. (shrink)

We investigate the partial orderings of the form 〈P(X),⊂〉\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}(\mathbb{X}), \subset \rangle}$$\end{document}, where X=〈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} =\langle X, \rho \rangle }$$\end{document} is a countable binary relational structure and P(X)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb{P} (\mathbb{X})}$$\end{document} the set of the domains of its isomorphic substructures and show that if the components 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} are maximally embeddable and satisfy an additional condition related to connectivity, then the poset 〈P(X),⊂〉\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} (\mathbb{X}), \subset \rangle }$$\end{document} is forcing equivalent to a finite power of (P(ω)/ Fin)+, or to the poset (P(ω × ω)/(fin × Fin))+, or to the product (P(Δ)/EDfin)+×((P(ω)/Fin)+)n\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${(P(\Delta )/\fancyscript{e}\fancyscript{d}_{\rm fin})^+ \times ((P(\omega )/{\rm Fin})^+)^n}$$\end{document}, for some n∈ω\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${n \in \omega}$$\end{document}. In particular we obtain forcing equivalents of the posets of copies of countable equivalence relations, disconnected ultrahomogeneous graphs and some partial orderings. (shrink)

We announce two new dichotomy theorems for Borel equivalence relations, and present the results in context by giving an overview of related recent developments.§1. Introduction. For X a Polish space and E a Borel equivalence relation on X, a classification of X up to E-equivalence consists of finding a set of invariants I and a map c : X → I such that xEy ⇔ c = c. To be of any value we would expect I and c to be (...) “explicit” or “definable”. The theory of Borel equivalence relations investigates the nature of possible invariants and provides a hierarchy of notions of classification.The following partial ordering is fundamental in organizing this study. Given equivalence relations E and F on X and Y, resp., we say that E can be Borel reduced to F, in symbolsif there is a Borel map f : X → Y with xEy ⇔ fFf. Then if is an embedding of X/E into Y/F, which is “Borel”.Intuitively, E ≤BF might be interpreted in any one of the following ways: The classi.cation problem for E is simpler than that of F: any invariants for F work as well for E. One can classify E by using as invariants F-equivalence classes. The quotient space X/E has “Borel cardinality” less than or equal to that of Y/F, in the sense that there is a “Borel” embedding of X/E into Y/F. (shrink)

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)

Increasing interest in applying the theory and practice of deliberative democracy to new and varied political contexts leads us to ask whether or not deliberation is a universal political practice. While deliberation does manifest a universal competence, its character varies substantially across time and space, a variation partially explicable in cultural terms. We deploy an intersubjective conception of culture in order to explore these differences. Culture meets deliberation where publicly accessible meanings, symbols, and norms shape the way political actors (...) engage one another in discourse. Fuller understanding of political deliberation requires comparative and historical studies of particular contexts. We look at one case from Egypt in some depth and provide shorter illustrations from Botswana, Europe, India, Japan, Madagascar, the United States, Yemen, and elsewhere. Cross-cultural learning can enrich the theory of deliberative democracy, and give democratic theory a more universal reach. (shrink)

Do the partial order and ortholattice operations of a quantum logic correspond to the logical implication and connectives of classical logic? Rephrased, How far might a classical understanding of quantum mechanics be, in principle, possible? A celebrated result of Kochen and Specker answers the above question in the negative. However, this answer is just one among various possible ones, not all negative. It is our aim to discuss the above question in terms of mappings of quantum worlds into (...) classical ones, more specifically, in terms of embeddings of quantum logics into classical logics; depending upon the type of restrictions imposed on embeddings, the question may get negative or positive answers. (shrink)

We consider embeddings of structures which preserve spectra: if g: M → S with S computable, then M should have the same Turing degree spectrum (as a structure) that g(M) has (as a relation on S). We show that the computable dense linear order L is universal for all countable linear orders under this notion of embedding, and we establish a similar result for the computable random graph G. Such structures are said to be spectrally universal. We use our (...) results to answer a question of Goncharov, and also to characterize the possible spectra of structures as precisely the spectra of unary relations on G. Finally, we consider the extent to which all spectra of unary relations on the structure L may be realized by such embeddings, offering partial results and building the first known example of a structure whose spectrum contains precisely those degrees c with c′ ≥T 0″. (shrink)

I want to examine the implications of a metaphysical thesis which is presupposed in various objections to Rawls' theory of justice.Although their criticisms differ in many respects, they concur in employing what I shall refer to as the continuity thesis. This consists of the following claims conjointly: (1) The parties in the original position (henceforth the OP) are, and know themselves to be, fully mature persons who will be among the members of the well-ordered society (henceforth the WOS) which is (...) generated by their choice of principles of justice. (2) The OP is a conscious event among others, integrated (compatibly with the constraints on knowledge and motivation imposed on the parties) into the regular continuity of experience that comprises each of their ongoing constitutes lives. (3) The parties in the OP thus are, and regard themselves as, psychologically continuing persons, partially determined in personality and interests by prior experiences, capable of recollection and regret concerning the past, anticipation and apprehensiveness regarding the future, and so on. Although the continuity thesis as stated above is not at odds with any of the conditions that define the OP, its exegetical validity is a matter for discussion. I shall be concerned to argue that if it is indeed contained in or a consequence of Rawls' theory, then it casts into doubt the capacity of the OP to generate or justify any principles of justice at all. On the other hand, if the continuity thesis is viewed as dispensable and unnecessary to the Rawlsian enterprise, then Rawls is correct in maintaining the irrelevance of the question of personal identity to the construction of his moral theory. In this case, the contract-theoretic, instrumentalist justification for the two principles of justice (henceforth the 2PJ) needs to be supplanted by a modified conception of wide reflective equilibrium. The considerations that form the bulk of this discussion then may be understood as providing a rationale for Rawls' recent revisions in the model of justification on which his theory of justice rests, and for his increasing emphasis on us as moral mediators between the OP and the WOS. Now I want to consider the question of whether or not, given the textual evidence, anything like the continuity thesis is stated or implied by Rawls, and what problems for his theory, if any, turn on a positive or negative answer to this question. -/- . (shrink)

We examine the Dual Ramsey Theorem and two related combinatorial principles VW(k,l) and OVW(k,l) from the perspectives of reverse mathematics and effective mathematics. We give a statement of the Dual Ramsey Theorem for open colorings in second order arithmetic and formalize work of Carlson and Simpson [1] to show that this statement implies ACA 0 over RCA 0 . We show that neither VW(2,2) nor OVW(2,2) is provable in WKL 0 . These results give partial answers to questions (...) posed by Friedman and Simpson [3]. (shrink)

We investigate possible cardinalities of maximal antichains in the poset of copies \,\subseteq \rangle \) of a countable ultrahomogeneous relational structure \. It turns out that if the age of \ has the strong amalgamation property, then, defining a copy of \ to be large iff it has infinite intersection with each orbit of \, the structure \ can be partitioned into countably many large copies, there are almost disjoint families of large copies of size continuum and, hence, there are (...) antichains of size continuum in the poset \\). Finally, we show that the posets of copies of all countable ultrahomogeneous partial orders contain maximal antichains of cardinality continuum and determine which of them contain countable maximal antichains. That holds, in particular, for the generic poset. (shrink)

Let κ be a regular cardinal and P a partial ordering preserving the regularity of κ. If P is (κ-Baire and) of density κ, then there is a mad family on κ killed in all generic extensions (if and) only if below each p∈P there exists a κ-sized antichain. In this case a mad family on κ is killed (if and) only if there exists an injection from κ onto a dense subset of Ult(P) mapping the elements of onto (...) nowhere dense sets. If 2< κ =κ, then in each generic extension of V, in which κ is the minimal cardinal obtaining new subsets, some mad family on κ is killed or an independent subset of κ appears. Also, the κ-Suslin Hypothesis holds iff there exists a mad family on κ which is killed in each generic extension containing new subsets of κ and preserving P(λ) for λ<κ. (shrink)

Castañeda offers a linguistically anchored approach to ontology entitled empirical semantico-syntactical structuralism. The entry to phenomenological ontology, or primary ontology, is natural language semantico-syntactical contrasts within given idiolects. The order of ontological inquiry, whose analogy with scientific method is stressed, is the following: 1) Proto-philosophy involves collecting and exegesizing empirical and semantico-syntactical data. 2) Sym-philosophy consists of hypothesizing connections between such data, proposing a theory concerning a given pattern, testing a theory by deduction concerning its ad hoc validity, establishing (...) its fecundity by testing against new data, and replicating the entire process in an attempt to embed the theory in a more comprehensive one. 3) Dia-philosophy involves studying partial isomorphisms and structural constants between theories which constitute the most basic structure of the world and experience. 4) Meta-philosophy, illustrated by the present work, and whose presuppositions address the relation between thinking and symbolism, concerns philosophical method. The fewer such presuppositions the more encompassing and fundamental the ontology. (shrink)

Modern moral and political philosophy is in debt with natural law theory, both in its ancient and mediaeval elaborations. While the very notion of a natural law has proved highly controversial among 20th Century scholars, the last decades have witnessed a renewed interest in it. Indeed, the threats and challenges as result of multiculturalism, plural societies and global changes have generated a renewed attention to natural law theory. Clearly, it offers solid basis as possible framework to a better understanding of (...) human goods without contradictions and partial bias. The purpose of the present volume is to provide an overview of the history of this concept (Cicero, St. Paul, Aquinas, Melanchthon, Montaigne, Descartes, Leibniz, Hume, Burke, Kant, MacIntyre, etc.) as well as a deep understanding of ongoing research, both in Europe and in America. Furthermore, the specificity of these studies will be of particular value to philosophers, law-philosophers, historians, anthropologists, sociologists and theologians, and those concerned on such issues as the relation between law and moral norm, law and practical reason, and the presence of the idea of natural law in several prominent thinkers. It includes a selected bibliography on natural law. The book also provides an excellent introduction to several of the major topics in natural law theory making it useful both as a reference text and as a sourcebook for academics alike. Natural law is a rich, complex, and highly disputed term. Since its first appearances in the history of Western civilization, it has been used both to point to God as the source of the moral order and to assert that there is an objective order of justice in nature that men and their laws ought to respect. In modern times, natural law theory gave birth to what we usually call "human rights." Unlike the meaning of the term, the importance of an ongoing debate on natural law and on the theories related to it is undisputable. This is why I welcome today this new collection of essays edited by Alejandro Nèstor Garcìa Martìnez, Mario Å ilar and Josè M. Torralba. Natural Law: Historical, Systematic and Juridical Approaches includes a wide variety of studies, covering key authors and issues in natural law theory. Younger students will appreciate the clarity of the chapters, and more trained readers the detailed and accurate bibliographical references that each of them offers. The editors's choice to go from a historical approach to contemporary theories, and then to theoretical and more practical issues is also commendable. Students in philosophy and in legal theory will greatly benefit from this book. Fulvio Di Blasi, author of God and the Natural Law: A Rereading of Thomas Aquinas. (shrink)

Music as a narrative drama is an intriguing idea, which has captured explicit music theoretical attention since the nineteenth century. Investigations into narrative characters or personae has evolved into a sub-field--musical agency. In this book, Palfy contends that music has the potential to engage us in social processes and that those processes can be experienced as a social interaction with a musical agent. She explores the overlap between the psychological processes in which we participate in order to understand and (...) engage with people, and those we engage in when we listen to music. Thinking of musical agency as a form of social process is quite different from existing theoretical frameworks for agency. It implies that we come to musical analysis by way of intuition--that our ideas are already partially formed based on our experience of the piece (and what it makes us feel or how it makes us sense it as any other) when we choose to analyze and interpret it. Palfy's focus on social processes is a very effective way to pinpoint when and why it is that our attention is captured and engaged by musical agents. (shrink)

After a section of Methodological Preliminaries, I consider Truth and Argumentation in the Jewish Legal Tradition, under the following subheadings: Truth in Judaism, Truth and Norms, Truth and Language, Truth and Logic, Truth and Argumentation. I thus use an external framework in order to pose questions to the Jewish legal tradition, and identify internal resources which may provide partial answers to these questions. But are these partial answers so peculiar, theological, culturally contingent as to lack any value (...) in terms of a potential contribution to these same issues as posed within Western jurisprudence? This may be doubted, given the West’s adoption or construction of the divine right of kings on the one hand and of holistic theories of interpretation on the other, derived from the Bible and later Jewish tradition, mediated and fortified through a Christianised Rome. (shrink)

The common notion of artifacts characterizes them as the products of successful activities of their makers, guided by intentions that such objects would instantiate certain features, such as their specific functions. Many counterexamples, however, reveal the unsuitability of the common notion. In the face of this acknowledgment, the paper explores the possibility that features of artifacts, and more specifically, the possession of their functions, may arise, at least partially, from collective assignments. In order to achieve the mentioned goal, the (...) paper critically examines some notions and theses put forward by John Searle and others. Its main result, however, consists in offering and elucidating an original thesis, namely, that the functions of many artifacts would be maintained, partially, by forms of continuous collective intentionality, which can involve conscious or unconscious, active or inactive collective intentional states. Keywords: Artifacts, assignment of function, collective intentionality, maintenance of function. (shrink)

We announce two new dichotomy theorems for Borel equivalence relations, and present the results in context by giving an overview of related recent developments.§1. Introduction. For X a Polish space and E a Borel equivalence relation on X, a classification of X up to E-equivalence consists of finding a set of invariants I and a map c : X → I such that xEy ⇔ c = c. To be of any value we would expect I and c to be (...) “explicit” or “definable”. The theory of Borel equivalence relations investigates the nature of possible invariants and provides a hierarchy of notions of classification.The following partial ordering is fundamental in organizing this study. Given equivalence relations E and F on X and Y, resp., we say that E can be Borel reduced to F, in symbolsif there is a Borel map f : X → Y with xEy ⇔ fFf. Then if is an embedding of X/E into Y/F, which is “Borel”.Intuitively, E ≤BF might be interpreted in any one of the following ways: The classi.cation problem for E is simpler than that of F: any invariants for F work as well for E. One can classify E by using as invariants F-equivalence classes. The quotient space X/E has “Borel cardinality” less than or equal to that of Y/F, in the sense that there is a “Borel” embedding of X/E into Y/F. (shrink)

Query processing in ground definite deductive is known to correspond precisely to a linear programming problem. However, the “groundedness” requirement is a huge drawback to using linear programming techniques for logic program computations because the ground version of a logic program can be very large when compared to the original program. Furthermore, when we move from propositional logic programs to first-order logic programs, this effectively means that functions symbols may not occur in clauses. In this paper, we develop a (...) theory of “instantiate- by-need” that performs instantiations only when needed. We prove that this method is sound and complete when computing answer substitutions for non-ground logic programs including those containing function symbols. More importantly, when taken in conjunction with Colmerauer's result that unification can be viewed as linear programming, this means that resolution with unification can be completely replaced by linear programming as an operational paradigm. Additionally, our tree construction method is not rigidly tied to the linear programming paradigm-we will show that given any method M that can compute the set of atomic logical consequences of a propositional logic program, our method can use M to compute , the set of all atoms that are consequences of a first-order logic program. (shrink)

The aim of this paper is to investigate the flow of MHD mixed convection nanofluid flow under nonlinear heated due to an extending surface. The transfer of heat in nanofluid subject to a magnetic field and boundary conditions of convective is studied to obtain the physical meaning of the convection phenomenon. The governing partial differential equations of the boundary layer are reduced to ordinary differential equations considering a technique of the transformation of similarity. The transformed equations are solved numerically (...) considering the technique of an efficient numerical shooting applying the Runge–Kutta technique scheme from the fourth-fifth order. The results corresponding to the dimensionless speed, temperature, concentration profiles, and the Nusselt number reduced, and the Sherwood numbers are presented by figures to display the physical meaning of the phenomena. A comparison has been made between the obtained results with the previous results obtained by others and agrees with them if the new parameters vanish. The results obtained indicate the impacts of the nondimensional governing parameters, namely, magnetic field parameter M, Soret number Sr, heat source λ, thermal buoyancy parameter λ T, and solutal buoyancy parameter λ C on the flow, temperature, and concentration profiles being discussed and presented graphically. (shrink)

Although cities were given no role in the constitutional order of the United States, the new nation posed the same potential threats to the accumulation of capital and wealth as European monarchs posed to long-powerful urban centers. In mobilizing for self-protection and advancement, American business developed new practices and discourses of citizenship that sustained a central role for the community as the locus of social provision. The strategy combined opportunity-hoarding through restricted membership in civic groups and obligation-hoarding through the (...) alignment of diverse networks of voluntarism with this civic core. The linkage of business interests to this hybrid charitable-civic configuration constituted a source of resistance to nationalizing tendencies driven by demands for social protection. This alternative model of social provision and civic organization sustained a distinctive pattern of political membership and state development. By fiercely defending the capacity of privately governed civic networks to provide substantial social support, this history of business influence through community organizations lives on in the partial and fragmented character of the American welfare state. (shrink)

Interest surges in a distinctively metaphysical notion of ground. But a Schism has emerged between Orthodoxy’s view of ground as inducing a strict partial order structure on reality and Heresy’s rejection of this view. What’s at stake is the structure of reality (for proponents of ground), or even ground itself (for those who think this Schism casts doubt upon its coherence). I defend Orthodoxy against Heresy.

Following Henkin's discovery of partially-ordered (branching) quantification (POQ) with standard quantifiers in 1959, philosophers of language have attempted to extend his definition to POQ with generalized quantifiers. In this paper I propose a general definition of POQ with 1-place generalized quantifiers of the simplest kind: namely, predicative, or "cardinality" quantifiers, e.g., "most", "few", "finitely many", "exactly α", where α is any cardinal, etc. The definition is obtained in a series of generalizations, extending the original, Henkin definition first to a general (...) definition of monotone-increasing (M↑) POQ and then to a general definition of generalized POQ, regardless of monotonicity. The extension is based on (i) Barwise's 1979 analysis of the basic case of M↑ POQ and (ii) my 1990 analysis of the basic case of generalized POQ. POQ is a non-compositional Ist-order structure, hence the problem of extending the definition of the basic case to a general definition is not trivial. The paper concludes with a sample of applications to natural and mathematical languages. (shrink)

We prove in set theory without the Axiom of Choice, that Rado’s selection lemma (\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbf{RL}}$$\end{document}) implies the Hahn-Banach axiom. We also prove that \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbf{RL}}$$\end{document} is equivalent to several consequences of the Tychonov theorem for compact Hausdorff spaces: in particular, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbf{RL}}$$\end{document} implies that every filter on a well orderable set is included in a ultrafilter. (...) In set theory with atoms, the “Multiple Choice” axiom implies \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbf{RL}}$$\end{document}. (shrink)

Following Henkin’s discovery of partially-ordered (branching) quantification (POQ) with standard quantifiers in 1959, philosophers of language have attempted to extend his definition to POQ with generalized quantifiers. In this paper I propose a general definition of POQ with 1-place generalized quantifiers of the simplest kind: namely, predicative, or “cardinality” quantifiers, e.g., “most”, “few”, “finitely many”, “exactly α ”, where α is any cardinal, etc. The definition is obtained in a series of generalizations, extending the original, Henkin definition first to a (...) general definition of monotone-increasing (M↑) POQ and then to a general definition of generalized POQ, regardless of monotonicity. The extension is based on (i) Barwise’s 1979 analysis of the basic case of M↑ POQ and (ii) my 1990 analysis of the basic case of generalized POQ. POQ is a non-compositional 1st-order structure, hence the problem of extending the definition of the basic case to a general definition is not trivial. The paper concludes with a sample of applications to natural and mathematical languages. (shrink)

No theory of a partially ordered set of finite width has the independence property, generalizing Poizat's corresponding result for linearly ordered sets. In fact, a question of Poizat concerning linearly ordered sets is answered by showing, moreover, that no theory of a partially ordered set of finite width has the multi-order property. It then follows that a distributive lattice is not finite-dimensional $\operatorname{iff}$ its theory has the independence property $\operatorname{iff}$ its theory has the multi-order property.