Meaningful work is a key element of positive functioning of employees, but what makes work meaningful? Based on research on self-determination theory, basic psychological needs, and prosocial impact, we suggest that there are four psychological satisfactions that substantially influence work meaningfulness across cultures: autonomy (sense of volition), competence (sense of efficacy), relatedness (sense of caring relationships), and beneficence (sense of making a positive contribution). We test the relationships between these satisfactions and perceived meaningful work in Finland (n = 594, employees (...) of several organizations), India (n = 342, collected through Mturk), and the USA (n = 373, collected through Mturk). Regression analyses show that – except for competence in USA – all four satisfactions are significantly and independently associated with meaningful work. Moreover, structural equation modeling shows that they fully mediated the relationship between occupational position and work meaningfulness in India and in the USA. In sum, the results support the importance of these four satisfactions in explaining the psychological underpinnings of meaningful work. (shrink)

Adults identified as believers and sceptics based on self-reports from a supernatural beliefs scale were assessed on two measures of inhibition; the Stroop Color‐Word Task and the Wisconsin Card Sorting Test. Both groups were of equal educational status and background. However, believers made significantly more errors than sceptics on all subscales of the WCST but were equivalent in performance on the Stroop measure. This finding is consistent with the idea that supernatural beliefs in adults are related to some types of (...) inhibitory control. (shrink)

Research on the reasons for vaccine hesitancy has largely focused on factors directly related to vaccines. In contrast, the present study focused on cognitive factors that are not conceptually related to vaccines but that have been linked to other epistemically suspect beliefs such as conspiracy theories and belief in fake news. This survey was conducted before the Covid-19 pandemic (N = 356). The results showed that anti-vaccination attitudes decreased slightly with cognitive abilities and analytic thinking styles, and strongly with scientific (...) literacy. In addition, anti-vaccination attitudes increased slightly with teleological bias and strongly with an intuitive thinking style, ontological biases, and religious and paranormal beliefs. The results suggest that the same cognitive mechanisms that predispose to other epistemically suspect beliefs may predispose to anti-vaccination attitudes as well. The findings also indicate that pro-vaccination communication should focus on early prevention and that interventions against vaccine hesitancy should strive to be intuitively appealing. (shrink)

Randomised clinical trials involve procedures such as randomisation, blinding, and placebo use, which are not part of standard medical care. Patients asked to participate in RCTs often experience difficulties in understanding the meaning of these and their justification.

We give a characterization for those stable theories whose $\omega_{1}$-saturated models have a "Shelah-style" structure theorem. We use this characterization to prove that if a theory is countable, stable, and 1-based without dop or didip, then its $\omega_{1}$-saturated models have a structure theorem. Prior to us, this is proved in a paper of Hart, Pillay, and Starchenko . Some other remarks are also included.

We suggest a method of finding a notion of type to abstract elementary classes and determine under what assumption on these types the class has a well-behaved homogeneous and universal "monster" model, where homogeneous and universal are defined relative to our notion of type.

We show that if is a stable theory with ndop and ndidip, then -primary models over free trees are -minimal over the tree. As a corollary we show, for example, that if is a stable theory and for all nonempty , , then is superstable or it has dop or didip.

Deflationists have argued that truth is an ontologically thin property which has only an expressive function to perform, that is, it makes possible to express semantic generalizations like ‘All the theorems are true’, ‘Everything Peter said is true’, etc. Some of the deflationists have also argued that although truth is ontologically thin, it suffices in conjunctions with other facts not involving truth to explain all the facts about truth. The purpose of this paper is to show that in the case (...) of arithmetic, it is difficult to combine the expressive with the explanatory function of truth if the latter is understood in a deflationist way. We will make our point by investigating several logical systems: first‐order logic, full second‐order logic, and existential second‐order logic. (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)

Working under large cardinal assumptions such as supercompactness, we study the Borel reducibility between equivalence relations modulo restrictions of the nonstationary ideal on some fixed cardinal κ. We show the consistency of Eλ-clubλ++,λ++, the relation of equivalence modulo the nonstationary ideal restricted to Sλλ++ in the space λ++, being continuously reducible to Eλ+-club2,λ++, the relation of equivalence modulo the nonstationary ideal restricted to Sλ+λ++ in the space 2λ++. Then we show that for κ ineffable Ereg2,κ, the relation of equivalence modulo (...) the nonstationary ideal restricted to regular cardinals in the space 2κ is Σ11-complete. We finish by showing that, for Π21-indescribable κ, the isomorphism relation between dense linear orders of cardinality κ is Σ11-complete. (shrink)

In this paper we study a specific subclass of abstract elementary classes. We construct a notion of independence for these AEC’s and show that under simplicity the notion has all the usual properties of first order non-forking over complete types. Our approach generalizes the context of 0-stable homogeneous classes and excellent classes. Our set of assumptions follow from disjoint amalgamation, existence of a prime model over 0/, Löwenheim–Skolem number being ω, -tameness and a property we call finite character. We also (...) start the studies of these classes from the 0-stable case. Stability in 0 and -tameness can be replaced by categoricity above the Hanf number. Finite character is the main novelty of this paper. Almost all examples of AEC’s have this property and it allows us to use weak types, as we call them, in place of Galois types. (shrink)

A logical approach to Bell's Inequalities of quantum mechanics has been introduced by Abramsky and Hardy [2]. We point out that the logical Bell's Inequalities of [2] are provable in the probability logic of Fagin, Halpern and Megiddo [4]. Since it is now considered empirically established that quantum mechanics violates Bell's Inequalities, we introduce a modified probability logic, that we call quantum team logic, in which Bell's Inequalities are not provable, and prove a Completeness Theorem for this logic. For this (...) end we generalise the team semantics of dependence logic [7] first to probabilistic team semantics, and then to what we call quantum team semantics. (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.

If T is an unstable theory of cardinality <λ or countable stable theory with OTOP or countable superstable theory with DOP, λω λω1 in the superstable with DOP case) is regular and λ<λ=λ, then we construct for T strongly equivalent nonisomorphic models of cardinality λ. This can be viewed as a strong nonstructure theorem for such theories. We also consider the case when T is unsuperstable and develop further a result of Shelah about the existence of L∞,λ-equivalent nonisomorphic models for (...) such T. In addition, we show that a natural analogue of Scott's isomorphism theorem fails for models of power κ, if κω is regular, assuming κ<κ=κ. (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 categoricity of the classes of elementary submodels of a homogeneous structure.

This paper is concerned with extensions of geometric stability theory to some nonelementary classes. We prove the following theorem:Theorem. Let [Formula: see text] be a large homogeneous model of a stable diagram D. Let p, q ∈ SD(A), where p is quasiminimal and q unbounded. Let [Formula: see text] and [Formula: see text]. Suppose that there exists an integer n < ω such that [Formula: see text] for any independent a1, …, an∈ P and finite subset C ⊆ Q, but (...) [Formula: see text] for some independent a1, …, an, an+1∈ P and some finite subset C ⊆ Q.Then [Formula: see text] interprets a group G which acts on the geometry P′ obtained from P. Furthermore, either [Formula: see text] interprets a non-classical group, or n = 1,2,3 and•If n = 1 then G is abelian and acts regularly on P′.•If n = 2 the action of G on P′ is isomorphic to the affine action of K ⋊ K* on the algebraically closed field K.•If n = 3 the action of G on P′ is isomorphic to the action of PGL2(K) on the projective line ℙ1(K) of the algebraically closed field K.We prove a similar result for excellent classes. (shrink)

We study the κ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\kappa $$\end{document}-Borel-reducibility of isomorphism relations of complete first order theories in a countable language and show the consistency of the following: For all such theories T and T′\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$T^{\prime }$$\end{document}, if T is classifiable and T′\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$T^{\prime }$$\end{document} is not, then the isomorphism of models of T′\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} (...) \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$T^{\prime }$$\end{document} is strictly above the isomorphism of models of T with respect to κ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\kappa $$\end{document}-Borel-reducibility. In fact, we can also ensure that a range of equivalence relations modulo various non-stationary ideals are strictly between those isomorphism relations. The isomorphism relations are considered on models of some fixed uncountable cardinality obeying certain restrictions. (shrink)

Working with uncountable structures of fixed cardinality, we investigate the complexity of certain equivalence relations and show that if, then many of them are ‐complete, in particular the isomorphism relation of dense linear orders. Then we show that it is undecidable in whether or not the isomorphism relation of a certain well behaved theory (stable, NDOP, NOTOP) is ‐complete (it is, if, but can be forced not to be).

We continue our study of finitary abstract elementary classes, defined in [7]. In this paper, we prove a categoricity transfer theorem for a case of simple finitary AECs. We introduce the concepts of weak κ-categoricity and f-primary models to the framework of א₀-stable simple finitary AECs with the extension property, whereby we gain the following theorem: Let (������, ≼ ������ ) be a simple finitary AEC, weakly categorical in some uncountable κ. Then (������, ≼ ������ ) is weakly categorical in (...) each λ ≥ min { \group{ \{\kappa,\beth_{ \group{ (2^{ \aleph_{ 0 _} ^});^{ + ^} \group} _}\}; \group} . If the class (������, ≼ ������ ) is also LS(������)-tame, weak κ-categoricity is equivalent with κ-categoricity in the usual sense. We also discuss the relation between finitary AECs and some other non-elementary frameworks and give several examples. (shrink)

We use sets of assignments, a.k.a. teams, and measures on them to define probabilities of first-order formulas in given data. We then axiomatise first-order properties of such probabilities and prove a completeness theorem for our axiomatisation. We use the Hardy–Weinberg Principle of biology and the Bell’s Inequalities of quantum physics as examples.

We study the Borel reducibility of isomorphism relations in the generalized Baire space. In the main result we show for inaccessible κ, that if T is a classifiable theory and is stable with the orthogonal chain property (OCP), then the isomorphism of models of T is Borel reducible to the isomorphism of models of.

Henkin quantifiers have been introduced in Henkin (1961). Walkoe (1970) studied basic model-theoretical properties of an extension $L_{*}^{1}$ (H) of ordinary first-order languages in which every sentence is a first-order sentence prefixed with a Henkin quantifier. In this paper we consider a generalization of Walkoe's languages: we close $L_{*}^{1}$ (H) with respect to Boolean operations, and obtain the language L¹(H). At the next level, we consider an extension $L_{*}^{2}$ (H) of L¹(H) in which every sentence is an L¹(H)-sentence prefixed with (...) a Henkin quantifier. We repeat this construction to infinity. Using the (un)definability of truth - in - N for these languages, we show that this hierarchy does not collapse. In addition, we compare some of the present results to the ones obtained by Kripke (1975), McGee (1991), and Hintikka (1996). (shrink)

We introduce Lascar strong types in excellent classes and prove that they coincide with the orbits of the group generated by automorphisms fixing a model. We define a new independence relation using Lascar strong types and show that it is well-behaved over models, as well as over finite sets. We then develop simplicity and show that, under simplicity, the independence relation satisfies all the properties of nonforking in a stable first order theory. Further, simplicity for an excellent class, as well (...) as the independence relation itself, is uniquely determined. Finally, we show that an excellent class is simple if and only if it has extensible U-rank . We deduce that any excellent class of finite U-rank is simple, and that any uncountably categorical excellent class has an expansion with countably many constants which is simple. (shrink)

We start by giving a survey to the theory of $${\text {Borel}}^{*}$$ sets in the generalized Baire space $${\text {Baire}}=\kappa ^{\kappa }$$. In particular we look at the relation of this complexity class to other complexity classes which we denote by $${\text {Borel}}$$, $${\Delta _1^1}$$ and $${\Sigma _1^1}$$ and the connections between $${\text {Borel}}^*$$ sets and the infinitely deep language $$M_{\kappa ^+\kappa }$$. In the end of the paper we will prove the consistency of $${\text {Borel}}^{*}\ne \Sigma ^{1}_{1}$$.

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 search for a set-up in which results from the theory of infinite models hold for finite models. As an example we prove results from stability theory.

Let U and B be two countable relational models of the same first order language. If the models are nonisomorphic, there is a unique countable ordinal α with the property that $\mathfrak{U} \equiv^\alpha_{\infty\omega} \mathfrak{B} \text{but not} \mathfrak{U} \equiv^{\alpha + 1}_{\infty\omega} \mathfrak{B},$ i.e. U and B are L ∞ω -equivalent up to quantifier-rank α but not up to α + 1. In this paper we consider models U and B of cardinality ω 1 and construct trees which have a similar relation (...) to U and B as α above. For this purpose we introduce a new ordering T ≪ T' of trees, which may have some independent interest of its own. It turns out that the above ordinal α has two qualities which coincide in countable models but will differ in uncountable models. Respectively, two kinds of trees emerge from α. We call them Scott trees and Karp trees, respectively. The definition and existence of these trees is based on an examination of the Ehrenfeucht game of length ω 1 between U and B. We construct two models of power ω 1 with 2 ω 1 mutually noncomparable Scott trees. (shrink)

We study how equivalent nonisomorphic models an unsuperstable theory can have. We measure the equivalence by Ehrenfeucht-Fraisse games. This paper continues the work started in $[HT]$.

A superstable homogeneous structure is said to be simple if every complete type over any set A has a free extension over any B ⊇ A. In this paper we give a characterization for this property in terms of U-rank. As a corollary we get that if the structure has finite U-rank, then it is simple.

We show that if M is a stable unsuperstable homogeneous structure, then for most κ ⩽ |M|, the number of elementary submodels of M of power κ is 2κ.

We revisit the theory of amalgamation classes but we do not insist on staying within elementary classes.

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.

For sentences $\phi$ of $L_{\omega_{1},\omega}$, we investigate the question of absoluteness of $\phi$ having models in uncountable cardinalities. We first observe that having a model in $\aleph_{1}$ is an absolute property, but having a model in $\aleph_{2}$ is not as it may depend on the validity of the continuum hypothesis. We then consider the generalized continuum hypothesis context and provide sentences for any $\alpha\in\omega_{1}\setminus\{0,1,\omega\}$ for which the existence of a model in $\aleph_{\alpha}$ is nonabsolute . Finally, we present a complete (...) sentence for which model existence in $\aleph_{3}$ is nonabsolute. (shrink)