We investigate the complexity of embeddings between bi-embeddable structures. In analogy with categoricity spectra, we define the bi-embeddable categoricity spectrum of a structure A as the family of Turing degrees that compute embeddings between any computable bi-embeddable copies of A; the degree of bi-embeddable categoricity of A is the least degree in this spectrum (if it exists). We extend many known results about categoricity spectra to the case of bi-embeddability. In particular, we exhibit structures without degree of bi-embeddable categoricity, and (...) we show that every degree d.c.e above 0(α) for α a computable successor ordinal and 0(λ) for λ a computable limit ordinal is a degree of bi-embeddable categoricity. We also give examples of families of degrees that are not bi-embeddable categoricity spectra. (shrink)

In this paper we argue, against a somewhat standard view, that pragmatic phenomena occur in mathematical language. We provide concrete examples supporting this thesis.

This paper is part of a project that is based on the notion of a dialectical system, introduced by Magari as a way of capturing trial and error mathematics. In Amidei et al. (2016, Rev. Symb. Logic, 9, 1–26) and Amidei et al. (2016, Rev. Symb. Logic, 9, 299–324), we investigated the expressive and computational power of dialectical systems, and we compared them to a new class of systems, that of quasi-dialectical systems, that enrich Magari’s systems with a natural mechanism (...) of revision. In the present paper we consider a third class of systems, that of p-dialectical systems, that naturally combine features coming from the two other cases. We prove several results about p-dialectical systems and the sets that they represent. Then we focus on the completions of first-order theories. In doing so, we consider systems with connectives, i.e. systems that encode the rules of classical logic. We show that any consistent system with connectives represents the completion of a given theory. We prove that dialectical and q-dialectical systems coincide with respect to the completions that they can represent. Yet, p-dialectical systems are more powerful; we exhibit a p-dialectical system representing a completion of Peano Arithmetic that is neither dialectical nor q-dialectical. (shrink)

We study the algorithmic complexity of isomorphic embeddings between computable structures.

The complexity of equivalence relations has received much attention in the recent literature. The main tool for such endeavour is the following reducibility: given equivalence relations R and S on natural numbers, R is computably reducible to S if there is a computable function f:ω→ω that induces an injective map from R-equivalence classes to S-equivalence classes. In order to compare the complexity of equivalence relations which are computable, researchers considered also feasible variants of computable reducibility, such as the polynomial-time reducibility. (...) In this work, we explore Peq, the degree structure generated by primitive recursive reducibility on primitive recursive equivalence relations with infinitely many equivalence classes. In contrast with all other known degree structures on equivalence relations, we show that Peq has much more structure: e.g., we show that it is a dense distributive lattice. On the other hand, we also offer evidence of the intricacy of Peq, proving, e.g., that the structure is neither rigid nor homogeneous. (shrink)

We study degree spectra of structures with respect to the bi-embeddability relation. The bi-embeddability spectrum of a structure is the family of Turing degrees of its bi-embeddable copies. To facilitate our study we introduce the notions of bi-embeddable triviality and basis of a spectrum. Using bi-embeddable triviality we show that several known families of degrees are bi-embeddability spectra of structures. We then characterize the bi-embeddability spectra of linear orderings and study bases of bi-embeddability spectra of strongly locally finite graphs.

We aim at providing a philosophical analysis of the notion of “proof by Church’s Thesis”, which is – in a nutshell – the conceptual device that permits to rely on informal methods when working in Computability Theory. This notion allows, in most cases, to not specify the background model of computation in which a given algorithm – or a construction – is framed. In pursuing such analysis, we carefully reconstruct the development of this notion (from Post to Rogers, to the (...) present days), and we focus on some classical constructions of the field, such as the construction of a simple set. Then, we make use of this focus in order to support the following encompassing claim (which opposes to a somehow commonly received view): the informal side of Computability, consisting of the large class of methods typically employed in the proofs of the field, is not fully reducible to its formal counterpart. (shrink)

This paper studies algorithmic learning theory applied to algebraic structures. In previous papers, we have defined our framework, where a learner, given a family of structures, receives larger and larger pieces of an arbitrary copy of a structure in the family and, at each stage, is required to output a conjecture about the isomorphism type of such a structure. The learning is successful if there is a learner that eventually stabilizes to a correct conjecture. Here, we analyze the number of (...) mind changes that are needed to learn a given family K. We give a descriptive set-theoretic interpretation of such mind change complexity. We also study how bounding the Turing degree of learners affects the mind change complexity of a given family of algebraic structures. (shrink)

We combine computable structure theory and algorithmic learning theory to study learning of families of algebraic structures. Our main result is a model-theoretic characterization of the learning type InfEx_\iso, consisting of the structures whose isomorphism types can be learned in the limit. We show that a family of structures is InfEx_\iso-learnable if and only if the structures can be distinguished in terms of their \Sigma^2_inf-theories. We apply this characterization to familiar cases and we show the following: there is an infinite (...) learnable family of distributive lattices; no pair of Boolean algebras is learnable; no infinite family of linear orders is learnable. (shrink)

Computable reducibility is a well-established notion that allows to compare the complexity of various equivalence relations over the natural numbers. We generalize computable reducibility by introducing degree spectra of reducibility and bi-reducibility. These spectra provide a natural way of measuring the complexity of reductions between equivalence relations. We prove that any upward closed collection of Turing degrees with a countable basis can be realised as a reducibility spectrum or as a bi-reducibility spectrum. We show also that there is a reducibility (...) spectrum of computably enumerable equivalence relations with no countable basis and a reducibility spectrum of computably enumerable equivalence relations which is downward dense, thus has no basis. (shrink)

In previous work, we have combined computable structure theory and algorithmic learning theory to study which families of algebraic structures are learnable in the limit (up to isomorphism). In this paper, we measure the computational power that is needed to learn finite families of structures. In particular, we prove that, if a family of structures is both finite and learnable, then any oracle which computes the Halting set is able to achieve such a learning. On the other hand, we construct (...) a pair of structures which is learnable but no computable learner can learn it. (shrink)

We make some beginning observations about the category Eq of equivalence relations on the set of natural numbers, where a morphism between two equivalence relations R and S is a mapping from the set of R-equivalence classes to that of S-equivalence classes, which is induced by a computable function. We also consider some full subcategories of Eq, such as the category Eq(Σ01) of computably enumerable equivalence relations (called ceers), the category Eq(Π01) of co-computably enumerable equivalence relations, and the category Eq(Dark*) (...) whose objects are the so-called dark ceers plus the ceers with finitely many equivalence classes. Although in all these categories the monomorphisms coincide with the injective morphisms, we show that in Eq(Σ01) the epimorphisms coincide with the onto morphisms, but in Eq(Π01) there are epimorphisms that are not onto. Moreover, Eq, Eq(Σ01), and Eq(Dark*) are closed under finite products, binary coproducts, and coequalizers, but we give an example of two morphisms in Eq(Π01) whose coequalizer in Eq is not an object of Eq(Π01). (shrink)

In this paper we focus on the logicality of language, i.e. the idea that the language system contains a deductive device to exclude analytic constructions. Puzzling evidence for the logicality of language comes from acceptable contradictions and tautologies. The standard response in the literature involves assuming that the language system only accesses analyticities that are due to skeletons as opposed to standard logical forms. In this paper we submit evidence in support of alternative accounts of logicality, which reject the stipulation (...) of a natural logic and assume instead the meaning modulation of nonlogical terms. (shrink)

We offer a novel picture of mathematical language from the perspective of speech act theory. There are distinct speech acts within mathematics, and, as we intend to show, distinct illocutionary force indicators as well. Even mathematics in its most formalized version cannot do without some such indicators. This goes against a certain orthodoxy both in contemporary philosophy of mathematics and in speech act theory. As we will comment, the recognition of distinct illocutionary acts within logic and mathematics and the incorporation (...) of illocutionary force indicators in the formal language for both goes back to Frege’s conception of these topics. We are, therefore, going back to a Fregean perspective. This paper is part of a larger project of applying contemporary speech act theory to the scientific language of mathematics in order to uncover the varieties and regular combinations of illocutionary acts present in it. For reasons of space, we here concentrate only on assertive and declarative acts within mathematics, leaving the investigation of other kinds of acts for a future occasion. (shrink)

This note addresses the issue as to which ceers can be realized by word problems of computably enumerable (or, simply, c.e.) structures (such as c.e. semigroups, groups, and rings), where being realized means to fall in the same reducibility degree (under the notion of reducibility for equivalence relations usually called “computable reducibility”), or in the same isomorphism type (with the isomorphism induced by a computable function), or in the same strong isomorphism type (with the isomorphism induced by a computable permutation (...) of the natural numbers). We observe, e.g., that every ceer is isomorphic to the word problem of some c.e. semigroup, but (answering a question of Gao and Gerdes) not every ceer is in the same reducibility degree of the word problem of some finitely presented semigroup, nor is it in the same reducibility degree of some non‐periodic semigroup. We also show that the ceer provided by provable equivalence of Peano Arithmetic is in the same strong isomorphism type as the word problem of some non‐commutative and non‐Boolean c.e. ring. (shrink)

The Friedman–Stanley jump, extensively studied by descriptive set theorists, is a fundamental tool for gauging the complexity of Borel isomorphism relations. This paper focuses on a natural computable analog of this jump operator for equivalence relations on $\omega $, written ${\dotplus }$, recently introduced by Clemens, Coskey, and Krakoff. We offer a thorough analysis of the computable Friedman–Stanley jump and its connections with the hierarchy of countable equivalence relations under the computable reducibility $\leq _c$. In particular, we show that this (...) jump gives benchmark equivalence relations going up the hyperarithmetic hierarchy and we unveil the complicated highness hierarchy that arises from ${\dotplus }$. (shrink)

In this short paper, we analyse whether assuming that mathematical objects are “thin” in Linnebo's sense simplifies the epistemology of mathematics. Towards this end, we introduce the notion of transparency and show that not all thin objects are transparent. We end by arguing that, far from being a weakness of thin objects, the lack of transparency of some thin objects is a fruitful characteristic mark of abstract mathematics.

It is prima facie uncontroversial that the justification of an assertion amounts to a collection of other (inferentially related) assertions. In this paper, we point at a class of assertions, i.e. mathematical assertions, that appear to systematically flout this principle. To justify a mathematical assertion (e.g. a theorem) is to provide a proof—and proofs are sequences of directives. The claim is backed up by linguistic data on the use of imperatives in proofs, and by a pragmatic analysis of theorems and (...) their proofs. Proofs, we argue, are sequences of instructions whose performance inevitably gets one to truth. It follows that a felicitous theorem, i.e. a theorem that has been correctly proven, is a persuasive theorem. When it comes to mathematical assertions, there is no sharp distinction between illocutionary and perlocutionary success. (shrink)

Computably enumerable equivalence relations received a lot of attention in the literature. The standard tool to classify ceers is provided by the computable reducibility \. This gives rise to a rich degree structure. In this paper, we lift the study of c-degrees to the \ case. In doing so, we rely on the Ershov hierarchy. For any notation a for a non-zero computable ordinal, we prove several algebraic properties of the degree structure induced by \ on the \ equivalence relations. (...) A special focus of our work is on the existence of infima and suprema of c-degrees. (shrink)

We examine the degree structure $\operatorname {\mathrm {\mathbf {ER}}}$ of equivalence relations on $\omega $ under computable reducibility. We examine when pairs of degrees have a least upper bound. In particular, we show that sufficiently incomparable pairs of degrees do not have a least upper bound but that some incomparable degrees do, and we characterize the degrees which have a least upper bound with every finite equivalence relation. We show that the natural classes of finite, light, and dark degrees are (...) definable in $\operatorname {\mathrm {\mathbf {ER}}}$. We show that every equivalence relation has continuum many self-full strong minimal covers, and that $\mathbf {d}\oplus \mathbf {\operatorname {\mathrm {\mathbf {Id}}}_1}$ needn’t be a strong minimal cover of a self-full degree $\mathbf {d}$. Finally, we show that the theory of the degree structure $\operatorname {\mathrm {\mathbf {ER}}}$ as well as the theories of the substructures of light degrees and of dark degrees are each computably isomorphic with second-order arithmetic. (shrink)

We study the algorithmic complexity of embeddings between bi-embeddable equivalence structures. We define the notions of computable bi-embeddable categoricity, \ bi-embeddable categoricity, and degrees of bi-embeddable categoricity. These notions mirror the classical notions used to study the complexity of isomorphisms between structures. We show that the notions of \ bi-embeddable categoricity and relative \ bi-embeddable categoricity coincide for equivalence structures for \. We also prove that computable equivalence structures have degree of bi-embeddable categoricity \, or \. We furthermore obtain results (...) on the index set complexity of computable equivalence structure with respect to bi-embeddability. (shrink)

Computability theorists have introduced multiple hierarchies to measure the complexity of sets of natural numbers. The Kleene Hierarchy classifies sets according to the first-order complexity of their defining formulas. The Ershov Hierarchy classifies Δ20\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varDelta ^0_2$$\end{document} sets with respect to the number of mistakes that are needed to approximate them. Biacino and Gerla extended the Kleene Hierarchy to the realm of fuzzy sets, whose membership functions range in a complete lattice L. In (...) this paper, we combine the Ershov Hierarchy and fuzzy set theory, by introducing and investigating the Fuzzy Ershov Hierarchy. In particular, we focus on the fuzzy n-c.e. sets which form the finite levels of this hierarchy. Intuitively, a fuzzy set is n-c.e. if its membership function can be approximated by changing monotonicity at most n-1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$n-1$$\end{document} times. We prove that the Fuzzy Ershov Hierarchy does not collapse; that, in analogy with the classical case, each fuzzy n-c.e. set can be represented as a Boolean combination of fuzzy c.e. sets; but that, contrary to the classical case, the Fuzzy Ershov Hierarchy does not exhaust the class of all Δ20\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varDelta ^0_2$$\end{document} fuzzy sets. (shrink)

Computability theorists have introduced multiple hierarchies to measure the complexity of sets of natural numbers. The Kleene Hierarchy classifies sets according to the first-order complexity of their defining formulas. The Ershov Hierarchy classifies limit computable sets with respect to the number of mistakes that are needed to approximate them. Biacino and Gerla extended the Kleene Hierarchy to the realm of fuzzy sets, whose membership functions range in a complete lattice. In this paper, we combine the Ershov Hierarchy and fuzzy set (...) theory, by introducing and investigating the Fuzzy Ershov Hierarchy. (shrink)

From past research it is well known that social exclusion has detrimental consequences for mental health. To deal with these adverse effects, socially excluded individuals frequently turn to other humans for emotional support. While chatbots can elicit social and emotional responses on the part of the human interlocutor, their effectiveness in the context of social exclusion has not been investigated. In the present study, we examined whether an empathic chatbot can serve as a buffer against the adverse effects of social (...) ostracism. After experiencing exclusion on social media, participants were randomly assigned to either talk with an empathetic chatbot about it (e.g., “I'm sorry that this happened to you”) or a control condition where their responses were merely acknowledged (e.g., “Thank you for your feedback”). Replicating previous research, results revealed that experiences of social exclusion dampened the mood of participants. Interacting with an empathetic chatbot, however, appeared to have a mitigating impact. In particular, participants in the chatbot intervention condition reported higher mood than those in the control condition. Theoretical, methodological, and practical implications, as well as directions for future research are discussed. (shrink)

Rips et al. claim that the principles underlying the structure of natural numbers cannot be inferred from interactions with the physical world. However, in their target article they failed to consider an important source of interaction: finger counting. Here, we show that finger counting satisfies all the conditions required for allowing the concept of numbers to emerge from sensorimotor experience through a bottom-up process.

With his massive redeployment hypothesis (MRH), Anderson claims that novel cognitive functions are likely to rely on pre-existing circuits already possessing suitable resources. Here, we put forward recent findings from studies in numerical cognition in order to show that the role of sensorimotor experience in the ontogenetical development of a new function has been largely underestimated in Anderson's proposal.

For the epic journey of autumn migration, long-distance migratory birds use innate and learned information and follow strict schedules imposed by genetic and epigenetic mechanisms, the details of which remain largely unknown. In addition, bird migration requires integrated action of different multisensory systems for learning and memory, and the hippocampus appears to be the integration center for this task. In previous studies we found that contrasting long-distance migratory flights differentially affected the morphological complexity of two types of hippocampus astrocytes. Recently, (...) a significant association was found between the latitude of the reproductive site and the size of the ADCYAP1 allele in long distance migratory birds. We tested for correlations between astrocyte morphological complexity, migratory distances, and size of the ADCYAP1 allele in three long-distance migrant species of shorebird and one non-migrant. Significant differences among species were found in the number and morphological complexity of the astrocytes, as well as in the size of the microsatellites of the ADCYAP1 gene. We found significant associations between the size of the ADCYAP1 microsatellites, the migratory distances, and the degree of morphological complexity of the astrocytes. We suggest that associations between astrocyte number and morphological complexity, ADCYAP1 microsatellite size, and migratory behavior may be part of the adaptive response to the migratory process of shorebirds. (shrink)

Robert Lucas' article on the neutrality of money represented the first effective challenge to Samuelson’s neoclassical synthesis methodological separation between static microeconom...

Mauro Basaure Cet article cherche à innover dans le cadre de la controverse sur le musée de la Mémoire et des Droits de l’homme du Chili : devrait-il ou non intégrer dans sa muséographie la période antérieure au 11 septembre 1973, c’est-à-dire le contexte du coup d’État? Je défends la thèse selon laquelle le MMDH peut intégrer une dimension contextuelle sans trahir sa mission, sa vision et sa fonction, tant qu’il répond à une approche de la notion de contexte-sans-causalité. (...) Selon moi, le grand problème de la critique venant de la droite politique – qui accuse le musée de ne pas remplir sa mission pédagogique, car il décontextualise le coup d’État – est que cette critique répond à une vision causale de la notion de contexte, ce qui la conduit à des contradictions insurmontables. Si, grâce à une muséographie bien réfléchie, le concept de contextualisation non causale était mis en oeuvre avec succès, ceci n’engendrerait pas une contradiction au sein du musée mais pourrait même le favoriser. La conviction que le coup d’État et ses atrocités n’ont ni causes ni antécédents et ne peuvent en avoir renforce la mission pédagogique du MMDH. (shrink)

Os dois primeiros capítulos dos Evangelhos canônicos de Mateus e Lucas têm dois conceitos teológicos que precisam ser mais investigados. Trata-se de “justiça” e “virgindade”, que podem ser entendidos como “tópoi”, isto é, palavras ou conceitos muito especiais. A tentativa desde artigo é abrir o debate a respeito e propor uma nova leitura dos relatos de Anunciação, desta-cando as figuras fundamentais de José e Maria, referências específicas de Jesus: sua messiani-dade e sua humanidade.

Resumen El presente trabajo centra su atención sobre una de las protestas sociales más importantes de la historia de la provincia de Córdoba –ocurrida el 30 de julio de 1973 en la ciudad de San Francisco– conocida indistintamente como Tampierazo, Cordobacito o Sanfranciscazo. El hecho, que paralizó la ciudad y alcanzó momentos de extrema violencia, se inscribe en un amplio contexto de conflictividad social a nivel nacional y provincial; un ciclo de protestas –inaugurado con el Cordobazo– que se extendió hasta (...) por lo menos 1975. Como proponemos, las acciones colectivas deben ser abordadas como un sistema de relaciones internas y externas y no como un simple punto de partida. Por ello, a partir de las redes de conflicto y los marcos de referencia existentes en el momento de la protesta, indagaremos el sentido que la acción tuvo para los actores intervinientes. Como intentaremos demostrar, el Tampierazo fue mucho más que un reclamo por los objetivos particulares de los obreros de la fábrica, convirtiéndose durante la jornada, en una amplia manifestación popular que canalizó el rechazo –compartido intersubjetivamente por varios sectores de la población– a las formas de control y los manejos que se mantenían desde los sectores dominantes del poder local. (shrink)

After noting the absence of a mutual confrontation, the aim of this research has been redefined in reconstructing the influence of Habermas’ writings on the work of Zygmunt Bauman – an aspect known to scholars of the Polish sociologist but not very well recognized in the international sociological community. Following a philological and critical literary approach, the Baumanian interpretations – selective, discontinuous and, often, erroneous – have been systematized into two main topics: 1) the epistemological foundations of social theory; 2) (...) the normative foundations of critical theory (and the relationship with praxis). Bauman; Habermas; sociology; (post)modernity; praxis Dopo aver constatato l’inesistenza di un reciproco confronto, lo scopo della ricerca si è ridefinito nel ricostruire l’influenza degli scritti di Habermas sull’opera di Zygmunt Bauman – un aspetto noto agli studiosi del sociologo polacco ma poco conosciuto nella comunità socio-logica internazionale. Seguendo un approccio filologico e critico letterario, le interpretazioni baumaniane – selettive, discontinue e, spesso, erronee – sono state sistematizzate in due principali temi: 1) i fonda-menti conoscitivi della teoria sociale; 2) i fondamenti normativi della teoria critica (e il rapporto con la prassi). -/- Parole chiave: Bauman; Habermas; sociologia; (post)modernità; prassi -/- In "Zygmunt Bauman. I cancelli dell’acqua", a cura di Riccardo Mazzeo. Maria Caterina Federici, Editoriale. Bauman e dell’incertezza Riccardo Mazzeo, Premessa. I cancelli dell’acqua Riccardo Mazzeo, Introduzione. Il pendolo di Zygmunt Bauman - Mauro Magatti, Siamo ancora nella modernità liquida? Un esercizio di sociologia baumaniana - Benedetto Vecchi, La missione impossibile di Zygmunt Bauman - Vanni Codeluppi, Bauman: il consumo come compito - Raffaele Federici, Forme e impressionismo nel disagio della postmodernità - Vincenzo Romania, Zygmunt Bauman e la modernità dell’Olocausto: fra crucialità delle domande e debolezza delle risposte - Daniele Francesconi, Zygmunt Bauman. L’intellettuale sulla scena - Claudio Tugnoli, La morte di "terzo grado" come stile di vita. Esorcismi della paura nell’opera di Zygmunt Bauman - Sabina Curti, Paura liquida e ruolo degli intellettuali in Zygmunt Bauman - Luca Corchia, Bauman e Habermas su teoria e prassi. Alle origini di un confronto incompiuto - Marta Carlini, Jakub Pichalski, Bibliografia ragionata degli scritti italiani di e su Zygmunt Bauman - Federico Batini, Giulia Toti, Una scuola per tutti? Riflessioni a margine di "Conversazioni sull’educazione" Recensioni. (shrink)

Italian Life sciences in post-WWII faced important challenges: the reconstruction of a scientific panorama suffering heavily after two decades of Fascism and the damages of war. Modernization was not only a matter of recreating a favorable environment for research, by modernizing Italian biomedical institutions and connecting the Italian scientists with the new ideas coming from abroad. The introduction of new genetics required a new array of concepts and instruments, but also, the ability to connect to international networks and to become (...) active members of a broader scientific community. Because of the several socio-cultural issues involved (eugenics, racism, religion, politics), human genetics is a good case study in order to analyze how Italian life sciences managed the transition towards a new research system, and the influences Italian human geneticists received. The paper focuses primarily on the development of the early career of Luigi Luca Cavalli-Sforza, probably the most prominent scientist in post-WWII human genetics in Italy, and his friend and colleague Ruggero Ceppellini. In following their path, a healthy mix of local traditions and international stimuli emerges, allowing for the establishment—within and beyond national borders—of the discipline. (shrink)

La idea de utopía tiene una larga historia en América y un vasto conjunto de significados. En este trabajo se interpreta a las utopías a partir de un enfoque utopológico basado en las reflexiones principalmente de M. R. Ramírez Fierro, A. A. Roig, H. Cerutti Guldberg y E. Fernández Nadal. Desde ese marco teórico se analiza una utopía concreta contemporánea de la Patagonia argentina. Se trata del barrio intercultural proyectado en San Martín de los Andes por la comunidad mapuche “Curruhuinca” (...) y la Asociación Vecinos Sin Techo de esa ciudad. Aquí, describo el carácter utópico de dicho proyecto tomando como categorías de análisis los conceptos de función y tensión utópicas en relación a los distintos aspectos que ponen en juego la interculturalidad y la emergencia de nuevas subjetividades. The idea of utopia has a long history in America and a vast array of meanings. This paper interprets utopias from a utopological approach primarily based on the reflections of M. R. Ramirez Fierro, A. A. Roig, H. Cerutti Guldberg and E. Fernández Nadal. From this theoretical framework a contemporary concrete utopia of Argentine Patagonia is analyzed. It is an intercultural neighborhood in San Martin de los Andes projected by the Mapuche community “Curruhuinca” and the Homeless Neighbors Association of that city. Here, I describe the utopian character of the project taking the concepts of function and utopian tension as categories of analysis in relation to the different aspects that involve interculturality and the emergence of new subjectivities. (shrink)

Il breve saggio si propone di esaminare la centralità della figura materna nell’opera di un ingegnoso costruttore di storie della letteratura italiana del Novecento: Alberto Moravia. La scelta dell’Autore nasce dalla rilevanza della tematica nella sua opera, in cui peraltro è quasi sempre assente il punto di vista femminile delle “voci” delle donne. Ciò sembra paradossale e questa circostanza è di grande interesse critico. In particolare, a dispetto delle interpretazioni più canoniche, secondo cui Moravia – negli scritti realizzati tra il (...) 1929 e il 1964 – ha inteso compiere una “distruzione” dell’immagine materna nel quadro di una visione pessimista della famiglia borghese, dovremo considerare un più complesso e articolato universo materno nello scrittore romano, in cui è possibile ricostruire cinque modelli – la “madre autoritaria”, la “madre-non madre”, la “madre padrona”, la “madre-angelo custode” e la “madre-seduttrice” –, ben esemplificati nei principali romanzi ma che si ritrovano nei racconti che Moravia scrive ininterrottamente dagli anni Trenta agli anni Sessanta, la cui mole ha determinato, ancor oggi, una mancanza di studi sistematici. In secondo luogo, la tematica della madre sarà esaminata nelle trasposizioni cinematografiche italiane delle opere letterarie di Moravia. Va ricordato che il rapporto dello scrittore con il cinema fu particolarmente intenso. Per un verso, la “settima arte” rivestì un ruolo non secondario nella formazione ed esperienza estetica dell’Autore romano, che al cinema si interessò anche professionalmente nelle vesti di critico cinematografico, a partire dal primo dopoguerra, dapprima, per La nuova Europa e Libera stampa, poi, per L’Europeo e L’Espresso, a cui dobbiamo aggiungere l’attività di saggista per numerose riviste specializzate. Per altro verso, il cinema italiano non solo ha attinto a “mani basse” dall’opera di Moravia per sceneggiature di pellicole, che furono pietre miliari della sua storia. L’elenco dei romanzi e racconti adattati al grande schermo rende conto della grande influenza nella cultura italiana degli anni Cinquanta e Sessanta: La provinciale (1953) di Mario Soldati, La romana (1954) di Luigi Zampa, Peccato che sia una canaglia (1954) di Alessandro Blasetti, Racconti romani (1955) di Gianni Franciolini, La ciociara (1960) di Vittorio de Sica, La giornata balorda (1960) di Mauro Bolognini, Risate di gioia (1960) di Mario Monicelli, Agostino (o la perdita dell’innocenza) (1962) di Mauro Bolognini, La noia (1963) di Damiano Damiani, Gli indifferenti (1964) di Francesco Maselli, Le ore nude (1964) di Marco Vicario, La donna invisibile (1969) di Paolo Spinola, Una ragazza piuttosto complicata (1969) di Damiano Damiani, L’amore coniugale (1970) di Dacia Maraini, Il conformista (1970) di Bernardo Bertolucci, e molti altri ancora. Come avremo modo soltanto di accennare, il successo della letteratura moraviana nel mondo del cinema italiano si deve a molteplici fattori, tra cui la raffigurazione dei personaggi e degli ambienti, la focalizzazione su certe tematiche e, non da ultimo, lo stile narrativo, particolarmente adatto alle trasposizioni cinematografiche. Come caso di studio, ci soffermeremo, infine, sulla figura materna della versione filmica de La noia di Damiani, con l’obiettivo di verificare se nel passaggio dal libro alla pellicola, quella particolare connotazione della madre autoritaria abbia subito delle alterazioni. L’ipotesi che muove l’analisi è che la stesura delle sceneggiature, la raffigurazione dei personaggi e la messa in scena delle sequenze filmiche facciano emergere un riadattamento adeguato al largo pubblico, con il sovvertimento dell’andamento cronologico, alcune “lacune” di ordine psicologico nella raffigurazione dei protagonisti e un certo cedimento moralistico alla cultura ancora dominante negli anni ’50 e ’60, in cui la figura materna, sia quando è incattivita dalla povertà che quando è inaridita dalla ricchezza, anela comunque agli affetti familiari, trovando in essi una qualche forma di redenzione. (shrink)