b>—Several paradigms (e.g. change blindness, inattentional blindness, transsaccadic integra- tion) indicate that observers are often very poor at reporting changes to their visual environment. Such evidence has been used to suggest that the spatio-temporal coherence needed to represent change can only occur in the presence of focused attention. However, those studies almost always rely on explicit reports. It remains a possibility that the visual system can implicitly detect change, but that in the absence of focused attention, the change does not (...) reach awareness and consequently is not reported. To test this possibility, we used a simple change detection paradigm coupled with a speeded orien- tation discrimination task. Even when observers reported being unaware of a change in an item’s orientation, its nal orientation effectively biased their response in the orientation discrimination task. Both in aware and unaware trials, errors were most frequent when the changed item and the probe had incongruent orientations. These results demonstrate that the _nature _of the change can be represented in the absence of awareness. (shrink)

Evidence from many different paradigms (e.g. change blindness, inattentional blindness, transsaccadic integration) indicate that observers are often very poor at reporting changes to their visual environment. Such evidence has been used to suggest that the spatio-temporal coherence needed to represent change can only occur in the presence of focused attention. In four experiments we use modified change blindness tasks to demonstrate (a) that sensitivity to change does occur in the absence of awareness, and (b) this sensitivity does not rely on (...) the redeploy- ment of attention. We discuss these results in relation to theories of scene percep- tion, and propose a reinterpretatio n of the role of attention in representing change. (shrink)

Metacognition refers to any knowledge or cognitive process that monitors or controls cognition. We highlight similarities between metacognitive and executive control functions, and ask how these processes might be implemented in the human brain. A review of brain imaging studies reveals a circuitry of attentional networks involved in these control processes, with its source located in midfrontal areas. These areas are active during conflict resolution, error correction, and emotional regulation. A developmental approach to the organization of the anatomy involved in (...) executive control provides an added perspective on how these mechanisms are influenced by maturation and learning, and how they relate to metacognitive activity. (shrink)

& Awareness of change within a visual scene only occurs in subjects were aware of, replicated those attentional effects, but the presence of focused attention. When two versions of a.

Scientific concepts are defined by metaphors. These metaphors determine what atten- tion is and what count as adequate explanations of the phenomenon. The authors analyze these metaphors within 3 types of attention theories: (a) --cause-- theories, in which attention is presumed to modulate information processing (e.g., attention as a spotlight; attention as a limited resource); (b) --effect-- theories, in which attention is considered to be a by-product of information processing (e.g., the competition meta- phor); and (c) hybrid theories that combine (...) cause and effect aspects (e.g., biased- competition models). The present analysis reveals the crucial role of metaphors in cognitive psychology, neuroscience, and the efforts of scientists to find a resolution to the classic problem of cause versus effect interpretations. (shrink)

The ability to image the human brain has provided a new perspective for neuropsychologists in their efforts to understand, diagnose, and treat insults to the human brain that might occur as the result of stroke, tumor, traumatic injury, degenerative disease, or errors in development. These new ®ndings are the major theme of this special issue. In our article, we consider brain networks that carry out the functions of attention. We outline several such networks that have been studied in normal and (...) pathological states. These include networks for orienting to sensory stimuli, for maintaining the alert state, and for orchestrating volitional control. (shrink)

Several recent findings support the notion that changes in the environment can be implicitly represented by the visual system. S. R. Mitroff, D. J. Simons, and S. L. Franconeri (2002) challenged this view and proposed alternative interpretations based on explicit strategies. Across 4 experiments, the current study finds no empirical support for such alternative proposals. Experiment 1 shows that subjects do not rely on unchanged items when locating an unaware change. Experiments 2 and 3 show that unaware changes affect performance (...) even when they occur at an unpredictable location. Experiment 4 shows that the unaware congruency effect does not depend simply on the pattern of the final display. The authors point to converging evidence from other methodologies and highlight several weaknesses in Mitroff et al.’s theoretical arguments. It is concluded here that implicit representation of change provides the most parsimonious explanation for both past and present findings. (shrink)

Kentridge and Heywood (this issue) extend the concept of metacognition to include unconscious processes. We acknowledge the possible contribution of unconscious processes, but favor a central role of awareness in metacognition. We welcome Shimamura's (this issue) extension of the concept of metacognitive regulation to include aspects of working memory, and its relation to executive attention.

People tend to overestimate emotional responses to future events. This study examined whether such affective forecasting errors occur for feelings of regret, as measured by self-report and subsequent decision-making. Some participants played a pricing game and lost by a narrow or wide margin, while others were asked to imagine losing by such margins. Participants who experienced a narrow loss reported more regret than those who imagined a narrow loss. Furthermore, those experiencing a narrow loss behaved more cautiously in a subsequent (...) gambling task. Thus, the study provides self-report and behavioral evidence for a reversal of the affective forecasting phenomenon for feelings of regret. (shrink)

This study explored possible deficits in selective attention brought about by Dementia of Alzheimer Type (DAT). In three experiments, we tested patients with early DAT, healthy elderly, and young adults under low memory demands to assess perceptual filtering, conflict resolution, and set switching abilities. We found no evidence of impaired perceptual filtering nor evidence of impaired conflict resolution in early DAT. In contrast, early DAT patients did exhibit a global cost in set switching consistent with an inability to maintain the (...) goals of the task (mental set). We discuss these findings in relation to the DAT literature on executive attention, dual-tasking, and working memory. Ó 2007 Elsevier Inc. All rights reserved. (shrink)

This article examines the anatomy and circuitry of skills that, like reading, calculating, recognizing, or remembering, are common abilities of humans. While the anatomical areas active are unique to each skill there are features common to all tasks. For example, all skills produce activation of a small number of widely separated neural areas that appear necessary to perform the task. These neural areas relate to internal codes that may not be observed by any external behavior nor be reportable by the (...) performer. There is considerable plasticity to the performance of skills. Task components can be given priority through attention, which serves to increase activation of the relevant brain areas. Attention can also cause reactivation of sensory areas driven by input, but usually only after a delay. The threshold for activation for any area may be temporarily reduced by prior activation . Skill components requiring attention tend to cause interference resulting in the dual tasks effects and unified focus of attention described in many cognitive studies. Practice may change the size or number of brain areas involved and alter the pathways used by the skill. By combining cognitive and anatomical analyses, a more general picture of the nature of skill emerges. (shrink)

In topological modal logic, it is well known that the Cantor derivative is more expressive than the topological closure, and the ‘elsewhere’, or ‘difference’, operator is more expressive than the ‘somewhere’ operator. In 2014, Kudinov and Shehtman asked whether the combination of closure and elsewhere becomes strictly more expressive when adding the Cantor derivative. In this paper we give an affirmative answer: in fact, the Cantor derivative alone can define properties of topological spaces not expressible with closure and elsewhere. To (...) prove this, we develop a novel theory of morphisms which preserve formulas with the elsewhere operator. (shrink)

The Baire algebra of a topological space X is the quotient of the algebra of all subsets of X modulo the meager sets. We show that this Boolean algebra can be endowed with a natural closure operator, resulting in a closure algebra which we denote $\mathbf {Baire}(X)$. We identify the modal logic of such algebras to be the well-known system $\mathsf {S5}$, and prove soundness and strong completeness for the cases where X is crowded and either completely metrizable and continuum-sized (...) or locally compact Hausdorff. We also show that every extension of $\mathsf {S5}$ is the modal logic of a subalgebra of $\mathbf {Baire}(X)$, and that soundness and strong completeness also holds in the language with the universal modality. (shrink)

The paper presents a new logic for reasoning about the formation of beliefs through perception or through inference in non-omniscient resource-bounded agents. The logic distinguishes the concept of explicit belief from the concept of background knowledge. This distinction is reflected in its formal semantics and axiomatics: we use a non-standard semantics putting together a neighborhood semantics for explicit beliefs and relational semantics for background knowledge, and we have specific axioms in the logic highlighting the relationship between the two concepts. Mental (...) operations of perceptive type and inferential type, having effects on epistemic states of agents, are primitives in the object language of the logic. At the semantic level, they are modelled as special kinds of model-update operations, in the style of dynamic epistemic logic. Results about axiomatization, decidability and complexity for the logic are given in the paper. (shrink)

We introduce the logics GLP Λ, a generalization of Japaridze’s polymodal provability logic GLP ω where Λ is any linearly ordered set representing a hierarchy of provability operators of increasing strength. We shall provide a reduction of these logics to GLP ω yielding among other things a finitary proof of the normal form theorem for the variable-free fragment of GLP Λ and the decidability of GLP Λ for recursive orderings Λ. Further, we give a restricted axiomatization of the variable-free fragment (...) of GLP Λ. (shrink)

The intuitive notion of evidence has both semantic and syntactic features. In this paper, we develop an evidence logic for epistemic agents faced with possibly contradictory evidence from different sources. The logic is based on a neighborhood semantics, where a neighborhood N indicates that the agent has reason to believe that the true state of the world lies in N. Further notions of relative plausibility between worlds and beliefs based on the latter ordering are then defined in terms of this (...) evidence structure, yielding our intended models for evidence-based beliefs. In addition, we also consider a second more general flavor, where belief and plausibility are modeled using additional primitive relations, and we prove a representation theorem showing that each such general model is a p-morphic image of an intended one. This semantics invites a number of natural special cases, depending on how uniform we make the evidence sets, and how coherent their total structure. We give a structural study of the resulting ‘uniform’ and ‘flat’ models. Our main result are sound and complete axiomatizations for the logics of all four major model classes with respect to the modal language of evidence, belief and safe belief. We conclude with an outlook toward logics for the dynamics of changing evidence, and the resulting language extensions and connections with logics of plausibility change. (shrink)

The language of linear temporal logic can be interpreted on the class of dynamic topological systems, giving rise to the intuitionistic temporal logic ${\sf ITL}^{\sf c}_{\Diamond \forall }$, recently shown to be decidable by Fernández-Duque. In this article we axiomatize this logic, some fragments, and prove completeness for several familiar spaces.

We introduce frame-equivalence games tailored for reasoning about the size, modal depth, number of occurrences of symbols and number of different propositional variables of modal formulae defining a given frame property. Using these games, we prove lower bounds on the above measures for a number of well-known modal axioms; what is more, for some of the axioms, we show that they are optimal among the formulae defining the respective class of frames.

Let T be a second-order arithmetical theory, Λ a well-order, λ < Λ and X ⊆ ℕ. We use $[\lambda |X]_T^{\rm{\Lambda }}\varphi$ as a formalization of “φ is provable from T and an oracle for the set X, using ω-rules of nesting depth at most λ”.For a set of formulas Γ, define predicative oracle reflection for T over Γ ) to be the schema that asserts that, if X ⊆ ℕ, Λ is a well-order and φ ∈ Γ, then$$\forall \,\lambda (...) < {\rm{\Lambda }}\,.$$In particular, define predicative oracle consistency ) as Pred–O–RFN{0=1}.Our main result is as follows. Let ATR0 be the second-order theory of Arithmetical Transfinite Recursion, ${\rm{RCA}}_0^{\rm{*}}$ be Weakened Recursive Comprehension and ACA be Arithmetical Comprehension with Full Induction. Then,$${\rm{ATR}}_0 \equiv {\rm{RCA}}_0^{\rm{*}} + {\rm{Pred - O - Cons\ }}\left \equiv {\rm{RCA}}_0^{\rm{*}} + \,{\rm{Pred - O - Cons\ }}\left \equiv {\rm{RCA}}_0^{\rm{*}} + \,{\rm{Pred - O - RFN}}\,_{{\bf{\Pi }}_2^1 } \left.$$We may even replace ${\rm{RCA}}_0^{\rm{*}}$ by the weaker ECA0, the second-order analogue of Elementary Arithmetic.Thus we characterize ATR0, a theory often considered to embody Predicative Reductionism, in terms of strong reflection and consistency principles. (shrink)

For any ordinal $\Lambda$, we can define a polymodal logic $\mathsf{GLP}_\Lambda$, with a modality $[\xi]$ for each $\xi < \Lambda$. These represent provability predicates of increasing strength. Although $\mathsf{GLP}_\Lambda$ has no Kripke models, Ignatiev showed that indeed one can construct a Kripke model of the variable-free fragment with natural number modalities, denoted $\mathsf{GLP}^0_\omega$. Later, Icard defined a topological model for $\mathsf{GLP}^0_\omega$ which is very closely related to Ignatiev's. In this paper we show how to extend these constructions for arbitrary $\Lambda$. (...) More generally, for each $\Theta,\Lambda$ we build a Kripke model $\mathfrak I^\Theta_\Lambda$ and a topological model $\mathfrak T^\Theta_\Lambda$, and show that $\mathsf{GLP}^0_\Lambda$ is sound for both of these structures, as well as complete, provided $\Theta$ is large enough. (shrink)

El artículo examina el conflicto formal que se produce en la descripción de Odradek al interior de “La preocupación del padre de familia” de Franz Kafka. En la voz de su narrador, Kafka se vale de un lenguaje de extraordinaria precisión para describir a su criatura (Odradek), produciendo una serie de paradojas. Prestamos atención seria a estas paradojas, mostrando las consecuencias que ellas plantean para los conceptos de “historia” en Kant y Benjamin, en sus respectivas relaciones con el concepto de (...) “naturaleza” en estos autores. (shrink)

Ordinal functions may be iterated transfinitely in a natural way by taking pointwise limits at limit stages. However, this has disadvantages, especially when working in the class of normal functions, as pointwise limits do not preserve normality. To this end we present an alternative method to assign to each normal function f a family of normal functions Hyp[f]=〈fξ〉ξ∈OnHyp[f]=〈fξ〉ξ∈On, called its hyperation, in such a way that f0=idf0=id, f1=ff1=f and fα+β=fα∘fβfα+β=fα∘fβ for all α, β.Hyperations are a refinement of the Veblen hierarchy (...) of f. Moreover, if f is normal and has a well-behaved left-inverse g called a left adjoint, then g can be assigned a cohyperationcoH[g]=〈gξ〉ξ∈OncoH[g]=〈gξ〉ξ∈On, which is a family of initial functions such that gξgξ is a left adjoint to fξfξ for all ξ. (shrink)

Provability logics are modal or polymodal systems designed for modeling the behavior of Gödel’s provability predicate and its natural extensions. If Λ is any ordinal, the Gödel-Löb calculus GLPΛ contains one modality [λ] for each λ < Λ, representing provability predicates of increasing strength. GLPω has no non-trivial Kripke frames, but it is sound and complete for its topological semantics, as was shown by Icard for the variable-free fragment and more recently by Beklemishev and Gabelaia for the full logic. In (...) this paper we generalize Beklemishev and Gabelaia’s result to GLPΛ for countable Λ. We also introduce provability ambiances, which are topological models where valuations of formulas are restricted. With this we show completeness of GLPΛ for the class of provability ambiances based on Icard polytopologies. (shrink)

According to Pablo Oyarzun, Benjamin’s concept of history “is not about a war over the representation of history, but a war over history itself. Only in so far as this is its field, there can also be a struggle for its representation”. While Oyarzun’s observation refers to the first “thesis” of Benjamin’s «On the Concept of history», in this article I argue that it can be productively used to shed light onto a broader understanding of the Benjamin’s concept of history. (...) To that end, I elaborate on Oyarzun’s comment in order to analyze and to render explicit the relationship between 'Truth' and 'presentation' in Benjamin’s thought. In doing so, I highlight the relevance of this relationship for the concept of 'History' that Benjamin elaborated in the late ‘30s. (shrink)

Dynamic Topological Logic (DFH) is a multimodal system for reasoning about dynamical systems. It is defined semantically and, as such, most of the work done in the field has been model-theoretic. In particular, the problem of finding a complete axiomatization for the full language of DFH over the class of all dynamical systems has proven to be quite elusive. Here we propose to enrich the language to include a polyadic topological modality, originally introduced by Dawar and Otto in a different (...) context. We then provide a sound axiomatization for DFH over this extended language, and prove that it is complete. The polyadic modality is used in an essential way in our proof. (shrink)

Dynamic Topological Logic ( $\mathcal{DTL}$ ) is a modal framework for reasoning about dynamical systems, that is, pairs 〈X, f〉 where X is a topological space and f: X → X a continuous function. In this paper we consider the case where X is a metric space. We first show that any formula which can be satisfied on an arbitrary dynamic topological system can be satisfied on one based on a metric space; in fact, this space can be taken to (...) be countable and have no isolated points. Since any metric space with these properties is homeomorphic to the set of rational numbers, it follows that any satisfiable formula can be satisfied on a system based on $\mathbb{Q}$ . We then show that the situation changes when considering complete metric spaces, by exhibiting a formula which is not valid in general but is valid on the class of systems based on a complete metric space. While we do not attempt to give a full characterization of the set of valid formulas on this class we do give a relative completeness result; any formula which is satisfiable on a dynamical system based on a complete metric space is also satisfied on one based on the Cantor space. (shrink)

Dynamic Topological Logic ( ) is a modal logic which combines spatial and temporal modalities for reasoning about dynamic topological systems , which are pairs consisting of a topological space X and a continuous function f : X → X . The function f is seen as a change in one unit of time; within one can model the long-term behavior of such systems as f is iterated. One class of dynamic topological systems where the long-term behavior of f is (...) particularly interesting is that of minimal systems ; these are dynamic topological systems which admit no proper, closed, f -invariant subsystems. In such systems the orbit of every point is dense, which within translates into a non-trivial interaction between spatial and temporal modalities. This interaction, however, turns out to make the logic simpler, and while s in general tend to be undecidable, interpreted over minimal systems we obtain decidability, although not in primitive recursive time; this is the main result that we prove in this paper. We also show that interpreted over minimal systems is incomplete for interpretations on relational Kripke frames and hence does not have the finite model property; however it does have a finite non-deterministic quasimodel property. Finally, we give a set of formulas of which characterizes the class of minimal systems within the class of dynamic topological systems, although we do not offer a full axiomatization for the logic. (shrink)

In this work, we shall study structural abduction and how ways of searching for solutions to the corresponding abductive problems could be modeled. Specifically, we shall define modal semantic tableaux for normal modal systems and study its applications to structural abduction. This method even makes structural abduction clearer and, as it shall be seen, when a radical change of logic is epistemologically required, the corresponding tableau will have pertinent information to suggest it.