I show that the partial truth of a sentence in a partial structure is equivalent to the truth of that sentence in an expansion of a structure that corresponds naturally to the partial structure. Further, a mapping is a partial homomorphism/partial isomorphism between two partial structures if and only if it is a homomorphism/isomorphism between their corresponding structures. It is a corollary that the partial truth of a sentence in a (...) class='Hi'>partial structure is equivalent to the truth of a specific Ramsey sentence in a corresponding structure. Hence the partial structures approach can be expressed in standard first or second-order model theory, and it can be captured in the received view on scientific theories as developed by Carnap and Hempel. (shrink)

Based on neo-institutional literature, this article aims to show the influence of organizational isomorphism on corruption. The focus is institutional explanations of corruption. Our model is based on empirical research in Russia at the end of the 1990s. A face-to-face questionnaire was conducted with 552 top executives in private firms across various economic sectors. We used the structural equation model Partial Least Squares, PLS, technique to test our hypotheses. The developed model provides an integrated approach to the study (...) of the relationship between corruption and organizational isomorphism. Our empirical data from firms in Russia allowed us to test various theoretical hypotheses concerning the influence of organizational isomorphism on corruption. Our emphasis is on the influence of competitive and institutional isomorphism on corruption. (shrink)

We give the first systematic study of strong isomorphism reductions, a notion of reduction more appropriate than polynomial time reduction when, for example, comparing the computational complexity of the isomorphim problem for different classes of structures. We show that the partial ordering of its degrees is quite rich. We analyze its relationship to a further type of reduction between classes of structures based on purely comparing for every n the number of nonisomorphic structures of cardinality at most n (...) in both classes. Furthermore, in a more general setting we address the question of the existence of a maximal element in the partial ordering of the degrees. (shrink)

Based on da Costa's and French's notions of partial structures and pragmatic truth, this paper examines two possible characterizations of the concept of empirical adequacy, one depending on the notion of partial isomorphism, the other on the hierarchy of partial models of phenomena, and both compatible with an empiricist view. These formulations can then be employed to illuminate certain aspects of scientific practice.An empirical theory must single out a specific part of the world, establish reference to (...) that part, and say—by way of contingent, substantial claim about the world—that its models fit that. Now, how exactly can this be done? Bas C. van Fraassen. (shrink)

I show that extant attempts to capture and generalize empirical adequacy in terms of partial structures fail. Indeed, the motivations for the generalizations in the partial structures approach are better met by the generalizations via approximation sets developed in “Generalizing Empirical Adequacy I”. Approximation sets also generalize partial structures.

A partially ordered set is called k-homogeneous if any isomorphism between k-element subsets extends to an automorphism of . Assuming the set-theoretic assumption ⋄, it is shown that for each k, there exist partially ordered sets of size ϰ1 which embed each countable partial order and are k-homogeneous, but not -homogeneous. This is impossible in the countable case for k ≥ 4.

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)

This paper presents a new language for isomorphic representations of legalknowledge in feature structures. The language includes predefinedstructures based on situation theory for common-sense categories, andpredefined structures based on Van Kralingens frame-based conceptualmodelling language for legal rules. It is shown that the flexibility of thefeature-structure formalism can exploited to allow for structure-preservingrepresentations of non-primitive concepts, and to enable various types ofinteraction and cross- reference between language elements. A fragment of theDutch Opium Act is used to illustrate how modelling and reasoning (...) proceed in practice. (shrink)

Ulm’s Theorem presents invariants that classify countable abelian torsion groups up to isomorphism. Barwise and Eklof extended this result to the classification of arbitrary abelian torsion groups up to L∞ω\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$L_{\infty \omega }$$\end{document}-equivalence. In this paper, we extend this classification to a class of mixed Zp\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb {Z}}_p$$\end{document}-modules which includes all Warfield modules and is closed under L∞ω\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} (...) \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$L_{\infty \omega }$$\end{document}-equivalence. The defining property of these modules is the existence of what we call a partial decomposition basis, a generalization of the concept of decomposition basis. We prove a complete classification theorem in L∞ω\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$L_{\infty \omega }$$\end{document} using invariants deduced from the classical Ulm and Warfield invariants. (shrink)

In this essay, I shall show that the so-called inferential (Suárez 2003 and 2004 ) and interpretational (Contessa 2007 ) accounts of scientific representation are respectively unsatisfactory and too weak to account for scientific representation ( pars destruens ). Along the way, I shall also argue that the pragmatic similarity (Giere 2004 and Giere 2010 ) and the partial isomorphism (da Costa and French 2003 and French 2003 ) accounts are unable to single out scientific representation. In the (...) pars construens I spell out a limiting case account which has explanatory surplus vis à vis the approaches which I have previously reviewed. My account offers an adequate treatment of scientific representation, or so I shall try to argue. Central to my account is the notion of a pragmatic limiting case, which will be characterized in due course. (shrink)

Empirical adequacy is a central notion in van Fraassen's empiricist view of science. I argue that van Fraassen's account of empirical adequacy in terms of a partial isomorphism between certain structures in some model(s) of the theory and certain actual structures (the observables) in the world, is untenable. The empirical adequacy of a theory can only be tested in the context of an accepted practice of observation. But because the theory itself does not determine the correct practice of (...) observation, its failure to pass the test does not show the failure of an isomorphism between the empirical substructure of some model(s) of the theory and observable structures in nature. Further, because the choice of a practice of observation is a pragmatic one grounded in epistemic goals we seek in observation, van Fraassen's anthropocentric view of observability is epistemically unmotivated. (shrink)

We consider ω n -automatic structures which are relational structures whose domain and relations are accepted by automata reading ordinal words of length ω n for some integer n ≥ 1. We show that all these structures are ω-tree-automatic structures presentable by Muller or Rabin tree automata. We prove that the isomorphism relation for ω 2 -automatic (resp. ω n -automatic for n > 2) boolean algebras (respectively, partial orders, rings, commutative rings, non commutative rings, non commutative groups) (...) is not determined by the axiomatic system ZFC. We infer from the proof of the above result that the isomorphism problem for ω n -automatic boolean algebras, n ≥ 2, (respectively, rings, commutative rings, non commutative rings, non commutative groups) is neither a ${\mathrm{\Sigma }}_{2}^{1}-\mathrm{s}\mathrm{e}\mathrm{t}$ nor a ${\mathrm{\Pi }}_{2}^{1}-\mathrm{s}\mathrm{e}\mathrm{t}$ . We obtain that there exist infinitely many ω n -automatic, hence also ω-tree-automatic, atomless boolean algebras $\mathcal{B}_{n}$ , n ≥ 1, which are pairwise isomorphic under the continuum hypothesis CH and pairwise non isomorphic under an alternate axiom AT, strengthening a result of [14]. (shrink)

Infinitary languages are used to prove that any strong isomorphism of substructures of isomorphic structures can be extended to an isomorphism of the structures. If the structures are models of a theory that has quantifier elimination, any isomorphism of substructures is strong. This theorem is a partial generalization of Steinitz’s theorem for algebraically closed fields and has as special case the analogous theorem for differentially closed fields. In this note, we announce results which will be proved (...) elsewhere. DOI: 10.5007/1808-1711.2011v15n1p107. (shrink)

A cohesive power of a structure is an effective analog of the classical ultrapower of a structure. We start with a computable structure, and consider its effective power over a cohesive set of natural numbers. A cohesive set is an infinite set of natural numbers that is indecomposable with respect to computably enumerable sets. It plays the role of an ultrafilter, and the elements of a cohesive power are the equivalence classes of certain partial computable functions determined by the (...) cohesive set. Thus, unlike many classical ultrapowers, a cohesive power is a countable structure. In this paper we focus on cohesive powers of graphs, equivalence structures, and computable structures with a single unary function satisfying various properties, which can also be viewed as directed graphs. For these computable structures, we investigate the isomorphism types of their cohesive powers, as well as the properties of cohesive powers when they are not isomorphic to the original structure. (shrink)

A general method for constructing a new class of topological Ramsey spaces is presented. Members of such spaces are infinite sequences of products of Fraïssé classes of finite relational structures satisfying the Ramsey property. The Product Ramsey Theorem of Sokič is extended to equivalence relations for finite products of structures from Fraïssé classes of finite relational structures satisfying the Ramsey property and the Order-Prescribed Free Amalgamation Property. This is essential to proving Ramsey-classification theorems for equivalence relations on fronts, generalizing the (...) Pudlák–Rödl Theorem to this class of topological Ramsey spaces. To each topological Ramsey space in this framework corresponds an associated ultrafilter satisfying some weak partition property. By using the correct Fraïssé classes, we construct topological Ramsey spaces which are dense in the partial orders of Baumgartner and Taylor generating p-points which are k-arrow but not \-arrow, and in a partial order of Blass producing a diamond shape in the Rudin-Keisler structure of p-points. Any space in our framework in which blocks are products of n many structures produces ultrafilters with initial Tukey structure exactly the Boolean algebra \\). If the number of Fraïssé classes on each block grows without bound, then the Tukey types of the p-points below the space’s associated ultrafilter have the structure exactly \. In contrast, the set of isomorphism types of any product of finitely many Fraïssé classes of finite relational structures satisfying the Ramsey property and the OPFAP, partially ordered by embedding, is realized as the initial Rudin-Keisler structure of some p-point generated by a space constructed from our template. (shrink)

We investigate dependence of recursively enumerable graphs on the equality relation given by a specific r.e. equivalence relation on ω. In particular we compare r.e. equivalence relations in terms of graphs they permit to represent. This defines partially ordered sets that depend on classes of graphs under consideration. We investigate some algebraic properties of these partially ordered sets. For instance, we show that some of these partial ordered sets possess atoms, minimal and maximal elements. We also fully describe the (...) isomorphism types of some of these partial orders. (shrink)

The spectrum of a relation on a computable structure is the set of Turing degrees of the image of R under all isomorphisms between and any other computable structure . The relation is intrinsically computably enumerable if its image under all such isomorphisms is c.e. We prove that any computable partially ordered set is isomorphic to the spectrum of an intrinsically c.e. relation on a computable structure. Moreover, the isomorphism can be constructed in such a way that the image (...) of the minimum element of the partially ordered set is computable. This solves the spectrum problem. The theorem and modifications of its proof produce computably categorical structures whose expansions by finite number of constants are not computably categorical and, indeed, ones whose expansions can have any finite number of computable isomorphism types. They also provide examples of computably categorical structures that remain computably categorical under expansions by constants but have no Scott family. (shrink)

El objetivo de este artículo es presentar una demostración de un teorema clásico sobre álgebras booleanas y ordenes parciales de relevancia actual en teoría de conjuntos, como por ejemplo, para aplicaciones del método de construcción de modelos llamado “forcing” (con álgebras booleanas completas o con órdenes parciales). El teorema que se prueba es el siguiente: “Todo orden parcial se puede extender a una única álgebra booleana completa (salvo isomorfismo)”. Donde extender significa “sumergir densamente”. Tal demostración se realiza utilizando cortaduras de (...) Dedekind siguiendo el texto “Set Theory” de Jech, y otras ideas propias del autor de este artículo. Adicionalmente, se formulan algunas versiones débiles del axioma de elección relacionadas con las álgebras booleanas, las cuales son también de gran importancia para la investigación en teoría de conjuntos y teoría de modelos, pues estas son poderosas técnicas de construcción de modelos, como por ejemplo, el teorema de compacidad (permite construir modelos no estándar, etc) y el teorema del ultrafiltro, que permite construir ultraproductos (pueden ser usados para investigar problemas de cardinales grandes, etc). Se presentan algunas referencias de problemas abiertos sobre el tema. -/- The objective of this paper is to present a demonstration of a classical theorem on boolean algebras and partial orders of current relevance in set theory, as for example, for applications of model construction method called forcing" (with boolean algebras complete or with partial orders). The theorem to be proved is as follows: Any partial order can be extended to a single complete boolean algebra (up to isomorphism)". Where to extend means embed densely". Such a demonstration is done using Dedekind's cuts following the text Set Theory" of Jech, and other ideas of the author of this article. In addition, some weak versions of the axiom of choice related to boolean algebras are formulated, which are also of great importance for the research in set theory and model theory, since this are powerful model construction techniques, such as the compactness theorem (allows the construction of non-standard models, etc.) and the ultralter theorem, which allows the construction of ultraproducts (can be used to investigate problems of large cardinals, etc). Some references of open problems on the subject are presented. (shrink)

We divide the class of infinite computable trees into three types. For the first and second types, 0' computes a nontrivial self-embedding while for the third type 0'' computes a nontrivial self-embedding. These results are optimal and we obtain partial results concerning the complexity of nontrivial self-embeddings of infinite computable trees considered up to isomorphism. We show that every infinite computable tree must have either an infinite computable chain or an infinite Π01 antichain. This result is optimal and (...) has connections to the program of reverse mathematics. (shrink)

Incomplete preferences displaying ‘mildly sweetened’ structure are common, yet theoretically problematic. This paper examines the properties of the rankings induced by the set of all coherent completions of the mildly sweetened partial preference structure. Building on these properties, I propose an ensemble-based refinement of Hare’s prospectism criterion for rational choice when preferences are incomplete. Importantly, this ensemble-based refinement is immune to Peterson’s weak money pump argument. Hence, ensemble prospectism ensures outcome rationality. Furthermore, by recognizing the structural isomorphism between (...) mildly sweetened preference structures and Cover’s splitting rule in Blackwell’s Pick the Largest Number problem, ensemble prospectism can be shown to yield better-than-even odds of selecting the ex-post higher utility option—despite the absence of all-things-considered preferences ex ante. (shrink)

The measurement of force is based on a formal law of additivity, which characterizes the effects of two or more configurations on the equilibrium of a material point. The representing vectors (resultant forces) are additive over configurations. The existence of a tight interrelation between the force vector and the geometric space, in which motion is described, depends on observations of partial (directional) equilibria; an axiomatization of this interrelation yields a proof of part two of Newton's second law of motion. (...) The present results (which were derived from a curious and deep isomorphism between force measurement and trichromatic color measurement) yield a kind of subunit, which needs to be incorporated into more complete axiomatizations of mechanics that would fulfill the Mach-Kirchhoff program. (shrink)

Three results in [14] and one in [8] are analyzed in Sections 3–6 in order to supply examples on Loeb probability spaces, which distinguish the different strength among three generalizations of k-saturation, as well to answer some questions in Section 7 of [15]. In Section 3 we show that not every automorphism of a Loeb algebra is induced by an internal permutation, in Section 4 we show that if the 1-special model axiom is true, then every automorphism of a Loeb (...) algebra is induced by a point-automorphism, in Section 5 we show that not every measure-preserving homomorphism from a small subalgebra to a Loeb algebra is induced by an internal permutation, without assuming full-saturation, in Section 6 we show that, under some cardinality assumptions, the 1-isomorphism property does not guarantee the compactness of a Loeb space, and in Section 7 an application of the 1-special model axiom is given on the existence of ergodic transformations of a Loeb space, which partially answers Problem 2.3 of [5]. (shrink)

Type two cuts, bad cuts and very bad cuts are introduced in [10] for studying the relationship between Loeb measure and U-topology of a hyperfinite time line in an ω 1 -saturated nonstandard universe. The questions concerning the existence of those cuts are asked there. In this paper we answer, fully or partially, some of those questions by showing that: (1) type two cuts exist, (2) the ℵ 1 -isomorphism property implies that bad cuts exist, but no bad cuts (...) are very bad. (shrink)

A semantics for the lambda-calculus due to Friedman is used to describe a large and natural class of categorical recursion-theoretic notions. It is shown that if e 1 and e 2 are godel numbers for partial recursive functions in two standard ω-URS's 1 which both act like the same closed lambda-term, then there is an isomorphism of the two ω-URS's which carries e 1 to e 2.

For a class K of structures, closed under isomorphism, the index set is the set I of all indices for computable members of K in a universal computable numbering of all computable structures for a fixed computable language. We study the complexity of the index set of class of structures with decidable theories. We first prove the result for the class of all structures in an arbitrary finite nontrivial language. After the complexity is found, we prove similar results for (...) some well-known classes of structures, such as directed graphs, undirected graphs, partial orders and lattices. (shrink)

In this paper we prove that, in the Cohen extension of a model M of ZFC+CH containing a simplified -morass, η1-orderings without endpoints having cardinality of the continuum, and satisfying specified technical conditions, are order-isomorphic. Furthermore, any order-isomorphism in M between countable subsets of the η1-orderings can be extended to an order-isomorphism between the η1-orderings in the Cohen extension of M. We use the simplified -morass, and commutativity conditions with morass maps on terms in the forcing language, to (...) extend countable partial functions on terms in the forcing language that are forced in all generic extensions to be order-preserving injections. This technique provides for the construction of functions in Cohen extensions adding 2 generic reals for which the only known arguments require transfinite constructions of order type no greater than ω1 in models of ZFC+CH. The specific example presented in this paper is an extension of Tarski’s classic result that in models of ZFC+CH, η1-orderings are order-isomorphic. (shrink)

The article analyzes an issue in Jane Bennett’s vital materialism project, namely, a spe­cific conjunction of ideas about active matter that produces various combinations of be­ings, including humans, and the possibility of this matter to articulate itself in language, including poetic forms. After a brief, but necessary discussion of some essential aspects of Bennett’s theory such as ontology based on postulates of elementary particles physics (particle collisions, resonance, isomorphism), affective ethics (partial actions based on the “positive” repetition of (...) random impressions) and ecology (“courteous” attention to representatives of other species), the author suggests to strengthen the fluctuating nature of Bennett’s project and explore its extremes: the cosmic level of theorizing where even sympathy appears as a “gravitational” force and the level of linguistic articulation where various forms of indirect utterance, the “middle voice”, are involved. Despite the fact that between these two levels one can observe a certain isomorphism of a “weak” “non-dramatism”, the author concludes that the “physicality” of solarity and sympathy viewed as cosmic manifestations are not equal in weight to their own expression in poetic lan­guage in the spirit of Whitman or Thoreau (as exemplified in many by Bennett’s books). Therefore, these two components do not remain in the state of balance, even though Ben­nett repeatedly tries to use the concept of an interval, which is responsible for the discon­tinuation of the narratives of both types. In other words, the project shifts from a study of materiality towards its non-romantic “naming” only. (shrink)

Demonic composition, demonic refinement and demonic union are alternatives to the usual ‘angelic’ composition, angelic refinement (inclusion) and angelic (usual) union defined on binary relations. We first motivate both the angelic and the demonic via an analysis of the behaviour of non-deterministic programs, with the angelic associated with partial correctness and demonic with total correctness, both cases emerging from a richer algebraic model of non-deterministic programs incorporating both aspects. Zareckiĭ has shown that the isomorphism class of algebras of (...) binary relations under angelic composition and inclusion is finitely axiomatized as the class of ordered semigroups. The proof can be used to establish that the same axiomatization applies to binary relations under demonic composition and refinement, and a further modification of the proof can be used to incorporate a zero element representing the empty relation in the angelic case and the full relation in the demonic case. For the signature of angelic composition and union, it is known that no finite axiomatization exists, and we show the analogous result for demonic composition and demonic union by showing that the same axiomatization holds for both. We show that the isomorphism class of algebras of binary relations with the ‘mixed’ signature of demonic composition and angelic inclusion has no finite axiomatization. As a contrast, we show that the isomorphism class of partial algebras of binary relations with the partial operation of constellation product and inclusion (also a ‘mixed’ signature) is finitely axiomatizable. (shrink)

Infinitary languages are used to prove that any strong isomorphism of substructures of isomorphic structures can be extended to an isomorphism of the structures. If the structures are models of a theory that has quantifier elimination, any isomorphism of substructures is strong. This theorem is a partial generalization of Steinitz’s theorem for algebraically closed fields and has as special case the analogous theorem for differentially closed fields. In this note, we announce results which will be proved (...) elsewhere. (shrink)

This article examines whether (1) government intervention causes bribery (or corruption) as rent-seeking theory suggested; (2) a firm’s perceived benefit partially mediates the relationship between government intervention and its bribing behavior, as rational choice/behavior theory suggested; and (3) other firms’ bribing behavior moderates the relationship between government intervention and a firm’s perceived benefit. Our study shows that government intervention causes bribery/corruption indeed, but it exerts its effect on bribery/corruption through the firm’s perceived benefit. In other words, a firm’s perceived benefit (...) fully mediates the relationship between government intervention and its bribing behavior. We also find that other firms’ bribery positively moderates the relationship between government intervention and a given firm’s bribery. This study partly proves that firms are rational actors. Potential benefit encourages them to practice bribery. Besides, this research also supports the rent-seeking view of bribery/corruption, which argues that government intervention is a source of bribery/corruption. However, we have also identified that only those government interventions that will create “rent” can cause bribery/corruption. (shrink)

The dissertation is a study primarily in analytic metaphysics. The emphasis is on time, and the focus, on the whole, is on the notion of Now. In the first chapter I consider Now as it figures in singular demonstrative reference by giving an exposition and partially Kantian refutation of Hegel's argument that such reference is impossible. The ability to so-refer is the ability to mean and express 'this', i.e., what is here and now to me. Hegel's central mistake was to (...) confuse a demonstrative's having general applicability with standing for a generality; so he construes 'this' on the model of a predicable. He would have individuals as properties of Spirit. Thus, this sort of opening move toward absolute idealism is blocked. In ch. II I consider Now within the context of the question of the similarity of space and time. A methodology for constructing spatio-temporal (dis)analogies has recently become widely accepted and utilized, viz., formulating statement pairs with interchanged spatial and temporal terms, and then comparing their truth and logical status. I argue that space and time are quite dissimilar in the course of showing that this methodology, which has never been critically scrutinized, has serious deficiencies and limitations, and is paradox-generating. In part following suggestions from Dewey, in ch. III it is shown how we may acquire the concepts of Now and time without our being able to sense time. I rationally reconstruct these concepts by 'deriving' them from the concepts of required-for and sensed (taken tenselessly). Among other reasons, because activity is explicitly required for succeeding or failing, and because these ubiquitous conditions are sensed, our concept of time is rooted squarely in our experience of these conditions. Lastly, in ch. IV I present a new argument for the objectivity and transitoriness of Now. What's new about it is that it proceeds by considering pertinent issues (like intersubjective agreement) that arise in connection with "the specious present doctrine," which falsely casts the sensory present as a (variable) interval. (shrink)

Aristotle famously asserted that the mind is identical with its object in an act of cognition. This “identity doctrine” has caused much confusion and controversy, with many seeking to avoid a literal interpretation in favor of one that suggests that “identity” refers to a formal isomorphism between the mind and its object. However, in this paper I suggest that Aristotle’s identity doctrine is not an epistemological claim about an isomorphism between a representation of an object and the object (...) itself, but is a phenomenological claim about the character of human cognition and intelligible being. Drawing on texts from Edmund Husserl and Aristotle, I offer a phenomenological interpretation of Aristotle’s identity doctrine. I ultimately argue that, for Aristotle, mind and being are essentially unified, for intelligible being is partially constitutive of the mind. (shrink)

To each computable enumerable (c.e.) set A with a particular enumeration {As}s∈ω, there is associated a settling function mA(x), where mA(x) is the last stage when a number less than or equal to x was enumerated into A. One c.e. set A is settling time dominated by another set B (B >st A) if for every computable function f, for all but finitely many x, mB(x) > f(m₄(x)). This settling-time ordering, which is a natural extension to an ordering of the (...) idea of domination, was first introduced by Nabutovsky and Weinberger in [3] and Soare [6]. They desired a sequence of sets descending in this relationship to give results in differential geometry. In this paper we examine properties of the <st ordering. We show that it is not invariant under computable isomorphism, that any countable partial ordering embeds into it, that there are maximal and minimal sets, and that two c.e. sets need not have an inf or sup in the ordering. We also examine a related ordering, the strong settling-time ordering where we require for all computable f and g, for almost all x, mB(x) > f(mA(g(x))). (shrink)

It follows directly from Shelah’s structure theory that if T is a classifiable theory, then the isomorphism type of any model of T is determined by the theory of that model in the language L∞,ω1. Leo Harrington asked if one could improve this to the logic L∞, In [S. Shelah, Characterizing an -saturated model of superstable NDOP theories by its L∞,-theory, Israel Journal of Mathematics 140 61–111] Shelah gives a partial positive answer, showing that for T a countable (...) superstable NDOP theory, two -saturated models of T are isomorphic if and only if they have the same L∞,-theory. We give here a negative answer to the general question by constructing two classifiable theories, each with 21 pairwise non-isomorphic models of cardinality 1, which are all L∞,-equivalent, a shallow depth 3 ω-stable theory and a shallow NOTOP depth 1 superstable theory. In the other direction, we show that in the case of an ω-stable depth 2 theory, the L∞,-theory is enough to describe the isomorphism type of all models. (shrink)

Millikan’s theory of content purports to rely heavily on the existence of isomorphisms between a system of representations and the things in the world which they represent — “the mapping requirement for being intentional signs” (Millikan 2004, p. 106). This paper asks whether those isomorphisms are doing any substantive explanatory work. Millikan’s isomorphism requirement is deployed for two main purposes. First, she claims that the existence of an isomorphism is the basic representing relation, with teleology playing a subsidiary (...) role — to account for misrepresentation (the possibility of error). Second, Millikan relies on an isomorphism requirement in order to guarantee that a system of representations displays a kind of productivity. This seemingly strong reliance on isomorphism has prompted the objection that isomorphism is too liberal to be the basic representing relation: there are isomorphisms between any system of putative representations and any set, of the same cardinality, of items putatively represented. This paper argues that all the work in fixing content is in fact done by the teleology. Deploying Millikan’s teleology-based conditions to ascribe contents will ensure that there is an isomorphism between representations and the things they represent, but the isomorphism ‘requirement’ is playing no substantive explanatory role in Millikan’s account of content determination. So an objection to her theory based on the liberality of isomorphism is misplaced. The second role for isomorphism is to account for productivity. If some kind of productivity is indeed necessary for representation, then functional isomorphism will again be too liberal a constraint to account for that feature. The paper suggests an alternative way of specifying the relation between a system of representations and that which they represent which is capable of playing an explanatory role in accounting for Millikan’s type of productivity. In short, the liberality of isomorphism is no objection to Millikan’s teleosemantics, since the isomorphism ‘requirement’ need play no independent substantive role in Millikan’s account of representation. (shrink)

There is a duality in our everyday view of belief. On the one hand, we sometimes speak of credence as a matter of degree. We talk of having some level of confidence in a claim (that a certain course of action is safe, for example, or that a desired event will occur) and explain our actions by reference to these degrees of confidence – tacitly appealing, it seems, to a probabilistic calculus such as that formalized in Bayesian decision theory. On (...) the other hand, we also speak of belief as an unqualified, or flat-out, state (‘plain belief’ as it is sometimes called), which is either categorically present or categorically absent. We talk of simply believing or thinking that something is the case, and we cite these flat-out attitudes in explanation of our actions – appealing to classical practical reasoning of the sort formalized in the so-called ‘practical syllogism’.1 This tension in everyday discourse is reflected in the theoretical literature on belief. In formal epistemology there is a division between those in the Bayesian tradition, who treat credence as graded, and those who think of it as a categorical attitude of some kind. The Bayesian perspective also contrasts with the dominant view in philosophy of mind, where belief is widely regarded as a categorical state (a token sentence of a mental language, inscribed in a functionally defined ‘belief box’, according to one popular account). A parallel duality is present in our everyday view of desire. Sometimes we talk of having degrees of preference or desirability; sometimes we speak simply of wanting or desiring something tout court, and, again, this tension is reflected in the theoretical literature. What should we make of these dualities? Are there two different types of belief and desire – partial and flat-out, as they are sometimes called? If so, how are they related? And how could both have a role in guiding rational action, as the everyday view has it? The last question poses a particular challenge in relation to flat-out belief and desire.. (shrink)

Situated within the framework of Confucian family-oriented ethics, this book explores the issue of familial partiality and specifically discusses whether it is morally praiseworthy to love one's family partially. In reviewing the tension between familial partiality and egalitarian impartiality from different perspectives while also drawing on binary metrics to understand the issue - that is, the weak and strong sense of familial partiality in Confucian moral theory - the author carefully discusses the efficacy of three major arguments to justify moral (...) partiality. It is concluded that the tree argument fails to justify moral partiality in Confucianism, the evolutionary argument only justifies moral partiality in the weak sense that we should devote more resources to our family, and the care argument fails to justify moral partiality in the strong sense that family takes priority in any case even at the expense of the principle of justice. Seeking to address the quandary, the author advances an alternative argument based on Thomas Aquinas' theory of love to interpret Confucian view of partial relationships, holding that partial treatment is assumed in partial relationships. The title will appeal to scholars and students interested in Confucianism, Chinese Philosophy, Moral Philosophy, and Comparative Philosophy. (shrink)

This book philosophically explores and works to resolve the tension between equality (impartiality) and favoritism (partiality) in light of intellectual resources in the African tradition of philosophy.

This paper examines the ethical conundrum between a hospital's ethos of relieving distress, investigation and treatment, and its concurrent duties under English law to administer tests of decision-making capacity and safeguarding protection where it believes the patient may lack this capacity. Delirium, characterised by a precipitous decline in mental functioning exhibiting the shared symptomology of recoverable depressive disorders and terminal dementia, is not uncommon after emergency admission of elderly patients into acute medical hospital wards. The use of functional capacity testing (...) as a benchmark for decision-making capacity for post-discharge residence has been criticised as outdated, conceptually floored, subjective, lacking central guidance, transparent process, and accountability. A study of patient experience demonstrates the potential for hospital misuse of capacity testing, the failure of functional testing to differentiate decision making capacity from the disability of partial cognitive impairment, and how hospital capacity processes can interact and amplify patient pathology thereby decreasing recovery prospects. Prioritisation of mental capacity obligations above thorough investigation of emergent mental pathology and relief of patient anguish, results in extended detention in medical wards lacking bespoke facilities. Further understanding of patient experience is needed to inform policy with interventions tailored to avoid harm and increase wellbeing. (shrink)

An interesting feature of some sets of representations is that their structure mirrors the structure of the items they represent. Founding an account of representational content on isomorphism, homomorphism or structural resemblance has proven elusive, however, largely because these relations are too liberal when the candidate structure over representational vehicles is unconstrained. Furthermore, in many cases where there is a clear isomorphism, it is not relied on in the way the representations are used. That points to a potential (...) resolution: that an isomorphism must be used, hence usable, if it is to be an ingredient in a theory of content. This paper argues that the class of exploitable isomorphisms can indeed play a content-constituting role. (shrink)

For the information theorist, the lawful generalizations that subsume instantiations of properties in the environment and instantiations of properties of perceptual representations determine the latter's content. Perceptual representations are also commonly thought to be isomorphic to what they represent, which presents the information theorist with a puzzle. What role could isomorphism play in perceptual representation when lawful generalizations determine content? I show that in order for the information that they carry to be available to cognition, perceptual representations must be (...) isomorphic with respect to the constituent structure of the properties that they represent. Isomorphism therefore plays an important role in the information theorist's account of perceptual representation, even though it plays no role in determining content. (shrink)

This paper discusses some engineering considerations that should be taken into account when building a knowledge based system, and recommends isomorphism, the well defined correspondence of the knowledge base to the source texts, as a basic principle of system construction in the legal domain. Isomorphism, as it has been used in the field of legal knowledge based systems, is characterised and the benefits which stem from its use are described. Some objections to and limitations of the approach are (...) discussed. The paper concludes with a case study giving a detailed example of the use of the isomorphic approach in a particular application. (shrink)

A serious crisis is identified in theories of neurocomputation, marked by a persistent disparity between the phenomenological or experiential account of visual perception and the neurophysiological level of description of the visual system. In particular, conventional concepts of neural processing offer no explanation for the holistic global aspects of perception identified by Gestalt theory. The problem is paradigmatic and can be traced to contemporary concepts of the functional role of the neural cell, known as the Neuron Doctrine. In the absence (...) of an alternative neurophysiologically plausible model, I propose a perceptual modeling approach, to model the percept as experienced subjectively, rather than modeling the objective neurophysiological state of the visual system that supposedly subserves that experience. A Gestalt Bubble model is presented to demonstrate how the elusive Gestalt principles of emergence, reification, and invariance can be expressed in a quantitative model of the subjective experience of visual consciousness. That model in turn reveals a unique computational strategy underlying visual processing, which is unlike any algorithm devised by man, and certainly unlike the atomistic feed-forward model of neurocomputation offered by the Neuron Doctrine paradigm. The perceptual modeling approach reveals the primary function of perception as that of generating a fully spatial virtual-reality replica of the external world in an internal representation. The common objections to this picture-in-the-head concept of perceptual representation are shown to be ill founded. Key Words: brain-anchored; Cartesian theatre; consciousness; emergence; extrinsic constraints; filling-in; Gestalt; homunculus; indirect realism; intrinsic constraints; invariance; isomorphism; multistability; objective phenomenology; perceptual modeling; perspective; phenomenology; psychophysical parallelism; psychophysical postulate; qualia; reification; representationalism; structural coherence. (shrink)