Neonatal brain monitoring in the neonatal intensive care units (NICU) requires a continuous review of the spontaneous cortical activity, i.e., the electroencephalograph (EEG) background activity. This needs development of bedside methods for an automated assessment of the EEG background activity. In this paper, we present development of the key components of a neonatal EEG background classifier, starting from the visual background scoring to classifier design, and finally to possible bedside visualization of the classifier results. A dataset with 13,200 5-minute EEG (...) epochs (8–16 channels) from 27 infants with birth asphyxia was used for classifier training after scoring by two independent experts. We tested three classifier designs based on 98 computational features, and their performance was assessed with respect to scoring system, pre- and post-processing of labels and outputs, choice of channels, and visualization in monitor displays. The optimal solution achieved an overall classification accuracy of 97% with a range across subjects of 81–100%. We identified a set of 23 features that make the classifier highly robust to the choice of channels and missing data due to artefact rejection. Our results showed that an automated bedside classifier of EEG background is achievable, and we publish the full classifier algorithm to allow further clinical replication and validation studies. (shrink)

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)

Human communication can be either monosemiotic or polysemiotic, depending on whether it combines ensembles of representations from one or more semiotic systems such as language, gesture and depiction. Each semiotic system has its unique storytelling potentials, which makes intersemiotic translation from one system to another challenging. We investigated the influence of the source semiotic system, realised in speech and a sequence of pictures, respectively, on the way the same story was retold using speech and co-speech gestures. The story was the (...) content of the picture book Frog, Where Are You?. A group of Finnish speakers saw the story in pictures, and another group heard it in matched oral narration. Each participant retold the story to an addressee and all narrations were video-recorded and analysed for both speech and gestures. Given the high degree of iconicity in depiction, we expected more iconic gestures (especially enactments) in the narratives translated from pictures than in those translated from speech. Conversely, we expected greater narrative coherence in the narratives translated from speech. The results showed that more iconic gestures were produced in the narratives translated from speech, but these were primarily not from the enactment subtype. As expected, iconic enactments were more frequent in the narratives translated from the story presented in pictures. The narratives produced by participants who had only heard the story did not have a greater variety of connective devices, yet the type of devices differed slightly between the groups. Together with some additional differences between the groups that had not been anticipated, the results indicate that a story presented in different semiotic systems tends to be translated into different polysemiotic narratives. (shrink)

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)

This article focuses on the Russian chemist Dmitri Ivanovich Mendeleev's assessment of certain representations of various aspects of the periodic system that employed more mathematical methodology. The equations of interest were created by E. J. Mills, B. N. Chicherin, and J. H. Vincent. The English chemist Mills tried to find a firmer numerical basis for the periodicity of the elements. The Russian lawyer and political philosopher Chicherin was convinced of the existence of a mathematical law underlying the periodic system. The (...) English physicist Vincent explored the connection between atomic weights and the elements' order in listings based on atomic weights—a project which he associated with the periodic system of elements. Although, for Mendeleev, the equations of Mills, Chicherin, and Vincent promised a more precise expression of the law of periodicity, he continued to invoke his earlier standards. In particular, Mendeleev wanted the equations to respect the individuality of the elements, and called for completeness in conveying the complexities of chemical phenomena. Thus, the very qualities that he had valued while developing his periodic system in 1869–1871 also characterised his evaluation of the new means of representing aspects of that system. (shrink)

Dmitrii Mendeleev’s periodic system is known for its predictive accuracy, but talk of its completeness is rarer. This is surprising because completeness was a quality that Mendeleev saw as important for a systematization of the chemical elements. Here, I explain how Mendeleev’s valuing of completeness influenced the development of his periodic system. After introducing five indicators of its completeness, I zoom into one in particular: Mendeleev’s inclusion of a schematic row of oxides. I then show how it guided Mendeleev’s predictions (...) of indium and ekaboron, which suggests that the valuing of completeness was instrumental for making predictions. (shrink)

Presentism – the influence of the present on historians’ work – has been met with resistance among historians of science; many hold that excessive reference to the present can compromise the aim of understanding past practices in their own terms. In response to this concern, a number of authors have argued that not only is such influence inevitable, it can also be legitimate and helpful. In probing into the presentist and anti-presentist positions in histories of science, I argue here that (...) there is a much larger degree of compatibility between the two positions than has been previously acknowledged. Building on recent work on legitimate forms of presentism, I argue that at least three types of presentism – empirical presentism, motivational presentism, critical presentism – display compatibility with anti-presentism, insofar as certain pitfalls of presentism are kept in mind. (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 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 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 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.

The Nordic countries aim to have a unique place within the European and global health data economy. They have extensive nationally maintained and centralized health data records, as well as numerous biobanks where data from individuals can be connected based on personal identification numbers. Much of this phenomenon can be attributed to the emergence and development of the Nordic welfare state, where Nordic countries sought to systematically collect large amounts of population data to guide decision making and improve the health (...) and living conditions of the population. Recently, however, the so-called Nordic gold mine of data is being re-imagined in a wholly other context, where data and its ever-increasing logic of accumulation is seen as a driver for economic growth and private business development. This article explores the development of policies and strategies for health data economy in Denmark and Finland. We ask how nation states try to adjust and benefit from new pressures and opportunities to utilize their data resources in data markets. This raises questions of social sustainability in terms of states being producers, providers, and consumers of data. The data imaginaries related to emerging health data markets also provide insight into how a broad range of different data sources, ranging from hospital records and pharmacy prescriptions to biobank sample data, are brought together to enable “full-scale utilization” of health and welfare data. (shrink)

In this paper we prove a strong nonstructure theorem for κ(T)-saturated models of a stable theory T with dop. This paper continues the work started in [1].

In this paper we prove a strong nonstructure theorem for κ(T)-saturated models of a stable theory T with dop. This paper continues the work started in [1].

We study how equivalent nonisomorphic models of unsuperstable theories can be. We measure the equivalence by Ehrenfeucht-Fraisse games. This paper continues [HS].

We generalize the result of Mekler and Shelah [3] that the existence of a canary tree is independent of ZFC + GCH to uncountable regular cardinals. We also correct an error from the original proof.

In this paper we prove a strong nonstructure theorem for $\kappa$-saturated models of a stable theory T with dop. This paper continues the work started in [1].

We prove a main gap theorem for locally saturated submodels of a homogeneous structure. We also study the number of locally saturated models, which are not elementarily embeddable into each other.

We prove a main gap theorem for locally saturated submodels of a homogeneous structure. We also study the number of locally saturated models, which are not elementarily embeddable into each other.

We generalize the result of Mekler and Shelah [3] that the existence of a canary tree is independent of ZFC + GCH to uncountable regular cardinals. We also correct an error from the original proof.

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)

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}$$.

Much has been said about the accuracy of the famous predictions of the Russian chemist Dmitrii Ivanovich Mendeleev, but far less has been written on how he made his predictions. Here we offer an explanation on how Mendeleev used his periodic system to predict both physical and chemical properties of little-known and entirely unknown chemical elements. We argue that there seems to be compelling evidence in favour of Mendeleev genuinely relying on his periodic system in the course of issuing his (...) predictions—a point recently contested by Woody Science after the practice turn in the philosophy, history, and social studies of science, Routledge, Abington, 2014). In particular, by using the known properties of a number of near neighbours of the three entirely unknown elements, we seek to show how the very format of his table enabled it to function as a powerful tool for Mendeleev in arriving at his predicted values. We suggest that Mendeleev’s use of the periodic system in making his prediction gives an illuminative example of what Woody calls “theoretical practices” in science. (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)

According to surveys and opinion polls, citizens in Nordic welfare societies have positive, supportive attitudes towards medical research and biobanking. In Finland, it was expected that this would result in the active biobank participation of patients and citizens. Indeed, public support has been rhetorically utilised as a unique societal factor and advantage in the promotion of Finnish biobanks, underlining the potential Finland offers for the international biomedical enterprise. In this paper, we critically analyse the use of notions such as ‘willing (...) population’ and ‘engaged people’ in the promotion and legitimation of biobanking. First, there is a seeming contradiction between positive attitudes and actual participation rates, as biobanks have faced unexpected challenges in participant recruitment during the first years of their operations. As a result, the concept of a willing population was redirected to problematise the necessity of informed consent. Second, we question whether it is even meaningful to assume the existence of an informed and engaged population with regard to biobanking. Therefore, we suggest that it is problematic to talk about a willing population at the same time as the relevance of the informed consent system is being questioned by biobank actors and policy makers. We analyse this tension in relation to existing data on Finnish people’s attitudes, pointing out that positive, supportive views do not directly transform into high participation rates; nor do they justify the claims of policy makers and biobank proponents that people are willing to participate, when in fact surveys report that people know very little about biobanks. (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.

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.

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)

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 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)

This article poses the question of whether biobanking practices and standards are giving rise to the construction of populations from which various biobanking initiatives increasingly draw on for legitimacy? We argue that although recent biobanking policies encourage various forms of engagement with publics to ensure legitimacy, different biobanks conceptualize their engagement strategies very differently. We suggest that biobanks undertake a broad range of different strategies with regard to engagement. We argue that these different approaches to engagement strategies are contributing to (...) the construction of populations, whereby specific nationalities, communities, societies, patient groups and political systems become imbued or bio-objectified with particular characteristics, such as compliant, distant, positive, commercialized or authoritarian. This bio-objectification process is problematic in relation to policy aspirations ascribed to biobanking engagement since it gives rise to reified notions of different populations. (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 characterize the classifiability of a countable first-order theory T in terms of the solvability of the potential-isomorphism problem for models of T.

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.