A look at history showed that theology always has to face contemporary demands in terms of its scientific character. At present, processes of pluralisation and secularisation challenge the existence of theology at universities not only against the background of religious studies, which are independent of the churches, but also, for example, in relation to innovative life sciences or cognitive sciences. In this context, an essential point to consider was that theology – like social systems in general and science in particular (...) – is characterised by an increasing differentiation. This differentiation of science implied an increasing specialisation of research, which could also be observed in the field of theology and its sub-disciplines. This article accordingly addressed the question of how, in the face of increasingly specialised research studies, the unity of theology can be justified beyond abstract and sweeping determinations. The present contribution suggested that in this respect a model of research designs developed in religious didactics might prove useful. This model of research design could essentially be understood as consisting of three research dimensions that define a research space, in which the research study on the didactics of religion can be located in the three-dimensional space by the research goal as a formatting factor. The three dimensions of this model, including the research goal, seemed to be broad enough to be tested in other sub-disciplines of theology as well to see whether their research can be more closely defined with them.Contribution: Accordingly, the contribution of this article was to raise the question, in view of an increasing specialisation of theological research, to what extent a model of research designs developed in the didactics of religion could be transferred to other sub-disciplines of theology. Should this succeed a new approach to justifying the unity of theology could become available, which is able to take into account the current differentiation of theology. (shrink)

This article discusses how the Generic Model of Psychotherapy can help to organize the psychotherapy research and the knowledge in the field of psychotherapy for sexual and gender minority patients. The structure that this traditional model provides is a good foundation for research in this field, inasmuch as it stresses macrosocial aspects that determine the provision of psychotherapy and contextualize its outcomes. Each one of the main components offered by the Generic Model of Psychotherapy – (...) Determinants, Processes, and Consequences – are specified for psychotherapy with LGBT patients and are illustrated with a selection of already existing research in the field of sexual minorities; they are also stress areas marked by knowledge gaps that require future developments. In addition, a set of questions are proposed to contribute to new studies, including the clinical implications that can be derived from this model. (shrink)

Management of the renewable natural resources in Madagascar is gradually being transferred to the local communities, particularly that of forest resources. However, these local communities are struggling to assess the consequences of management plans that they themselves must develop and implement on ecologically, economically and socially sustainable grounds. In order to highlight key aspects of different management options beforehand, we have developed MIRANA, a computer model to simulate various scenarios of management plan implementation. MIRANA differs from other simulation models (...) by not only taking into account individual practices and economic exchanges, but also by accounting for the applicable regulations. These regulations are taken into consideration by means of a multiplicity of normative structures within a spatial context. The objective of this paper is to describe the representations of institutions, norms and territories proposed by MIRANA and to discuss these representations in relation to the state of the art in the field of normative multi-agent systems. (shrink)

We study notions of genericity in models of, inspired by lines of inquiry initiated by Chatzidakis and Pillay and continued by Dolich, Miller and Steinhorn in general model‐theoretic contexts. These papers studied the theories obtained by adding a “random” predicate to a class of structures. Chatzidakis and Pillay axiomatized the theories obtained in this way. In this article, we look at the subsets of models of which satisfy the axiomatization given by Chatzidakis and Pillay; we refer to these subsets (...) in models of as CP‐generics. We study a more natural property, called strong CP‐genericity, which implies CP‐genericity. We use an arithmetic version of Cohen forcing to construct (strong) CP‐generics with various properties, including ones in which every element of the model is definable in the expansion, and, on the other extreme, ones in which the definable closure relation is unchanged. (shrink)

The generic Vopěnka principle, we prove, is relatively consistent with the ordinals being non-Mahlo. Similarly, the generic Vopěnka scheme is relatively consistent with the ordinals being definably non-Mahlo. Indeed, the generic Vopěnka scheme is relatively consistent with the existence of a \-definable class containing no regular cardinals. In such a model, there can be no \-reflecting cardinals and hence also no remarkable cardinals. This latter fact answers negatively a question of Bagaria, Gitman and Schindler.

General theoretical aspects are reviewed of models for microbial growth and endogenous metabolism. The focus is on a generic cell model with two components. Growth is represented as the increase of one of these components (the structural scaffolding or 'frame'). A novel feature of the present generic model is the explicit modelling of (partial) metabolic shutdown under conditions where maintenance requirements cannot be met.Two different approaches to mechanistic underpinnings for the classic models are outlined. The first (...) approach is based on a bimolecular reaction between the non-permanent biomass component and the permanent biomass component. The second approach is based on cellular control systems. (shrink)

We define a generic Vopěnka cardinal to be an inaccessible cardinal \ such that for every first-order language \ of cardinality less than \ and every set \ of \-structures, if \ and every structure in \ has cardinality less than \, then an elementary embedding between two structures in \ exists in some generic extension of V. We investigate connections between generic Vopěnka cardinals in models of ZFC and the number and complexity of \-Suslin sets of (...) reals in models of ZF. In particular, we show that ZFC + is equiconsistent with ZF + \\) where \ is the pointclass of all \-Suslin sets of reals, and also with ZF + \\) + \\) where \ is the least ordinal that is not a surjective image of the reals. (shrink)

We define a generic Vopěnka cardinal to be an inaccessible cardinal \ such that for every first-order language \ of cardinality less than \ and every set \ of \-structures, if \ and every structure in \ has cardinality less than \, then an elementary embedding between two structures in \ exists in some generic extension of V. We investigate connections between generic Vopěnka cardinals in models of ZFC and the number and complexity of \-Suslin sets of (...) reals in models of ZF. In particular, we show that ZFC + is equiconsistent with ZF + \\) where \ is the pointclass of all \-Suslin sets of reals, and also with ZF + \\) + \\) where \ is the least ordinal that is not a surjective image of the reals. (shrink)

We present some general results concerning the topological space of cuts of a countable model of arithmetic given by a particular indicator Y.The notion of “indicator” is de.ned in a novel way, without initially specifying what property is indicated and is used to de.ne a topological space of cuts of the model. Various familiar properties of cuts are investigated in this sense, and several results are given stating whether or not the set of cuts having the property is (...) comeagre.A new notion of “generic cut” is introduced and investigated and it is shown in the case of countable arithmetically saturated models M ⊧ PA that generic cuts exist, indeed the set of generic cuts is comeagre in the sense of Baire, and furthermore that two generic cuts within the same “small interval” of the model are conjugate by an automorphism of the model.The paper concludes by outlining some applications to constructions of cuts satisfying properties incompatible with genericity, and discussing in model-theoretic terms those properties for which there is an indicator Y. (shrink)

We compare two different notions of generic expansions of countable saturated structures. One kind of genericity is related to existential closure, and another is defined via topological properties and Baire category theory. The second type of genericity was first formulated by Truss for automorphisms. We work with a later generalization, due to Ivanov, to finite tuples of predicates and functions. Let $N$ be a countable saturated model of some complete theory $T$ , and let $(N,\sigma)$ denote an expansion (...) of $N$ to the signature $L_{0}$ which is a model of some universal theory $T_{0}$ . We prove that when all existentially closed models of $T_{0}$ have the same existential theory, $(N,\sigma)$ is Truss generic if and only if $(N,\sigma)$ is an e-atomic model. When $T$ is $\omega$ -categorical and $T_{0}$ has a model companion $T_{\mathrm {mc}}$ , the e-atomic models are simply the atomic models of $T_{\mathrm {mc}}$. (shrink)

Preschoolers naturally form mental representations that capture generic knowledge about object kinds. These have been considered to pose a special explanatory and learning challenge. We here argue for a new deductive model of them, where (i) the representations in question have a linguistic format from the start; (ii) they are inherently structurally simpler compared to reference to individuals or quantifications; and (iii) formed in communicative contexts because communication in humans is linked to language. In this model, specific (...) language‐related resources explain the scope and limits of the forms of knowledge obtained, illustrating how language and cognition develop in tandem. (shrink)

Adjoin, to a countable standard model M of Zermelo-Fraenkel set theory (ZF), a countable set A of independent Cohen generic reals. If one attempts to construct the model generated over M by these reals (not necessarily containing A as an element) as the intersection of all standard models that include M ∪ A, the resulting model fails to satisfy the power set axiom, although it does satisfy all the other ZF axioms. Thus, there is no smallest (...) ZF model including M ∪ A, but there are minimal such models. These are classified by their sets of reals, and there is one minimal model whose set of reals is the smallest possible. We give several characterizations of this model, we determine which weak axioms of choice it satisfies, and we show that some better known models are forcing extensions of it. (shrink)

Let \ be an ab initio amalgamation class with an unbounded increasing concave function f. We show that if the predimension function has a rational coefficient and f satisfies a certain assumption then the generic structure of \ has a model complete theory.

Let T be a model-complete theory that eliminates the quantifier $\exists^\infty x$ . For T we construct a theory T+ such that any element in a model of T+ determines a model of T. We show that T+ has a model companion T1. We can iterate the construction. The produced theories are investigated.

Broad genome-wide testing is increasingly finding its way to the public through the online direct-to-consumer marketing of so-called personal genome tests. Personal genome tests estimate genetic susceptibilities to multiple diseases and other phenotypic traits simultaneously. Providers commonly make use of Terms of Service agreements rather than informed consent procedures. However, to protect consumers from the potential physical, psychological and social harms associated with personal genome testing and to promote autonomous decision-making with regard to the testing offer, we argue that current (...) practices of information provision are insufficient and that there is a place – and a need – for informed consent in personal genome testing, also when it is offered commercially. The increasing quantity, complexity and diversity of most testing offers, however, pose challenges for information provision and informed consent. Both specific and generic models for informed consent fail to meet its moral aims when applied to personal genome testing. Consumers should be enabled to know the limitations, risks and implications of personal genome testing and should be given control over the genetic information they do or do not wish to obtain. We present the outline of a new model for informed consent which can meet both the norm of providing sufficient information and the norm of providing understandable information. The model can be used for personal genome testing, but will also be applicable to other, future forms of broad genetic testing or screening in commercial and clinical settings. (shrink)

Numerous results about capturing complexity classes of queries by means of logical languages work for ordered structures only, and deal with non-generic, or order-dependent, queries. Recent attempts to improve the situation by characterizing wide classes of finite models where linear order is definable by certain simple means have not been very promising, as certain commonly believed conjectures were recently refuted (Dawar's Conjecture). We take on another approach that has to do with normalization of a given order (rather than with (...) defining a linear order from scratch). To this end, we show that normalizability of linear order is a strictly weaker condition than definability (say, in the least fixpoint logic), and still allows for extending Immerman-Vardi-style results to generic queries. It seems to be the weakest such condition. We then conjecture that linear order is normalizable in the least fixpoint logic for any finitely axiomatizable class of rigid structures. Truth of this conjecture, which is a strengthened version of Stolboushkin's conjecture, would have the same practical implications as Dawar's Conjecture. Finally, we suggest a series of reductions of the two conjectures to specialized classes of graphs, which we believe should simplify further work. (shrink)

We introduce a natural principleStrong Chang Reflectionstrengthening the classical Chang Conjectures. This principle is between a huge and a two huge cardinal in consistency strength. In this note we prove that it implies the existence of an inner model with a huge cardinal. The technique we explore for building inner models with huge cardinals adapts to show thatdecisiveideals imply the existence of inner models with supercompact cardinals. Proofs for all of these claims can be found in [10].1,2.

Broad genome‐wide testing is increasingly finding its way to the public through the online direct‐to‐consumer marketing of so‐called personal genome tests. Personal genome tests estimate genetic susceptibilities to multiple diseases and other phenotypic traits simultaneously. Providers commonly make use of Terms of Service agreements rather than informed consent procedures. However, to protect consumers from the potential physical, psychological and social harms associated with personal genome testing and to promote autonomous decision‐making with regard to the testing offer, we argue that current (...) practices of information provision are insufficient and that there is a place – and a need – for informed consent in personal genome testing, also when it is offered commercially. The increasing quantity, complexity and diversity of most testing offers, however, pose challenges for information provision and informed consent. Both specific and generic models for informed consent fail to meet its moral aims when applied to personal genome testing. Consumers should be enabled to know the limitations, risks and implications of personal genome testing and should be given control over the genetic information they do or do not wish to obtain. We present the outline of a new model for informed consent which can meet both the norm of providing sufficient information and the norm of providing understandable information. The model can be used for personal genome testing, but will also be applicable to other, future forms of broad genetic testing or screening in commercial and clinical settings. (shrink)

Hrushovski originated the study of “flat” stable structures in constructing a new strongly minimal set and a stable 0-categorical pseudoplane. We exhibit a set of axioms which for collections of finite structure with dimension function δ give rise to stable generic models. In addition to the Hrushovski examples, this formalization includes Baldwin's almost strongly minimal non-Desarguesian projective plane and several others. We develop the new case where finite sets may have infinite closures with respect to the dimension function δ. (...) In particular, the generic structure need not be ω-saturated and so the argument for stability is significantly more complicated. We further show that these structures are “flat” and do not interpret a group. (shrink)

We show that K-generic projective planes have Morley rank either two or infinity. We also show give a direct argument that such planes are not Desarguesian.

An adequate semantics for generic sentences must stake out positions across a range of contested territory in philosophy and linguistics. For this reason the study of generic sentences is a venue for investigating different frameworks for understanding human rationality as manifested in linguistic phenomena such as quantification, classification of individuals under kinds, defeasible reasoning, and intensionality. Despite the wide variety of semantic theories developed for generic sentences, to date these theories have been almost universally model-theoretic and (...) representational. This essay outlines a range of proof-theoretic analyses for characterizing generics. Particular attention is given to an expressivist proof-theory that can be traced to 1) work on logical syntax that Carnap undertook prior to his turn toward truth-conditional model theory in the late 1930s, and 2) research on sequent calculi and natural deduction systems that originate in work from Gentzen and Prawitz.1. (shrink)

It is shown how certain generic extensions of a fine structural model in the sense of Mitchell and Steel [MiSt] can be reorganized as relativizations of the model to the generic object. This is then applied to the construction of Steel's core model for one Woodin cardinal [St] and its generalizations.

Let P be a forcing notion and $G\subseteq P$ its generic subset. Suppose that we have in $V[G]$ a $\kappa{-}$ complete ultrafilter1,2W over $\kappa $. Set $U=W\cap V$.

So-called ‘generics’ are members of a diverse class of constructions that express generalisations that do not directly involve any precise cardinality of individuals, but rather the kinds or ‘typical’ or ‘normal’ members of the kinds contributed by arguments of the predicate. The paper argues that genericity as a unitary phenomenon of human thought has a psychological, rather than linguistic, basis. This claim is argued for by way of a survey of the linguistic diversity of the forms of genericity, and the (...) presentation of a psychological model from recent experimental work done by Prasada and Dillingham that promises to confer unity on the genericity phenomena while explaining how the linguistic diversity relates to a single cognitive representation of a form of generality. (shrink)

We use model theoretic forcing to study and generalize the construction of ()-generic models introduced by Kueker and Laskowski. We characterize the ()-generic models in terms of forcing and introduce a more general class of models, called essential forcing generics, which have many of the same properties.

For a supersimple SU-rank 1 theory T we introduce the notion of a generic elementary pair of models of T . We show that the theory T* of all generic T-pairs is complete and supersimple. In the strongly minimal case, T* coincides with the theory of infinite dimensional pairs, which was used in 1184–1194) to study the geometric properties of T. In our SU-rank 1 setting, we use T* for the same purpose. In particular, we obtain a characterization (...) of linearity for SU-rank 1 structures by giving several equivalent conditions on T*, find a “weak” version of local modularity which is equivalent to linearity, show that linearity coincides with 1-basedness, and use the generic pairs to “recover” projective geometries over division rings from non-trivial linear SU-rank 1 structures. (shrink)

This article addresses the question which structures occur as fixed structures of stable structures with a generic automorphism. In particular we give a Galois theoretic characterization. Furthermore, we prove that any pseudofinite field is the fixed field of some model ofACFA, any one-free pseudo-differentially closed field of characteristic zero is the fixed field of some model ofDCFA, and that any one-free PAC field of finite degree of imperfection is the fixed field of some model ofSCFA.

We show that if M is a countable transitive model of $\text {ZF}$ and if $a,b$ are reals not in M, then there is a G generic over M such that $b \in L[a,G]$. We then present several applications such as the following: if J is any countable transitive model of $\text {ZFC}$ and $M \not \subseteq J$ is another countable transitive model of $\text {ZFC}$ of the same ordinal height $\alpha $, then there is a (...) forcing extension N of J such that $M \cup N$ is not included in any transitive model of $\text {ZFC}$ of height $\alpha $. Also, assuming $0^{\#}$ exists, letting S be the set of reals generic over L, although S is disjoint from the Turing cone above $0^{\#}$, we have that for any non-constructible real a, $\{ a \oplus s : s \in S \}$ is cofinal in the Turing degrees. (shrink)

This paper investigates the relationship between generic statements and the expression, transmission and persistence of social norms. The author presents the concept of normativity and its importance in the decision-making process in the context of social reality and social norms that comprise it (Bicchieri, 2006, 2016; Bicchieri et al., 2018). The paper analyses the idea of “what is normal” (Haslanger, 2014) to show how social norms are triggered by particular generic constructions relating to “social kinds”, represented by noun (...) phrases denoting “dual character concepts” (Knobe et al., 2013; Prasada et al., 2013; Leslie, 2015). DCCs are shown as effectively serving their persuasive and explanatory function due to their polysemous nature (Leslie, 2015) rather than to different pragmatics (Leslie, forthcoming). Special focus is placed on gender terms as particularly salient social kinds; this salience can be explained by a culturally pivotal role of social constructs of manhood and womanhood and by linguistic potential of generics in the development of social beliefs and legitimizing norm-driven behaviours. (shrink)

The lantern exhibition at the Lantern Festival is an important traditional festival in Taiwan. Visitors play an important role in the promotion and sustainable development of intangible cultural heritage. In recent years, the involvement of digital technology in traditional lantern design and shows has contributed to the protection, inheritance, and promotion of ICH, there remains less research on using augmented reality with ICH tourism. In this study, AR is used for ICH lantern exhibition to discuss the learning experience in lantern (...) tourism and the relationship between technology acceptance and satisfaction from the perspective of visitors, as well as evaluate what AR has on improving visitors’ awareness and learning experience. Then, primary variables of the technology acceptance model are combined with generic learning outcomes to integrate ICH, education, and technology to expand TAM, building a new model to study the ICH learning experience. A questionnaire and observation are used. Respondents are visitors participating in the AR lantern exhibition in Taiwan, which is designed by the author. There is a total of 200 questionnaires collected in the end. The result shows that knowledge and understanding, attitudes and values, activity, behavior, and progression, and enjoyment, inspiration, and creativity from GLOs have a positive effect on technology acceptance and actual use. Therefore, visitors are satisfied with innovative and interesting technology learning experiences, enhancing learning interest and results. Besides, the interaction of the AR system improves visitors’ learning motivation, which shows the combination of AR technology with ICH tourism helps improve cultural awareness. (shrink)

Let L be a finite relational language and α=(αR:R ∈ L) a tuple with 0 < αR ≤1 for each R ∈ L. Consider a dimension function $ \delta _\alpha (A) = \left| A \right| - \sum\limits_{R \in L} {\alpha {\mathop{\rm Re}\nolimits} R(A)} $ where each eR(A) is the number of realizations of R in A. Let $K_\alpha $ be the class of finite structures A such that $\delta _\alpha (X) \ge 0$ 0 for any substructure X of A. We (...) show that the theory of the generic model of $K_\alpha $ is AE-axiomatizable for any α. (shrink)

LetMbe a countably infinite ω-categorical structure. Consider Aut(M) as a complete metric space by definingd(g, h) = Ω{2−n:g(xn) ≠h(xn) org−1(xn) ≠h−1(xn)} where {xn:n∈ ω} is an enumeration ofMAn automorphism α ∈ Aut(M) is generic if its conjugacy class is comeagre. J. Truss has shown in [11] that if the set P of all finite partial isomorphisms contains a co-final subset P1closed under conjugacy and having the amalgamation property and the joint embedding property then there is a generic automorphism. (...) In the present paper we give a weaker condition of this kind which is equivalent to the existence of generic automorphisms. Really we give more: a characterization of the existence of generic expansions (defined in an appropriate way) of an ω-categorical structure. We also show that Truss' condition guarantees the existence of a countable structure consisting of automorphisms ofMwhich can be considered as an atomic model of some theory naturally associated toM. We do it in a general context of weak models for second-order quantifiers.The author thanks Ludomir Newelski for pointing out a mistake in the first version of Theorem 1.2 and for interesting discussions. Also, the author is grateful to the referee for very helpful remarks. (shrink)

In this paper we introduce a generic large cardinal akin to, together with the consequences of being such a generic large cardinal. In this case is Jónsson, and in a choiceless inner model many properties hold that are in contrast with pcf theory in.

Let ZF denote Zermelo-Fraenkel set theory (without the axiom of choice), and let $M$ be a countable transitive model of ZF. The method of forcing extends $M$ to another model $M\lbrack G\rbrack$ of ZF (a "generic extension"). If the axiom of choice holds in $M$ it also holds in $M\lbrack G\rbrack$, that is, the axiom of choice is preserved by generic extensions. We show that this is not true for many weak forms of the axiom of (...) choice, and we derive an application to Boolean toposes. (shrink)

We study the theory of the structure induced by parameter free formulas on a “dense” algebraically independent subset of a model of a geometric theory T. We show that while being a trivial geometric theory, inherits most of the model theoretic complexity of T related to stability, simplicity, rosiness, the NIP and the NTP2. In particular, we show that T is strongly minimal, supersimple of SU‐rank 1, has the NIP or the NTP2 exactly when has these properties. We (...) show that if T is superrosy of thorn rank 1, then so is, and that the converse holds if T satisfies acl = dcl. (shrink)

A study of smooth classes whose generic structures have simple theory is carried out in a spirit similar to Hrushovski 147; Simplicity and the Lascar group, preprint, 1997) and Baldwin–Shi 1). We attach to a smooth class K0, of finite -structures a canonical inductive theory TNat, in an extension-by-definition of the language . Here TNat and the class of existentially closed models of =T+,EX, play an important role in description of the theory of the K0,-generic. We show that (...) if M is the K0,-generic then MEX. Furthermore, if this class is an elementary class then Th=Th). The investigations by Hrushovski and Pillay , provide a general theory for forking and simplicity for the nonelementary classes, and using these ideas, we show that if K0,, where {,*}, has the joint embedding property and is closed under the Independence Theorem Diagram then EX is simple. Moreover, we study cases where EX is an elementary class. We introduce the notion of semigenericity and show that if a K0,-semigeneric structure exists then EX is an elementary class and therefore the -theory of K0,-generic is near model complete. By this result we are able to give a new proof for a theorem of Baldwin and Shelah 1359). We conclude this paper by giving an example of a generic structure whose first-order theory is simple. (shrink)

Consider the expansion TS of a theory T by a predicate for a submodel of a reduct T0 of T. We present a setup in which this expansion admits a model companion TS. We show that some of the nice feat...

Given the assertion of a relation between two types, like: “Epidermis has part some Keratinocyte”, we define silent change as any kind of change of the instance-relata of the relation in question that does not change the truth-value of the respective type-level assertion. Such assertions are notoriously difficult to model in OWL 2. To address this problem, we distinguish different modes of type-level relatedness giving rise to this problem and describe a conservative extension to the BFO top-level ontology that (...) allows expressing these modes. (shrink)

Genericity is the idea that the same program can work at many different data types. Longo, Milstead and Soloviev proposed to capture the inability of generic programs to probe the structure of their instances by the following equational principle: if two generic programs, viewed as terms of type , are equal at any given instance A[T], then they are equal at all instances. They proved that this rule is admissible in a certain extension of System F, but finding (...) a semantically motivated model satisfying this principle remained an open problem.In the present paper, we construct a categorical model of polymorphism, based on game semantics, which contains a large collection of generic types. This model builds on two novel constructions:•A direct interpretation of variable types as games, with a natural notion of substitution of games. This allows moves in games A[T] to be decomposed into the generic part from A, and the part pertaining to the instance T. This leads to a simple and natural notion of generic strategy.•A “relative polymorphic product” which expresses quantification over the type variable Xi in the variable type A with respect to a “universe” which is explicitly given as an additional parameter B. We then solve a recursive equation involving this relative product to obtain a universe in a suitably “absolute” sense.Full Completeness for ML types is proved for this model. (shrink)