A Turing degree d is homogeneous bounding if every complete decidable (CD) theory has a d-decidable homogeneous model A, i.e., the elementary diagram De (A) has degree d. It follows from results of Macintyre and Marker that every PA degree (i.e., every degree of a complete extension of Peano Arithmetic) is homogeneous bounding. We prove that in fact a degree is homogeneous bounding if and only if it is a PA degree. We do this by showing (...) that there is a single CD theory T such that every homogeneous model of T has a PA degree. (shrink)

We define an appropriate analog of the Morley rank in a totally transcendental homogeneous model with type diagram D. We show that if RM[p] = α then for some 1 ≤ n < ω the type p has n, but not n + 1, distinct D-extensions of rank α. This is surprising, because the proof of the statement in the first-order case depends heavily on compactness. We also show that types over (D,ℵ₀)-homogeneous models have multiplicity (Morley degree) (...) 1. (shrink)

In the last five years there have been a number of results about the computable content of the prime, saturated, or homogeneous models of a complete decidable theory T in the spirit of Vaught's "Denumerable models of complete theories" combined with computability methods for degrees d ≤ 0′. First we recast older results by Goncharov, Peretyat'kin, and Millar in a more modern framework which we then apply. Then we survey recent results by Lange, "The degree spectra of (...) homogeneous models," which generalize the older results and which include positive results on when a certain homogeneous model of T has an isomorphic copy of a given Turing degree. We then survey Lange's "A characterization of the 0-basis homogeneous bounding degrees" for negative results about when does not have such copies, generalizing negative results by Goncharov, Peretyat'kin, and Millar. Finally, we explain recent results by Csima, Harizanov, Hirschfeldt, and Soare, "Bounding homogeneous models," about degrees d that are homogeneous bounding and explain their relation to the PA degrees. (shrink)

In this paper we study elementary submodels of a stable homogeneous structure. We improve the independence relation defined in Hyttinen 167–182). We apply this to prove a structure theorem. We also show that dop and sdop are essentially equivalent, where the negation of dop is the property we use in our structure theorem and sdop implies nonstructure, see Hyttinen.

Much previous study has been done on the degree spectra of prime models of a complete atomic decidable theory. Here we study the analogous questions for homogeneous models. We say a countable model A has a d-basis if the types realized in A are all computable and the Turing degree d can list $\Delta _{0}^{0}$ -indices for all types realized in A. We say A has a d-decidable copy if there exists a model B ≅ A such (...) that the elementary diagram of B is d-computable. Goncharov, Millar, and Peretyat'kin independently showed there exists a homogeneous A with a 0-basis but no decidable copy. We prove that any homogeneous A with a 0'-basis has a low decidable copy. This implies Csima's analogous result for prime models. In the case where all types of the theory T are computable and A is a homogeneous model with a 0-basis, we show A has copies decidable in every nonzero degree. A degree d is 0-homogeneous bounding if any automorphically nontrivial homogeneous A with a 0-basis has a d-decidable copy. We show that the nonlow₂ $\Delta _{2}^{0}$ degrees are 0-homogeneous bounding. (shrink)

We study the class of elementary submodels of a large superstable homogeneous model. We introduce a rank which is bounded in the superstable case, and use it to define a dependence relation which shares many (but not all) of the properties of forking in the first order case. The main difference is that we do not have extension over all sets. We also present an example of Shelah showing that extension over all sets may not hold for any dependence (...) relation for superstable homogeneous models. (shrink)

We study the class of elementary submodels of a large superstable homogeneous model. We introduce a rank which is bounded in the superstable case, and use it to define a dependence relation which shares many (but not all) of the properties of forking in the first order case. The main difference is that we do not have extension over all sets. We also present an example of Shelah showing that extension over all sets may not hold for any dependence (...) relation for superstable homogeneous models. (shrink)

A large homogeneous model M is strongly minimal, if any definable subset is either bounded or has bounded complement. In this case is a pregeometry, where bcl denotes the bounded closure operation. In this paper, we show that if M is a large homogeneous strongly minimal structure and is non-trivial and locally modular, then M interprets a group. In addition, we give a description of such groups.

Goncharov and Peretyat'kin independently gave necessary and sufficient conditions for when a set of types of a complete theory is the type spectrum of some homogeneous model of. Their result can be stated as a principle of second order arithmetic, which is called the Homogeneous Model Theorem (HMT), and analyzed from the points of view of computability theory and reverse mathematics. Previous computability theoretic results by Lange suggested a close connection between HMT and the Atomic Model Theorem (AMT), (...) which states that every complete atomic theory has an atomic model. The authors show that HMT and AMT are indeed equivalent in the sense of reverse mathematics, as well as in a strong computability theoretic sense and do the same for an analogous result of Peretyat'kin giving necessary and sufficient conditions for when a set of types is the type spectrum of some model. (shrink)

The results herein form part of a larger project to characterize the classification properties of the class of submodels of a homogeneous stable diagram in terms of the solvability (in the sense of [1]) of the potential isomorphism problem for this class of submodels. We restrict ourselves to locally saturated submodels of the monster model m of some power π. We assume that in Gödel's constructible universe ������, π is a regular cardinal at least the successor of the first (...) cardinal in which ������ is stable. We show that the collection of pairs of submodels in ������ as above which are potentially isomorphic with respect to certain cardinal-preserving extensions of ������ is equiconstructible with 0 # . As 0 # is highly "transcendental" over ������, this provides a very strong statement to the effect that potential isomorphism for this class of models not only fails to be set-theoretically absolute, but is of high (indeed of the highest possible) complexity. The proof uses a novel method that does away with the need for a linear order on the skeleton. (shrink)

We prove a version of a small index property theorem for strong amalgamation classes. Our result builds on an earlier theorem by Lascar and Shelah. We then study versions of the small index property for various non-elementary classes. In particular, we obtain the small index property for quasiminimal pregeometry structures.

We prove that every homogeneously Souslin set is coanalytic provided that either (a) 0long does not exist, or else (b) V = K, where K is the core model below a μ-measurable cardinal.

We give a detailed account of the Algebraically Closed and Existentially Closed members of the second Lee class B 2 of distributive p-algebras, culminating in an explicit construction of the countable homogeneous universal model of B 2. The axioms of Schmid [7], [8] for the AC and EC members of B 2 are reduced to what we prove to be an irredundant set of axioms. The central tools used in this study are the strong duality of Clark and Davey (...) [3] for B 2 and the method of Clark [2] for constructing AC and EC algebras using a strong duality. Applied to B 2, this method transfers the entire discussion into an equivalent dual category X 2 of Boolean spaces which carry a pair of tightly interacting orderings. The doubly ordered spaces of X 2 prove to be much more readily constructed and analyzed than the corresponding algebras in B 2. (shrink)

With the rapid development of social network in recent years, the threshold of information dissemination has become lower. Most of the time, rumors, as a special kind of information, are harmful to society. And once the rumor appears, the truth will follow. Considering that the rumor and truth compete with each other like light and darkness in reality, in this paper, we study a rumor spreading model in the homogeneous network called 2SIH2R, in which there are both spreader1 and (...) spreader2. In this model, we introduced discernible mechanism and confrontation mechanism to quantify the level of people's cognitive abilities and the competition between the rumor and truth. By mean-field equations, steady-state analysis, and numerical simulations in a generated network which is closed and homogeneous, some significant results can be given: the higher the discernible rate of the rumor, the smaller the influence of the rumor; the stronger the confrontation degree of the rumor, the smaller the influence of the rumor; the larger the average degree of the network, the greater the influence of the rumor but the shorter the duration. The model and simulation results provide a quantitative reference for revealing and controlling the spread of the rumor. (shrink)

We generalize the result of non-finite axiomatizability of totally categorical first-order theories from elementary model theory to homogeneous model theory. In particular, we lift the theory of envelopes to homogeneous model theory and develope theory of imaginaries in the case of ω-stable homogeneous classes of finite U-rank.

We show that if M is a strongly minimal large homogeneous structure in a countable similarity type and the pregeometry of M is locally modular but not modular, then the pregeometry is affine over a division ring.

We classify countable metrically homogeneous graphs of diameter 3.

We present a new technique for changing the cofinality of large cardinals using homogeneous forcing. As an application we show that many singular cardinals in [Formula: see text] can be measurable in HOD. We also answer a related question of Cummings, Friedman and Golshani by producing a model in which every regular uncountable cardinal [Formula: see text] in [Formula: see text] is [Formula: see text]-supercompact in HOD.

The theory of constructive (recursive) models follows from works of Froehlich, Shepherdson, Mal'tsev, Kuznetsov, Rabin, and Vaught in the 50s. Within the framework of this theory, algorithmic properties of abstract models are investigated by constructing representations on the set of natural numbers and studying relations between algorithmic and structural properties of these models. This book is a very readable exposition of the modern theory of constructive models and describes methods and approaches developed by representatives of the (...) Siberian school of algebra and logic and some other researchers (in particular, Nerode and his colleagues). The main themes are the existence of recursive models and applications to fields, algebras, and ordered sets (Ershov), the existence of decidable prime models (Goncharov, Harrington), the existence of decidable saturated models (Morley), the existence of decidable homogeneous models (Goncharov and Peretyat'kin), properties of the Ehrenfeucht theories (Millar, Ash, and Reed), the theory of algorithmic dimension and conditions of autostability (Goncharov, Ash, Shore, Khusainov, Ventsov, and others), and the theory of computable classes of models with various properties. Future perspectives of the theory of constructive models are also discussed. Most of the results in the book are presented in monograph form for the first time. The theory of constructive models serves as a basis for recursive mathematics. It is also useful in computer science, in particular, in the study of programming languages, higher level languages of specification, abstract data types, and problems of synthesis and verification of programs. Therefore, the book will be useful for not only specialists in mathematical logic and the theory of algorithms but also for scientists interested in the mathematical fundamentals of computer science. The authors are eminent specialists in mathematical logic. They have established fundamental results on elementary theories, model theory, the theory of algorithms, field theory, group theory, applied logic, computable numberings, the theory of constructive models, and the theoretical computer science. (shrink)

We classify countable metrically homogeneous graphs of diameter 3.

Wesley Salmon has recently proposed a new theory of scientific explanation based on a model which he calls the statistical-relevance model. It is intended primarily as an account of the structure of explanations of particular events--explanations which, according to Salmon, are very often motivated largely by practical concerns. Two important features of this account are the concepts of homogeneity and screening off. In this paper we argue that the employment of these two concepts (which, in fact, are intimately connected) is (...) fundamentally at odds with the desire to capture everyday explanations of the practical sort, and that it leads instead to an account in which the only satisfactory explanations are those expressed in the very deepest physical terms. (shrink)

In the first part of this paper we let M be a stable homogeneous model and we prove a nonstructure theorem for the class of all elementary submodels of M, assuming that M is ‘unsuperstable’ and has Skolem functions. In the second part we assume that M is an unstable homogeneous model of large cardinality and we prove a nonstructure theorem for the class of all elementary submodels of M.

We generalize tools and results from first order stable theories to groups inside a simple stable strongly homogeneous model.

Why are cities looking more and more alike? Why do hipster coffee shops and clothing boutiques all share that same vibe? One answer is that gentrification represents an invasive force that forcibly re-models cities, from the top-down, to meet the monotone eye of the gentrifier. Gentrification brings in external developers and designers, who create new businesses which all meet that one monotonous aesthetic mold. But I suggest, using work from Quill Kukla and Jane Jacobs, that this top-down model of (...) gentrification is incomplete. Gentrification also incentivizes local residents to remake their own businesses and properties to meet that monotone eye. Gentrification is a pressure which pushes cities to meet a universalized and therefore homogenized taste, rather than letting diverse tastes flourish. (This piece originally published as part of a symposium on Quill Kukla's City Living.). (shrink)

: The Emotional Perception Model of moral judgment intends to account for experientialism about morality and moral reasoning. In explaining how moral beliefs are formed and applied in practical reasoning, the model attempts to overcome the mismatch between reason and action/desire: morality isn’t about reason for actions, yet moral beliefs, if caused by desires, may play a motivational role in agency. The account allows for two kinds of moral beliefs: genuine moral beliefs, which enjoy a relation to desire, and motivationally (...) inert moral beliefs acquired in ways other than experience. Such etiology-based dichotomy of concepts, I will argue, leads to the undesirable view of cognition as a non-homogeneous phenomenon. Moreover, the distinction between moral beliefs and moral beliefs would entail a further dichotomy encompassing the domain of moral agency: one and the same action might possibly be either genuine moral, or not moral, if acted by individuals lacking the capacity for moral feelings, such as psychopaths. Keywords : Moral Beliefs; Cognitive Homogeneity; Moral Agency; Motivation; Psychopathy Credenze morali e omogeneità cognitiva Riassunto : L’ Emotional Perception Model del giudizio morale offre un approccio esperienzialista alla moralità e al ragionamento morale. Il modello, che propone una spiegazione di come le credenze morali vengano prima formate e poi applicate, intende superare il disallineamento tra ragione e azione/desiderio: la moralità non riguarda le ragioni per agire, tuttavia le credenze morali, se causate dal desiderio o in relazione con esso, svolgono un ruolo motivazionale nell’azione. Questo approccio consente di identificare due tipi di credenza morale: le credenze morali genuine, che trattengono una relazione con il desiderio, e le credenze morali senza relazione alcuna con il desiderio e dunque caratterizzate da inerzia motivazionale. Tale tassonomia, la cui origine è da rintracciare nell’eziologia dei concetti, porta alla sgradita visione della cognizione come fenomeno disomogeneo. Inoltre la distinzione tra credenze morali e credenze morali introdurrebbe una ulteriore possibile dicotomia interna al dominio dell’azione morale: una medesima azione può essere al contempo genuinamente morale oppure no, a seconda che venga agita da un individuo con la capacità di esperire sentimenti morali o da uno che ne sia privo, come nel caso di soggetti psicopatici. Parole chiave : Credenze morali; Omogeneità cognitiva; Agentività morale; Motivazione; Psicopatia. (shrink)

We present three examples of countable homogeneous structures whose automorphism groups are not universal, namely, fail to contain isomorphic copies of all automorphism groups of their substructures.Our first example is a particular case of a rather general construction on Fraïssé classes, which we call diversification, leading to automorphism groups containing copies of all finite groups. Our second example is a special case of another general construction on Fraïssé classes, the mixed sums, leading to a Fraïssé class with all finite (...) symmetric groups appearing as automorphism groups and at the same time with a torsion-free automorphism group of its Fraïssé limit. Our last example is a Fraïssé class of finite models with arbitrarily large finite abelian automorphism groups, such that the automorphism group of its Fraïssé limit is again torsion-free. (shrink)

In his recent book Scientific Explanation and the Causal Structure of the World Wesley Salmon provides a detailed explanation of objective homogeneity, a concept which is central to his S-R model of explanation. 1 propose a modification of Salmon's definition which both simplifies and (in minor ways) corrects it, while at the same time generalizes it by including an important temporal factor that is missing from the original. I argue that if the world is irreducibly stochastic, then objective probabilities (determined (...) by objective homogeneous reference classes) must be temporally relativized. We can speak coherently of the objective probability of a particular event relative to a given point in time, but not of the objective probability of the event simpliciter. I briefly explore the consequences, of the temporal relativity of objective homogeneity for Salmon's attempt to secure an objective (nonepistemic, nonpraagmatic) S-R basis for causal explanation. (shrink)

In his recent book Scientific Explanation and the Causal Structure of the World Wesley Salmon provides a detailed explication of objective homogeneity, a concept which is central to his Statistical-Relevance (S-R) model of explanation. One of the purposes of Salmon’s explication is to refute Hempel’s thesis of the epistemic relativity of statistical explanation. According to this thesis “the concept of statistical explanation for particular events is essentially relative to a given knowledge situation” (Hempel 1965, pp. 402-403, quoted in Salmon 1984, (...) p. 48). Salmon introduces (1984, p. 55) the concept that forms the basis for his S-R model as follows: “A reference class A is homogeneous with respect to an attribute B provided there is no set of properties Ci (1 ≤i ≤ k; k ≥ 2) in terms of which A can be relevantly partitioned. (shrink)

In clinical studies, it is important to investigate the effectiveness of different therapeutic designs, especially, multiple treatment groups to one control group. The paper mainly studies homogeneity test of many-to-one risk differences from correlated binary data under optimal algorithms. Under Donner’s model, several algorithms are compared in order to obtain global and constrained MLEs in terms of accuracy and efficiency. Further, likelihood ratio, score, and Wald-type statistics are proposed to test whether many-to-one risk differences are equal based on optimal algorithms. (...) Monte Carlo simulations show the performance of these algorithms through the total averaged estimation error, SD, MSE, and convergence rate. Score statistic is more robust and has satisfactory power. Two real examples are given to illustrate our proposed methods. (shrink)

We say a countable model ������ has a 0-basis if the types realized in ������ are uniformly computable. We say ������ has a (d-)decidable copy if there exists a model ������ ≅ ������ such that the elementary diagram of ������ is (d-)computable. Goncharov, Millar, and Peretyat'kin independently showed there exists a homogeneous model ������ with a 0-basis but no decidable copy. We extend this result here. Let d ≤ 0' be any low₂ degree. We show that there exists a (...) homogeneous model ������ with a 0-basis but no d-decidable copy. A degree d is 0-basis homogeneous bounding if any homogenous ������ with a 0-basis has a d-decidable copy. In previous work, we showed that the nonlow₂ $\Delta _{2}^{0}$ degrees are 0-basis homogeneous bounding. The result of this paper shows that this is an exact characterization of the 0-basis homogeneous bounding $\Delta _{2}^{0}$ degrees. (shrink)

In this paper we show that in every |T |+-resplendent model N , for every A ⊆ N such that |A | ≤ |T |, the group Autf of strong automorphisms is the least very normal subgroup of the group Aut and the quotient Aut/Autf is the Lascar group over A . Then we generalize this result to every |T |+-saturated and strongly |T |+-homogeneous model.

Generative models have been proposed as a new type of non-representational scientific models recently. A generative model is characterized with the capacity of producing new models on the basis of the existing one. The current accounts do not explain sufficiently the mechanism of the generative capacity of a generative model. I attempt to accomplish this task in this paper. I outline two antecedent accounts of generative models. I point out that both types of generative models (...) function to generate new homogenous models in the sense that the latter is a straightforward derivative of the former, both of which share many similar features. Unfortunately, both accounts are implicit about the generative capacity of generative models. Using a case study, I articulate that a two-staged process of abstraction and idealization in modeling may contribute to the generative capacity of a scientific model. I also demonstrate that this two-staged process may go beyond the capacity of generating new homogenous models to generating new heterogeneous models. (shrink)

We introduce a new approach to the model theory of metric structures by defining the notion of a metric abstract elementary class (MAEC) closely resembling the notion of an abstract elementary class. Further we define the framework of a homogeneous MAEC were we additionally assume the existence of arbitrarily large models, joint embedding, amalgamation, homogeneity and a property which we call the perturbation property. We also assume that the Löwenheim-Skolem number, which in this setting refers to the density (...) character of the set instead of the cardinality, is ${\aleph_0}$ . In these settings we prove an analogue of Morley’s categoricity transfer theorem. We also give concrete examples of homogeneous MAECs. (shrink)

Scientific discourse is rife with passages that appear to be ordinary descriptions of systems of interest in a particular discipline. Equally, the pages of textbooks and journals are filled with discussions of the properties and the behavior of those systems. Students of mechanics investigate at length the dynamical properties of a system consisting of two or three spinning spheres with homogenous mass distributions gravitationally interacting only with each other. Population biologists study the evolution of one species procreating at a constant (...) rate in an isolated ecosystem. And when studying the exchange of goods, economists consider a situation in which there are only two goods, two perfectly rational agents, no restrictions on available information, no transaction costs, no money, and dealings are done immediately. Their surface structure notwithstanding, no competent scientist would mistake descriptions of such systems as descriptions of an actual system: we know very well that there are no such systems. These descriptions are descriptions of a model-system, and scientists use model-systems to represent parts or aspects of the world they are interested in. Following common practice, I refer to those parts or aspects as target-systems. What are we to make of this? Is discourse about such models merely a picturesque and ultimately dispensable façon de parler? This was the view of some early twentieth century philosophers. Duhem (1906) famously guarded against confusing model building with scientific theorizing and argued that model building has no real place in science, beyond a minor heuristic role. The aim of science was, instead, to construct theories, with theories understood as classificatory or representative structures systematically presented and formulated in precise symbolic.. (shrink)

The perspective of modelling agents rather than using them for a specificed purpose entails a difference in approach. In particular an emphasis on veracity as opposed to efficiency. An approach using evolving populations of mental models is described that goes some way to meet these concerns. It is then argued that social intelligence is not merely intelligence plus interaction but should allow for individual relationships to develop between agents. This means that, at least, agents must be able to distinguish, (...) identify, model and address other agents, either individually or in groups. In other words that purely homogeneous interaction is insufficient. Two example models are described that illustrate these concerns, the second in detail where agents act and communicate socially, where this is determined by the evolution of their mental models. Finally some problems that arise in the interpretation of such simulations is discussed. (shrink)

Despite its ground-breaking character, Castoriadis’s theory of society remains, in some respects, caught up in conceptual difficulties common to social theory generally, particularly the problem of conceptualizing social unity without resort to an understanding of society that downplays heterogeneity and over-emphasizes the homogeneous. Unlike many other theoretical approaches and traditions, Castoriadis’s work also offers a possible path out of this dilemma in the form of philosophical innovations which could enable us to conceptualize social unity without flattening the heterogeneous characteristics (...) of the social. Castoriadis sometimes fails to recognize the full implications of his own rejection of ontological determinism, and so ends up proposing a far too deterministic and homogeneous model of social types. This essay aims to show how this might be remedied by drawing on Castoriadis’s own fundamental insights. (shrink)