Finitely algebraizable deductive systems were introduced by Blok and Pigozzi to capture the essential properties of those deductive systems that are very tightly connected to quasivarieties of universal algebras. They include the equivalential logics of Czelakowski. Based on Blok and Pigozzi’s work, Herrmann defined algebraizable deductive systems. These are the equivalential deductive systems that are also truth-equational, in the sense that the truth predicate of the class of their reduced matrix models is explicitly definable by some set of unary equations. (...) Raftery undertook the task of characterizing the property of truth-equationality for arbitrary deductive systems. In this paper, following Raftery, we extend the notion of truth-equationality for logics formalized as $\pi$-institutions and abstract several of the results that hold for deductive systems in this more general categorical context. (shrink)

The categorical dualities presented are: (first) for the category of bi-algebraic lattices that belong to the variety generated by the smallest non-modular lattice with complete (0,1)-lattice homomorphisms as morphisms, and (second) for the category of non-trivial (0,1)-lattices belonging to the same variety with (0,1)-lattice homomorphisms as morphisms. Although the two categories coincide on their finite objects, the presented dualities essentially differ mostly but not only by the fact that the duality for the second category uses topology. Using the presented (...) dualities and some known in the literature results we prove that the Q-lattice of any non-trivial variety of (0,1)-lattices is either a 2-element chain or is uncountable and non-distributive. (shrink)

In [9] it is proved the categorical isomorphism of two varieties: bounded commutative BCK-algebras and MV -algebras. The class of MV -algebras is the algebraic counterpart of the infinite valued propositional calculus L of Lukasiewicz . The main objective of the present paper is to study that isomorphism from the perspective of logic. The B-C-K logic is algebraizable and the quasivariety of BCKalgebras is the equivalent algebraic semantics for that logic . We call commutative B-C-K logic, briefly cBCK, (...) to the extension of B-C-K logic associated to the variety of commutative BCK–algebras. Moreover, we present the extension Boc of cBCK obtained by adding the axiom of “boundness”. We prove that the deductive system Boc is equivalent to L. We observe that cBCK admits two interesting extensions: the logic Boc, treated in this paper, which is equivalent to the system L of Lukasiewicz, and the logic Co that is naturally associated to the system Balo of `-groups . This constructions establish a link between L and Balo , that would be a logical approach to the categorical relationship between MV–algebras and `-groups. (shrink)

Relatively congruence regular quasivarieties and quasivarieties of logic have noticeable similarities. The paper provides a unifying framework for them which extends the Blok-Pigozzi theory of elementarily algebraizable (and protoalgebraic) deductive systems. In this extension there are two parameters: a set of terms and a variable. When the former is empty or consists of theorems, the Blok-Pigozzi theory is recovered, and the variable is redundant. On the other hand, a class of membership logics is obtained when the variable is the only (...) element of the set of terms. For these systems the appropriate variant of equivalent algebraic semantics encompasses the relatively congruence regular quasivarieties. (shrink)

The quasivariety of BCK-algebras is widely known and investigated class of algebras. It is a natural semantic for the BCK-logic but there are also others quasivarieties of algebras with the above property and there are even some varieties among them. The aim of this note is to bring to the reader’s a attention the lattice they form. In what follows we shall only consider classes of algebras of type.

For quasivarieties of algebras, we consider the property of having definable relative principal subcongruences, a generalization of the concepts of definable relative principal congruences and definable principal subcongruences. We prove that a quasivariety of algebras with definable relative principal subcongruences has a finite quasiequational basis if and only if the class of its relative (finitely) subdirectly irreducible algebras is strictly elementary. Since a finitely generated relatively congruence-distributive quasivariety has definable relative principal subcongruences, we get a new proof of (...) the result due to D. Pigozzi: a finitely generated relatively congruence-distributive quasivariety has a finite quasi-equational basis. (shrink)

This article considers categorical perception (CP) as a crucial process involved in all sort of communication throughout the biological hierarchy, i.e. in all of biosemiosis. Until now, there has been consideration of CP exclusively within the functional cycle of perception–cognition–action and it has not been considered the possibility to extend this kind of phenomena to the mere physiological level. To generalise the notion of CP in this sense, I have proposed to distinguish between categorical perception (CP) and (...) class='Hi'>categorical sensing (CS) in order to extend the CP framework to all communication processes in living systems, including intracellular, intercellular, metabolic, physiological, cognitive and ecological levels. The main idea is to provide an account that considers the heterarchical embeddedness of many instances of CP and CS. This will take me to relate the hierarchical nature of categorical sensing and perception with the equally hierarchical issues of the “binding problem”, “triadic causality”, the “emergent interpretant” and the increasing semiotic freedom observed in biological and cognitive systems. (shrink)

In this paper we study some questions concerning Łukasiewicz implication algebras. In particular, we show that every subquasivariety of Łukasiewicz implication algebras is, in fact, a variety. We also derive some characterizations of congruence permutable algebras. The starting point for these results is a representation of finite Łukasiewicz implication algebras as upwardly-closed subsets in direct products of MV-chains.

We prove that each ω-categorical, generically stable group is solvable-by-finite.

We investigate effective categoricity for polymodal algebras. We prove that the class of polymodal algebras is complete with respect to degree spectra of nontrivial structures, effective dimensions, expansion by constants, and degree spectra of relations. In particular, this implies that every categoricity spectrum is the categoricity spectrum of a polymodal algebra.

The paper describes the isomorphic lattices of quasivarieties of commutative quasigroup modes and of cancellative commutative binary modes. Each quasivariety is characterised by providing a quasi-equational basis. A structural description is also given. Both lattices are uncountable and distributive.

We show that the categoricity of second-order Peano axioms can be proved from the comprehension axioms. We also show that the categoricity of second-order Zermelo–Fraenkel axioms, given the order type of the ordinals, can be proved from the comprehension axioms. Thus these well-known categoricity results do not need the so-called “full” second-order logic, the Henkin second-order logic is enough. We also address the question of “consistency” of these axiom systems in the second-order sense, that is, the question of existence of (...) models for these systems. In both cases we give a consistency proof, but naturally we have to assume more than the mere comprehension axioms. (shrink)

A quasivariety of algebras has the joint embedding property (JEP) if and only if it is generated by a single algebra A. It is structurally complete if and only if the free ℵ0‐generated algebra in can serve as A. A consequence of this demand, called ‘passive structural completeness’ (PSC), is that the nontrivial members of all satisfy the same existential positive sentences. We prove that if is PSC then it still has the JEP, and if it has the JEP (...) and its nontrivial members lack trivial subalgebras, then its relatively simple members all belong to the universal class generated by one of them. Under these conditions, if is relatively semisimple then it is generated by one ‐simple algebra. We also prove that a quasivariety of finite type, with a finite nontrivial member, is PSC if and only if its nontrivial members have a common retract. The theory is then applied to the variety of De Morgan monoids, where we isolate the sub(quasi)varieties that are PSC and those that have the JEP, while throwing fresh light on those that are structurally complete. The results illuminate the extension lattices of intuitionistic and relevance logics. (shrink)

Let be an abstract elementary class with amalgamation, and Lowenheim Skolem number LS. We prove that for a suitable Hanf number gc0 if χ0 < λ0 λ1, and is categorical inλ1+ then it is categorical in λ0.

In this paper we show that the quasivariety generated by an infinite simple MV-algebra only depends on the rationals which it contains. We extend this property to arbitrary families of simple MV-algebras.

During public health crises including the COVID-19 pandemic, resource scarcity and contagion risks may require health systems to shift—to some degree—from a usual clinical ethic, focused on the well-being of individual patients, to a public health ethic, focused on population health. Many triage policies exist that fall under the legal protections afforded by “crisis standards of care,” but they have key differences. We critically appraise one of the most fundamental differences among policies, namely the use of criteria to categorically exclude (...) certain patients from eligibility for otherwise standard medical services. We examine these categorical exclusion criteria from ethical, legal, disability, and implementation perspectives. Focusing our analysis on the most common type of exclusion criteria, which are disease-specific, we conclude that optimal policies for critical care resource allocation and the use of cardiopulmonary resuscitation (CPR) should not use categorical exclusions. We argue that the avoidance of categorical exclusions is often practically feasible, consistent with public health norms, and mitigates discrimination against persons with disabilities. (shrink)

This paper offers a conceptual clarification of the phenomenon commonly referred to as categorical perception of color, both in adults and in infants. First, I argue against the common notion of categorical perception as involving a distortion of the perceptual color space. The effects observed in the categorical perception research concern categorical discrimination performance and the underlying processing; they need not directly reflect the relations of color similarity and difference. Moreover, the methodology of the research actually (...) presupposes that the relations of similarity and difference do not vary with languages. The observed categorical perception effects should be conceived independently of the perceptual color space. Second, I challenge the usual opinion that the existing evidence on infant “categorical perception” allows us to conclude that infants perceptually categorize color, and in particular, that they have perceptual categories that resemble the basic color categories of English. Such conclusions rest on an unjustified interpretation of the infant “categorical perception” findings in terms of adult linguistic categorical boundaries. Based on the suggested new understanding, I propose that the phenomenon, as present in infants, should be conceived and examined as a possible explanatory factor with respect to the existing patterns of color naming in languages of the world. (shrink)

Husserl's two notions of "definiteness" enabled him to clarify the problem of imaginary numbers. The exact meaning of these notions is a topic of much controversy. A "definite" axiom system has been interpreted as a syntactically complete theory, and also as a categorical one. I discuss whether and how far these readings manage to capture Husserl's goal of elucidating the problem of imaginary numbers, raising objections to both positions. Then, I suggest an interpretation of "absolute definiteness" as semantic completeness (...) and argue that this notion does not suffice to explain Husserl's solution to the problem of imaginary numbers. (shrink)

Due to Gӧdel’s incompleteness results, the categoricity of a sufficiently rich mathematical theory and the semantic completeness of its underlying logic are two mutually exclusive ideals. For first- and second-order logics we obtain one of them with the cost of losing the other. In addition, in both these logics the rules of deduction for their quantifiers are non-categorical. In this paper I examine two recent arguments –Warren (2020), Murzi and Topey (2021)– for the idea that the natural deduction rules (...) for the first-order universal quantifier are categorical, i.e., they uniquely determine its semantic intended meaning. Both of them make use of McGee’s open-endedness requirement and the second one uses in addition Garson’s (2013) local models for defining the validity of these rules. I argue that the success of both these arguments is relative to their semantic or infinitary assumptions, which could be easily discharged if the introduction rule for the universal quantifier is taken to be an infinitary rule, i.e. non-compact. Consequently, I reconsider the use of the ω-rule and I show that the addition of the ω-rule to the standard formalizations of first-order logic is categorical. In addition, I argue that the open-endedness requirement does not make the first-order Peano Arithmetic categorical and I advance an argument for its categoricity based on the inferential conservativity requirement. (shrink)

The results in this paper are in a context of abstract elementary classes identified by Shelah and Villaveces in which the amalgamation property is not assumed. The long-term goal is to solve Shelah’s Categoricity Conjecture in this context. Here we tackle a problem of Shelah and Villaveces by proving that in their context, the uniqueness of limit models follows from categoricity under the assumption that the subclass of amalgamation bases is closed under unions of bounded, -increasing chains.

We explore the interplay between $\omega $ -categoricity and pseudofiniteness for groups, and we conjecture that $\omega $ -categorical pseudofinite groups are finite-by-abelian-by-finite. We show that the conjecture reduces to nilpotent p-groups of class 2, and give a proof that several of the known examples of $\omega $ -categorical p-groups satisfy the conjecture. In particular, we show by a direct counting argument that for any odd prime p the ( $\omega $ -categorical) model companion of the theory (...) of nilpotent class 2 exponent p groups, constructed by Saracino and Wood, is not pseudofinite, and that an $\omega $ -categorical group constructed by Baudisch with supersimple rank 1 theory is not pseudofinite. We also survey some scattered literature on $\omega $ -categorical groups over 50 years. (shrink)

In this paper, we give a classification of ℵ0-categorical coloured linear orders, generalizing Rosenstein's characterization of ℵ0-categorical linear orderings. We show that they can all be built from coloured singletons by concatenation and ℚn-combinations . We give a method using coding trees to describe all structures in our list.

In this paper we study some questions concerning Łukasiewicz implication algebras. In particular, we show that every subquasivariety of Łukasiewicz implication algebras is, in fact, a variety. We also derive some characterizations of congruence permutable algebras. The starting point for these results is a representation of finite Łukasiewicz implication algebras as upwardly-closed subsets in direct products of MV-chains.

Let FΛ be a finite dimensional path algebra of a quiver Λ over a field F. Let L and R denote the varieties of all left and right FΛ-modules respectively. We prove the equivalence of the following statements. • The subvariety lattice of L is a sublattice of the subquasivariety lattice of L. • The subquasivariety lattice of R is distributive. • Λ is an ordered forest.

We argue that the basic notions of mathematics can only be properly formulated in an informal way. Mathematical notions transcend formalizations and their study involves the consideration of other mathematical notions. We explain the fundamental role of categoricity theorems in making these studies possible. We arrive at the conclusion that the enterprise of mathematics is not infallible and that it ultimately relies on degrees of evidence.

Stephen Mumford, in his book on dispositions, argues that we can distinguish between dispositional and categorical properties in terms of entailing his 'conditional conditionals', which involve the concept of ideal conditions. I aim at defending Mumford's criterion for distinguishing between dispositional and categorical properties. To be specific, no categorical ascriptions entail Mumford's 'conditional conditionals'.

On a widespread naturalist view, the meanings of mathematical terms are determined, and can only be determined, by the way we use mathematical language—in particular, by the basic mathematical principles we’re disposed to accept. But it’s mysterious how this can be so, since, as is well known, minimally strong first-order theories are non-categorical and so are compatible with countless non-isomorphic interpretations. As for second-order theories: though they typically enjoy categoricity results—for instance, Dedekind’s categoricity theorem for second-order and Zermelo’s quasi-categoricity (...) theorem for second-order —these results require full second-order logic. So appealing to these results seems only to push the problem back, since the principles of second-order logic are themselves non-categorical: those principles are compatible with restricted interpretations of the second-order quantifiers on which Dedekind’s and Zermelo’s results are no longer available. In this paper, we provide a naturalist-friendly, non-revisionary solution to an analogous but seemingly more basic problem—Carnap’s Categoricity Problem for propositional and first-order logic—and show that our solution generalizes, giving us full second-order logic and thereby securing the categoricity or quasi-categoricity of second-order mathematical theories. Briefly, the first-order quantifiers have their intended interpretation, we claim, because we’re disposed to follow the quantifier rules in an open-ended way. As we show, given this open-endedness, the interpretation of the quantifiers must be permutation-invariant and so, by a theorem recently proved by Bonnay and Westerståhl, must be the standard interpretation. Analogously for the second-order case: we prove, by generalizing Bonnay and Westerståhl’s theorem, that the permutation invariance of the interpretation of the second-order quantifiers, guaranteed once again by the open-endedness of our inferential dispositions, suffices to yield full second-order logic. (shrink)

Quasi-MV algebras are generalisations of MV algebras arising in quantum computational logic. Although a reasonably complete description of the lattice of subvarieties of quasi-MV algebras has already been provided, the problem of extending this description to the setting of quasivarieties has so far remained open. Given its apparent logical repercussions, we tackle the issue in the present paper. We especially focus on quasivarieties whose generators either are subalgebras of the standard square quasi-MV algebra S , or can be obtained therefrom (...) through the addition of some fixpoints for the inverse. (shrink)

Some of the features of animal and human categorical perception (CP) for color, pitch and speech are exhibited by neural net simulations of CP with one-dimensional inputs: When a backprop net is trained to discriminate and then categorize a set of stimuli, the second task is accomplished by "warping" the similarity space (compressing within-category distances and expanding between-category distances). This natural side-effect also occurs in humans and animals. Such CP categories, consisting of named, bounded regions of similarity space, may (...) be the ground level out of which higher-order categories are constructed; nets are one possible candidate for the mechanism that learns the sensorimotor invariants that connect arbitrary names (elementary symbols?) to the nonarbitrary shapes of objects. This paper examines how and why such compression/expansion effects occur in neural nets. (shrink)

In this paper, we concentrate on finite quasivarieties (i.e. classes of finite algebras defined by quasi-identities). We present a motivation for studying finite quasivarieties. We introduce a new type of conditions that is well suited for defining finite quasivarieties and compare these new conditions with quasi-identities.

Vann McGee has recently argued that Belnap’s criteria constrain the formal rules of classical natural deduction to uniquely determine the semantic values of the propositional logical connectives and quantifiers if the rules are taken to be open-ended, i.e., if they are truth-preserving within any mathematically possible extension of the original language. The main assumption of his argument is that for any class of models there is a mathematically possible language in which there is a sentence true in just those models. (...) I show that this assumption does not hold for the class of models of classical propositional logic. In particular, I show that the existence of non-normal models for negation undermines McGee’s argument. (shrink)

Summary We have considered complete consistent systems in the first‐oder predicate calculus with identity, and have studied the set of the models of such a system by means of the maximal consistent condition‐sets associated with the system. The results may be summarized thus: (a) A complete consistent system is no‐categorical (= categorical in the denumerable domain) if and only if for every n, the number of different conditions in n variables is finite (T10). (b) If a complete consistent (...) system has a model M with finite character (i.e. a model M such that every maximal consistent condition‐set satisfied in M has a finite basis), then this model M is uniquely characterized by the property that every other model is an arithmetic extension of M (T 5). (c) Every complete consistent system, which has only a denumerable number of different associated maximal consistent condition‐sets, has a model with finite character (T8). (shrink)

For a computable structure $\mathcal {M}$, the categoricity spectrum is the set of all Turing degrees capable of computing isomorphisms among arbitrary computable copies of $\mathcal {M}$. If the spectrum has a least degree, this degree is called the degree of categoricity of $\mathcal {M}$. In this paper we investigate spectra of categoricity for computable rigid structures. In particular, we give examples of rigid structures without degrees of categoricity.

Categories can affect our perception of the world, rendering between-category differences more salient than within-category ones. Across many studies, such categorical perception has been observed for the basic-level categories of one's native language. Other research points to categorical distinctions beyond the basic level, but it does not demonstrate CP for such distinctions. Here we provide such a demonstration. Specifically, we show CP in English speakers for the non-basic distinction between “warm” and “cool” colors, claimed to represent the earliest (...) stage of color lexicon evolution. Notably, the advantage for discriminating colors that straddle the warm–cool boundary was restricted to the right visual field—the same behavioral signature previously observed for basic-level categories. This pattern held in a replication experiment with increased power. Our findings show that categorical distinctions beyond the basic-level repertoire of one's native language are psychologically salient and may be spontaneously accessed during normal perceptual processing. (shrink)

LetL(K) denote the lattice (ordered by inclusion) of quasivarieties contained in a quasivarietyK and letD 2 denote the variety of distributive (0, 1)-lattices with 2 additional nullary operations. In the present paperL(D 2) is described. As a consequence, ifM+N stands for the lattice join of the quasivarietiesM andN, then minimal quasivarietiesV 0,V 1, andV 2 are given each of which is generated by a 2-element algebra and such that the latticeL(V 0+V1), though infinite, still admits an easy and nice description (...) (see Figure 2) while the latticeL(V 0+V1+V2), because of its intricate inner structure, does not. In particular, it is shown thatL(V 0+V1+V2) contains as a sublattice the ideal lattice of a free lattice with free generators. Each of the quasivarietiesV 0,V 1, andV 2 is generated by a 2-element algebra inD 2. (shrink)

An ω-categorical supersimple group is finite-by-abelian-by-finite, and has finite SU-rank. Every definable subgroup is commensurable with an acl( $\emptyset$ )-definable subgroup. Every finitely based regular type in a CM-trivial ω-categorical simple theory is non-orthogonal to a type of SU-rank 1. In particular, a supersimple ω-categorical CM-trivial theory has finite SU-rank.

An important part of the theory of algebraizable sentential logics consists of studying the algebraic semantics of these logics. As developed by Czelakowski, Blok, and Pigozzi and Font and Jansana, among others, it includes studying the properties of logical matrices serving as models of deductive systems and the properties of abstract logics serving as models of sentential logics. The present paper contributes to the development of the categorical theory by abstracting some of these model theoretic aspects and results from (...) the level of sentential logics to the level of π-institutions. (shrink)

Let \(\textbf{K}\) and \(\textbf{M}\) be locally finite quasivarieties of finite type such that \(\textbf{K}\subset \textbf{M}\). If \(\textbf{K}\) is profinite then the filter \([\textbf{K},\textbf{M}]\) in the quasivariety lattice \(\textrm{Lq}(\textbf{M})\) is an atomic lattice and \(\textbf{K}\) has an independent quasi-equational basis relative to \(\textbf{M}\). Applications of these results for lattices, unary algebras, groups, unary algebras, and distributive algebras are presented which concern some well-known problems on standard topological quasivarieties and other problems.

There are many entry points into the problem of categorization. Two particularly important ones are the so-called top-down and bottom-up approaches. Top-down approaches such as artificial intelligence begin with the symbolic names and descriptions for some categories already given; computer programs are written to manipulate the symbols. Cognitive modeling involves the further assumption that such symbol-interactions resemble the way our brains do categorization. An explicit expectation of the top-down approach is that it will eventually join with the bottom-up approach, which (...) tries to model how the hardware of the brain works: sensory systems, motor systems and neural activity in general. The assumption is that the symbolic cognitive functions will be implemented in brain function and linked to the sense organs and the organs of movement in roughly the way a program is implemented in a computer, with its links to peripheral devices such as transducers and effectors. (shrink)

We describe punctual categoricity in several natural classes, including binary relational structures and mono-unary functional structures. We prove that every punctually categorical structure in a finite unary language is${\text {PA}}(0')$-categorical, and we show that this upper bound is tight. We also construct an example of a punctually categorical structure whose degree of categoricity is$0''$. We also prove that, with a bit of work, the latter result can be pushed beyond$\Delta ^1_1$, thus showing that punctually categorical structures (...) can possess arbitrarily complex automorphism orbits.As a consequence, it follows that binary relational structures and unary structures are not universal with respect to primitive recursive interpretations; equivalently, in these classes every rich enough interpretation technique must necessarily involve unbounded existential quantification or infinite disjunction. In contrast, it is well-known that both classes are universal for Turing computability. (shrink)

We prove that every ω-categorical, generically stable group is nilpotent-by-finite and that every ω-categorical, generically stable ring is nilpotent-by-finite.

A long series of conversations interweaving mathematical, historical and philosophical aspects of categoricity in model theory took place between the author and Saharon Shelah in 2016 and 2017. In this excerpt of that long conversation, we explore the relationship between explicit and implicit aspects of categoricity. We also discuss the connection with definability issues.

A well-known difficulty that affects all accounts of laws of nature according to which the latter are higher-order facts involving relations between universals (the so-called DTA accounts, from Dretske in Philosophy of Science 44:248–268, 1977; Tooley in Canadian Journal of Philosophy 7:667–698, 1977 and Armstrong (What is a Law of Nature?, Cambridge University Press, Cambridge, 1983)) is the Inference Problem: how can laws construed in that way determine the first-order regularities that we find in the actual world? Bird (Analysis 65:147–55, (...) 2005) has argued that there is no solution to the Inference Problem which is consistent with both categorical monism (that is, the view that all natural properties are categorical) and basic tenets of Armstrong’s account of the laws of nature. This paper shows that, given Armstrong’s view about laws as first-order structural universals whose instantiation ‘produce’ nomic regularities and under specific plausible metaphysical assumptions concerning nomic relations which are consistent with a broadly construed DTA approach to laws, there is no extra difficulty regarding the Inference Problem in a categorical monistic context besides the ones that beset structural universals in general. (shrink)

We present three experiments using a novel problem in which participants update their estimates of propensities when faced with an uncertain new instance. We examine this using two different causal structures (common cause/common effect) and two different scenarios (agent‐based/mechanical). In the first, participants must update their estimate of the propensity for two warring nations to successfully explode missiles after being told of a new explosion on the border between both nations. In the second, participants must update their estimate of the (...) accuracy of two early warning tests for cancer when they produce conflicting reports about a patient. Across both experiments, we find two modal responses, representing around one‐third of participants each. In the first, “Categorical” response, participants update propensity estimates as if they were certain about the single event, for example, certain that one of the nations was responsible for the latest explosion, or certain about which of the two tests is correct. In the second, “No change” response, participants make no update to their propensity estimates at all. Across the three experiments, the theory is developed and tested that these two responses in fact have a single representation of the problem: because the actual outcome is binary (only one of the nations could have launched the missile; the patient either has cancer or not), these participants believe it is incorrect to update propensities in a graded manner. They therefore operate on a “certainty threshold” basis, whereby, if they are certain enough about the single event, they will make the “Categorical” response, and if they are below this threshold, they will make the “No change” response. Ramifications are considered for the “categorical” response in particular, as this approach produces a positive‐feedback dynamic similar to that seen in the belief polarization/confirmation bias literature. (shrink)