Categorical Comprehensions and Recursion

A new categorical setting is defined in order to characterize the subrecursive classes belonging to complexity hierarchies. This is achieved by means of coercion functors over a symmetric monoidal category endowed with certain recursion schemes that imitate the bounded recursion scheme. This gives a categorical counterpart of generalized safe composition and safe recursion.Comment: Comments are welcom

Discovering New Sentiments from the Social Web

A persistent challenge in Complex Systems (CS) research is the phenomenological reconstruction of systems from raw data. In order to face the problem, the use of sound features to reason on the system from data processing is a key step. In the specific case of complex societal systems, sentiment analysis allows to mirror (part of) the affective dimension. However it is not reasonable to think that individual sentiment categorization can encompass the new affective phenomena in digital social networks. The present papers addresses the problem of isolating sentiment concepts which emerge in social networks. In an analogy to Artificial Intelligent Singularity, we propose the study and analysis of these new complex sentiment structures and how they are similar to or diverge from classic conceptual structures associated to sentiment lexicons. The conjecture is that it is highly probable that hypercomplex sentiment structures -not explained with human categorizations- emerge from high dynamic social information networks. Roughly speaking, new sentiment can emerge from the new global nervous systems as it occurs in humans

Algebraic combinatorics in bounded induction

In this paper, new methods for analyzing models of weak subsystems of Peano Arithmetic are proposed. The focus will be on the study of algebro-combinatoric properties of certain definable cuts. Their relationship with segments that satisfy more induction, with those limited by the standard powers/roots of an element, and also with definable sets in Bounded Induction is studied. As a consequence, some considerations on the Π1-interpretability of IΔ0 in weak theories, as well as some alternative axiomatizations, are reviewed. Some of the results of the paper are obtained by immersing Bounded Induction models in its Stone-Cech Compactification, once it is endowed with a topology.Ministerio de Ciencia, Innovación y Universidades PID2019-109152GB-I0

Valoración de la conducta alimentaria y de control del peso en practicantes de aerobic

Este trabajo presenta una descripción de las conductas alimentarias y de pérdida de peso de las participantes en la actividad física de aeróbic y su relación con la sintomatología de trastorno alimentario. El total de la muestra está constituida por 123 mujeres universitarias, con una media de edad de 23,06 anos. Los cuestionarios administrados fueron: la versión espanola del EAT-40 (Castro, Toro, alamero y Guimera, 1991) y el CAD (Cuestionario de Alimentación en el Deporte), elaborado expresamente para la situación. Los resultados muestran como 9,2% de los sujetos presentan sintomatología de trastorno alimentario.This study presents a description of eating behaviours and weight losses in those people practicising aerobics and their relation with the symptomatology of eating disorders. The total number of participants is 123 university students, all of them women. The age averages 23,06 years old. The questionnaires that have been distributed are: the spanish version of EAT-40 (Castro, Toro, Salamero and Guimera, 1991) and the CAD (Questionnaire on Nutrition in Sports), that has been prepared on purpose for Dosil, J. y Díaz, O

Logic Negation with Spiking Neural P Systems

Nowadays, the success of neural networks as reasoning systems is doubtless. Nonetheless, one of the drawbacks of such reasoning systems is that they work as black-boxes and the acquired knowledge is not human readable. In this paper, we present a new step in order to close the gap between connectionist and logic based reasoning systems. We show that two of the most used inference rules for obtaining negative information in rule based reasoning systems, the so-called Closed World Assumption and Negation as Finite Failure can be characterized by means of spiking neural P systems, a formal model of the third generation of neural networks born in the framework of membrane computing.Comment: 25 pages, 1 figur

El sevillano Rodrigo de Bastidas

Tomo 36. Número 111Peer reviewe

Didáctica de las lenguas extranjeras: los enfoques comunicativos.

Sin resumenCheckup and situation of communicative approches proposals and objectives, as a methodology that is looking for an answer to the main problems of foreign languages learning and teaching. A critical point of view, from practice, of the essential notions and of the differen¡ scientific subjects that give explanatory clements