Studies of the regulation of heme oxygenase by synthetic metalloporphyrins reveal that within this group of compounds there exist both inducers and inhibitors of the synthesis of this enzyme or of its catalytic function. The ability of metalloporphyrins to alter heme catabolism is of considerable experimental and clinical interest since such alterations may have consequences for other aspects of heme homeostasis, including its synthesis and its function in the form of cytochrome(s) P‐450. Examples of the metabolic effects – and their (...) potential clinical and pharmacological consequences – produced by two synthetic metalloporphyrins, Sn‐protoporphyrin and Co‐protoporphyrin, are discussed. (shrink)

A key feature of facial behavior is its dynamic quality. However, most previous research has been limited to the use of static images of prototypical expressive patterns. This article explores the role of facial dynamics in the perception of emotions, reviewing relevant empirical evidence demonstrating that dynamic information improves coherence in the identification of affect (particularly for degraded and subtle stimuli), leads to higher emotion judgments (i.e., intensity and arousal), and helps to differentiate between genuine and fake expressions. The findings (...) underline that using static expressions not only poses problems of ecological validity, but also limits our understanding of what facial activity does. Implications for future research on facial activity, particularly for social neuroscience and affective computing, are discussed. (shrink)

Emotions are foremost self-regulating processes that permit rapid responses and adaptations to situations of personal concern. They have biological bases and are shaped ontogenetically via learning and experience. Many situations and events of personal concern are social in nature. Thus, social exchanges play an important role in learning about rules and norms that shape regulation processes. I argue that (a) emotions often are actively auto-regulating—the behavior implied by the emotional reaction bias to the eliciting event or situation modifies or terminates (...) the situation; (b) certain emotion components are likely to habituate dynamically, modifying the emotional states; (c) emotions are typically intra- and interpersonal processes at the same time, and modulating forces at these different levels interact; (d) emotions are not just regulated—they regulate. Important conclusions of my arguments are that the scientific analysis of emotion should not exclude regulatory processes, and that effortful emotion regulation should be seen relative to a backdrop of auto-regulation and habituation, and not the ideal notion of a neutral baseline. For all practical purposes unregulated emotion is not a realistic concept. (shrink)

Affective computing adopts a computational approach to study affect. We highlight the AC approach towards automated affect measures that jointly model machine-readable physiological/behavioral signals with affect estimates as reported by humans or experimentally elicited. We describe the conceptual and computational foundations of the approach followed by two case studies: one on discrimination between genuine and faked expressions of pain in the lab, and the second on measuring nonbasic affect in the wild. We discuss applications of the measures, analyze measurement accuracy (...) and generalizability, and highlight advances afforded by computational tipping points, such as big data, wearable sensing, crowdsourcing, and deep learning. We conclude by advocating for increasing synergies between AC and affective science and offer suggestions toward that direction. (shrink)

Appraisal theory assumes that the individual variability of emotional reactions to the same situation is due to individual differences in appraisal. However, the question of how interindividual differences in appraisal come about has been rarely formally addressed. We focus on one of the central dimensions of appraisal—problem-focused coping potential—and attempt to explain individual differences in appraisals along this dimension using self-efficacy theory. We integrate outcome expectancies, self-efficacy expectations, and problem-focused coping potential into a single framework and outline their personality antecedents. (...) Using generalized self-efficacy beliefs as an example, we then discuss the mechanisms underlying the effects of personality dispositions on appraisal and the conditions that moderate their influence. We conclude with the implications for theory, research, and practice. (shrink)

This paper investigates the effects of relative position and proxemics in the engagement process involved in Human-Robot collaboration. We evaluate the differences between two experimental placement conditions for an autonomous robot in a collaborative task with a user across two different types of robot behaviours. The study evaluated placement and behaviour types around a touch table with 80 participants by measuring gaze, smiling behaviour, distance from the task, and finally electrodermal activity. Results suggest an overall user preference and higher engagement (...) rates with the helpful robot in the frontal position. We discuss how behaviours and position of the robot relative to a user may affect user engagement and collaboration, in particular when the robot aims to provide help via socio-emotional bonding. (shrink)

This paper investigates the effects of relative position and proxemics in the engagement process involved in Human-Robot collaboration. We evaluate the differences between two experimental placement conditions for an autonomous robot in a collaborative task with a user across two different types of robot behaviours. The study evaluated placement and behaviour types around a touch table with 80 participants by measuring gaze, smiling behaviour, distance from the task, and finally electrodermal activity. Results suggest an overall user preference and higher engagement (...) rates with the helpful robot in the frontal position. We discuss how behaviours and position of the robot relative to a user may affect user engagement and collaboration, in particular when the robot aims to provide help via socio-emotional bonding. (shrink)

Understanding the impact of robot errors in child-robot-interactions (CRI) is critical, as current technological systems are still limited and may randomly present a variety of mistakes during interactions with children. In this study we manipulate a task-based error of a NAO robot during a semi-autonomous computational thinking task implemented with the Cozmo robot. Data from 72 children aged 7–10 were analysed regarding their attitudes towards NAO (social trust, competency trust, liking, and perceived agency), their behaviour towards the robot (self-disclosure, following (...) recommendations), as well as their task performance. We did not find quantitative effects of the robot’s error on children’s self-reported attitudes, behaviour, or task performance. Age was also not significantly related to either social attitudes or behaviours towards NAO, although there were some age-related differences in task performance. Potential reasons behind the lack of statistical effects and limitations of the study with regards to the manipulation of robot errors are discussed and insights into the design of future CRI studies provided. (shrink)

In the framework of algebras with infinitary operations, the equational theory of $$\bigvee _{\kappa }$$ ⋁ κ -complete Heyting algebras or Heyting $$\kappa $$ κ -frames is studied. A Hilbert style calculus algebraizable in this class is formulated. Based on the infinitary structure of Heyting $$\kappa $$ κ -frames, an equational type completeness theorem related to the $$\langle \bigvee, \wedge, \rightarrow, 0 \rangle $$ ⟨ ⋁, ∧, →, 0 ⟩ -structure of frames is also obtained.

We show that the tree property, stationary reflection and the failure of approachability at \ are consistent with \= \kappa ^+ < 2^\kappa \), where \ is a singular strong limit cardinal with the countable or uncountable cofinality. As a by-product, we show that if \ is a regular cardinal, then stationary reflection at \ is indestructible under all \-cc forcings.

We study normal ideals on Pκ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${P_{\kappa} }$$\end{document} that are defined in terms of games of uncountable length.

We discuss the relationships between the notions of $\kappa $ -cub game on $\lambda $ , $\kappa $ -cub subset of $\lambda $ , the ideal of good subsets of $\lambda $ and the problem of adding a $\kappa $ -cub into a given $\kappa $ -stationary subset of $\lambda $ . We also give a short introduction to the ideal of good subsets of $\lambda $.

In this paper we prove, under the assumption of a strong partition property for an uncountable cardinal $\kappa$, the existence of more than $\kappa$-many measurable cardinals greater than $\kappa$. Our proof involves so-called seminormal measures, and, along the way, we establish several key facts about such measures.

Lennart Åqvist (1992) proposed a logical theory of legal evidence, based on the Bolding-Ekelöf of degrees of evidential strength. This paper reformulates Åqvist's model in terms of the probabilistic version of the kappa calculus. Proving its acceptability in the legal context is beyond the present scope, but the epistemological debate about Bayesian Law isclearly relevant. While the present model is a possible link to that lineof inquiry, we offer some considerations about the broader picture of thepotential of AI & Law (...) in the evidentiary context. Whereas probabilisticreasoning is well-researched in AI, calculations about the threshold ofpersuasion in litigation, whatever their value, are just the tip of theiceberg. The bulk of the modeling desiderata is arguably elsewhere, if one isto ideally make the most of AI's distinctive contribution as envisaged forlegal evidence research. (shrink)

We study \(\kappa \) -maximal cofinitary groups for \(\kappa \) regular uncountable, \(\kappa = \kappa ^{. Revisiting earlier work of Kastermans and building upon a recently obtained higher analogue of Bell’s theorem, we show that: Any \(\kappa \) -maximal cofinitary group has \({ many orbits under the natural group action of \(S(\kappa )\) on \(\kappa \). If \(\mathfrak {p}(\kappa ) = 2^\kappa \) then any partition of \(\kappa \) into less than \(\kappa \) many sets can be realized as the (...) orbits of a \(\kappa \) -maximal cofinitary group. For any regular \(\lambda > \kappa \) it is consistent that there is a \(\kappa \) -maximal cofinitary group which is universal for groups of size \({. If we only require the group to be universal for groups of size \(\kappa \) then this follows from \(\mathfrak {p}(\kappa ) = 2^\kappa \). (shrink)

Phi Beta Kappa Romanell Lectures, given at Michigan State University, February 2008.

We prove that the class of trees with no branches of cardinality $\geq\kappa$ is not RPC definable in $L_{\infty\kappa}$ when $\kappa$ is regular. Earlier such a result was known for $L_{\kappa^+\kappa}$ under the assumption $\kappa^{<\kappa} = \kappa$. Our main result is actually proved in a stronger form which covers also $L_{\infty\lambda}$ (and makes sense there) for every strong limit cardinal $\lambda > \kappa$ of cofinality $\kappa$.

The main result of this paper is that if $\kappa$ is not a weakly Mahlo cardinal, then the following two conditions are equivalent: 1. $\mathscr{P}(\kappa)/ \mathscr{J}$ is $\kappa^+$-complete. 2. $\mathscr{J}$ is a prenormal ideal. Our result is a generalization of an announcement made in [Z]. We say that $\mathscr{J}$ is selective iff for every $\mathscr{J}$-function $f: \kappa \rightarrow \kappa$ there is a set $X \in \mathscr{J}$ such that $f\mid(\kappa - X)$ is one-to-one. Our theorem provides a positive partial answer to (...) a question of B. Weglorz from [BTW, p. 90], viz.: is every selective ideal $\mathscr{J}$, with $\mathscr{P}(\kappa)/\mathscr{J} \kappa^+$-complete, isomorphic to a normal ideal? The theorem is also true for fine ideals on $\lbrack\lambda\rbrack^{<\kappa}$ for any $\kappa \leq \lambda$, i.e. if $\kappa$ is not a weakly Mahlo cardinal then the Boolean algebra $\mathscr{P} (\lbrack\lambda\rbrack^{<\kappa})/\mathscr{J}$ is $\lambda^+$-complete iff $\mathscr{J}$ is a prenormal ideal (in the sense of $\lbrack\lambda\rbrack^{<\kappa})$. (shrink)

A model is said to be -like if but for all , . In this paper, we shall study sentences true in -like models of arithmetic, especially in the cases when is singular. In particular, we identify axiom schemes true in such models which are particularly `natural' from a combinatorial or model-theoretic point of view and investigate the properties of models of these schemes.

We consider a version of \-Miller forcing on an uncountable cardinal \. We show that under \, \, and forcing with \\) collapses \ to \.

It is proved that $\Pi^1_1$ -indescribability in $P_{\kappa}\lambda$ can be characterized by combinatorial properties without taking care of cofinality of $\lambda$ . We extend Carr's theorem proving that the hypothesis $\kappa$ is $2^{\lambda^{<\kappa}}$ -Shelah is rather stronger than $\kappa$ is $\lambda$ -supercompact.

Suppose $\kappa$ is a supercompact cardinal and $\lambda > \kappa$. We study the relationship between the partition property and the weak partition property for normal ultrafilters on $P_\kappa\lambda$. On the one hand, we show that the following statement is consistent, given an appropriate large cardinal assumption: The partition property and the weak partition property are equivalent, there are many normal ultrafilters that satisfy these properties, and there are many normal ultrafilters that do not satisfy these properties. On the other hand, (...) we consider the assumption that, for some $\lambda > \kappa$, there exists a normal ultrafilter $U$ on $P_\kappa\lambda$ such that $U$ satisfies the weak partition property but does not satisfy the partition property. We show that this assumption is implied by the assertion that there exists a cardinal $\gamma > \kappa$ such that $\gamma$ is $\gamma^+$-supercompact, and, assuming the GCH, it implies the assertion that there exists a cardinal $\gamma > \kappa$ such that $\gamma$ is a measurable cardinal with a normal ultrafilter concentrating on measurable cardinals. (shrink)

Starting from a model with a Laver-indestructible supercompact cardinal $$\kappa $$, we construct a model of $$ZF+DC_{\kappa }$$ where there are no $$\kappa $$ -mad families.

Starting in 2005, general logical metatheorems have been developed that guarantee the extractability of uniform effective bounds from large classes of proofs of theorems that involve abstract metric structures X. In this paper we adapt this to the class of CAT\)-spaces X for \ and establish a new metatheorem that explains specific bound extractions that recently have been achieved in this context as instances of a general logical phenomenon.

We investigate the partition property of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{P}_{\kappa}\lambda}$$\end{document}. Main results of this paper are as follows: (1) If λ is the least cardinal greater than κ such that \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{P}_{\kappa}\lambda}$$\end{document} carries a (λκ, 2)-distributive normal ideal without the partition property, then λ is \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\Pi^1_n}$$\end{document}-indescribable for all n < ω but not \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} (...) \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\Pi^2_1}$$\end{document} -indescribable. (2) If cf(λ) ≥ κ, then every ineffable subset of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{P}_{\kappa}\lambda}$$\end{document} has the partition property. (3) If cf(λ) ≥ κ, then the completely ineffable ideal over \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{P}_{\kappa}\lambda}$$\end{document} has the partition property. (shrink)

Assuming the existence of a supercompact cardinal, we construct a model of ZFC + (There exists a nonsplitting stationary subset of $\mathscr{P}_|kappa(\kappa^+)$). Answering a question of Uri Abraham [A], [A-S], we prove that adding a real to the world always makes $\mathscr{P}_{\aleph_1}(\aleph_2) - V$ stationary.

In this paper, the following are proved:Theorem A. The quotient algebra ${\cal P} (\kappa )/I$ is complete if and only if the only non-trivial I -closed ideals extending I are of the form $I\lceil A$ for some $A\in I^+$ .Theorem B. If $\kappa$ is a stationary cardinal, then the quotient algebra ${\cal P} (\kappa )/ NS_\kappa$ is not complete.Corollary. (1) If $\kappa$ is a weak compact cardinal, then the quotient algebra ${\cal P} (\kappa )/NS_\kappa$ is not complete.(2) If $\kappa$ bears (...) $\kappa$ -saturated ideal, then the quotient algebra ${\cal P} (\kappa )/NS_\kappa$ is not complete.Theorem C. Assume that $\kappa$ is a strongly compact cardinal, I is a non-trivial normal $\kappa$ -complete ideal on $\kappa$ and B is an I -regular complete Boolean algebra. Then if ${\cal P} (\kappa )/I$ is complete, it is B -valid that for some $A\subseteq\check\kappa$ , ${\cal P} (\kappa )/({\bf J}\lceil A)$ is complete, where J is the ideal generated by $\check I$ in $V^B$ .Corollary. Let M be a transitive model of ZFC and in M , let $\kappa$ be a strongly compact cardinal and $\lambda$ a regular uncountable cardinal less than $\kappa$ . Then there exists a generic extension M [ G ] in which $\kappa =\lambda^+$ and $\kappa$ carries a non-trivial $\kappa$ -complete ideal I which is completive but not $\kappa^+$ -saturated. (shrink)