En diciembre de 2011, Samba Martine, interna del Centro de Internamiento para Extranjeros de Aluche, muere de una infección evitable por no haber sido diagnosticada y tratada de manera adecuada, a pesar de haber solicitado insistentemente asistencia sanitaria. La madre de Samba, con el apoyo de varias entidades sociales, denuncia los hechos y llega a los tribunales. Ocho años más tarde, en junio de 2019, se anuncia la absolución por homicidio imprudente del único responsable procesado. Nueve años más tarde, en (...) octubre de 2020, el Ministerio de la Presidencia, Relaciones con las Cortes y Memoria Democrática emite una Resolución por la que se atiende la reclamación de responsabilidad patrimonial por el fallecimiento de Samba Martine. Tomando como punto de partida este caso, este trabajo tiene como objetivo analizar los factores que hacen de él un ejemplo de injusticia epistémica en tres niveles interrelacionados: micro, meso y macro. La relevancia de esta propuesta radica en mostrar cómo la dejación de funciones por parte de la Administración y sus instituciones contribuye a generar una ignorancia, que, combinada con la falta de credibilidad del testimonio de la víctima, tiene como resultado final su muerte. Lejos de ser un caso anecdótico, situaciones de injusticia epistémica como esta forman parte de la cotidianeidad de numerosas personas migrantes indocumentadas, que después de periplos de sufrimiento terminan internadas en limbos legales como los CIE. (shrink)

La relación entre derechos políticos y separación de poderes no ha recibido demasiada atención en el pensamiento democrático de los últimos años donde ha sido predominante una visión centrada en el constitucionalismo de los derechos, con una explícita orientación contra-mayoritaria. El propósito de este artículo es indicar una serie de transformaciones que afectan de manera determinante a la estructura de separación de poderes de nuestros sistemas constitucionales y que suponen un cambio radical en las condiciones de ejercicio de los derechos (...) políticos. Se utiliza para ello el aparato conceptual desarrollado por Luigi Ferrajoli en su reciente Principia Iuris y, en particular, la distinción entre funciones de gobierno y funciones de garantía. La sugerencia con la que se cierra el trabajo es que la distinción entre juicio político y conocimiento cierto es indispensable en el diseño institucional de cualquier democracia representativa pero reposa sobre un conjunto de reglas pragmáticas acerca de la distribución de la autoridad epistémica que se han vuelto extremadamente inestables en las sociedades contemporáneas. (shrink)

ABSTRACT In contemporary societies, governance is becoming governance by experts or under expert advice. This paper offers a survey of the basic conceptual schema that underlies some legal and political uses of knowledge, which has been traditionally based on a two-fold principle of distribution of epistemic labour between public officials and experts. Building on the example of the European system of comitology and, particularly, on the European experiences in the field of nanotechnology regulation, where expert advice has proved to be (...) particularly controversial, I will argue that the principal-agent logic that has been conventionally placed at the core of the relationship between public authorities and experts must be enhanced or specified. Facing situations of qualified uncertainty, when epistemic privilege of experts tends to decline because of the absence of conclusive evidence, the standard division of epistemic labour becomes blurred and crucial questions of justice come to the fore. Moreover, I will show that, at that point, the demand for lay people participation becomes increasingly compelling. The underlying context of this discussion is the understanding that both politics of knowledge and politics of ignorance are already playing a crucial role in the governance of our increasingly ungovernable democracies. (shrink)

In this work we propose a labelled tableau method for ukasiewicz infinite-valued logic L . The method is based on the Kripke semantics of this logic developed by Urquhart [25] and Scott [24]. On the one hand, our method falls under the general paradigm of labelled deduction [8] and it is rather close to the tableau systems for sub-structural logics proposed in [4]. On the other hand, it provides a CoNP decision procedure for L validity by reducing the check of (...) branch closure to linear programming. (shrink)

The aim of this work is to develop a declarative semantics for N-Prolog with negation as failure. N-Prolog is an extension of Prolog proposed by Gabbay and Reyle, which allows for occurrences of nested implications in both goals and clauses. Our starting point is an operational semantics of the language defined by means of top-down derivation trees. Negation as finite failure can be naturally introduced in this context. A goal-G may be inferred from a database if every top-down derivation of (...) G from the database finitely fails, i.e., contains a failure node at finite height.Our purpose is to give a logical interpretation of the underlying operational semantics. In the present work we take into consideration only the basic problems of determining such an interpretation, so that our analysis will concentrate on the propositional case. Nevertheless we give an intuitive account of how to extend our results to a first order language. A full treatment of N-Prolog with quantifiers will be deferred to the second part of this work. (shrink)

In this paper we focus on theorem proving for conditional logics. First, we give a detailed description of CondLean, a theorem prover for some standard conditional logics. CondLean is a SICStus Prolog implementation of some labeled sequent calculi for conditional logics recently introduced. It is inspired to the so called “lean” methodology, even if it does not fit this style in a rigorous manner. CondLean also comprises a graphical interface written in Java. Furthermore, we introduce a goal-directed proof search mechanism, (...) derived from the above mentioned sequent calculi based on the notion of uniform proofs. Finally, we describe GOALDUCK, a simple SICStus Prolog implementation of the goal-directed calculus mentioned here above. Both the programs CondLean and GOALDUCK, together with their source code, are available for free download at. (shrink)

In dynamical systems models feedforward is needed to guide planning and to process unknown and unpredictable events. Feedforward could help Theory of Event Coding (TEC) integrate control processes and could model human performance in action planning in a more flexible and powerful way.

The logic of Conditional Beliefs has been introduced by Board, Baltag, and Smets to reason about knowledge and revisable beliefs in a multi-agent setting. In this article both the semantics and the proof theory for this logic are studied. First, a natural semantics forCDLis defined in terms of neighbourhood models, a multi-agent generalisation of Lewis’ spheres models, and it is shown that the axiomatization ofCDLis sound and complete with respect to this semantics. Second, it is shown that the neighbourhood semantics (...) is equivalent to the original one defined in terms of plausibility models, by means of a direct correspondence between the two types of models. On the basis of neighbourhood semantics, a labelled sequent calculus forCDLis obtained. The calculus has strong proof-theoretic properties, in particular admissibility of contraction and cut, and it provides a decision procedure for the logic. Furthermore, its semantic completeness is used to obtain a constructive proof of the finite model property of the logic. Finally, it is shown that other doxastic operators can be easily captured within neighbourhood semantics. This fact provides further evidence of the naturalness of neighbourhood semantics for the analysis of epistemic/doxastic notions. (shrink)

Product logic Π is an important t-norm based fuzzy logic with conjunction interpreted as multiplication on the real unit interval [0,1], while Cancellative hoop logic CHL is a related logic with connectives interpreted as for Π but on the real unit interval with 0 removed (0,1]. Here we present several analytic proof systems for Π and CHL, including hypersequent calculi, co-NP labelled calculi and sequent calculi.

We define a family of intuitionistic non-normal modal logics; they can be seen as intuitionistic counterparts of classical ones. We first consider monomodal logics, which contain only Necessity or Possibility. We then consider the more important case of bimodal logics, which contain both modal operators. In this case we define several interactions between Necessity and Possibility of increasing strength, although weaker than duality. We thereby obtain a lattice of 24 distinct bimodal logics. For all logics we provide both a Hilbert (...) axiomatisation and a cut-free sequent calculus, on its basis we also prove their decidability. We then define a semantic characterisation of our logics in terms of neighbourhood models containing two distinct neighbourhood functions corresponding to the two modalities. Our semantic framework captures modularly not only our systems but also already known intuitionistic non-normal modal logics such as Constructive K and the propositional fragment of Wijesekera’s Constructive Concurrent Dynamic Logic. (shrink)

In this work we develop goal-directed deduction methods for the implicational fragment of several modal logics. We give sound and complete procedures for strict implication of K, T, K4, S4, K5, K45, KB, KTB, S5, G and for some intuitionistic variants. In order to achieve a uniform and concise presentation, we first develop our methods in the framework of Labelled Deductive Systems [Gabbay 96]. The proof systems we present are strongly analytical and satisfy a basic property of cut admissibility. We (...) then show that for most of the systems under consideration the labelling mechanism can be avoided by choosing an appropriate way of structuring theories. One peculiar feature of our proof systems is the use of restart rules which allow to re-ask the original goal of a deduction. In case of K, K4, S4 and G, we can eliminate such a rule, without loosing completeness. In all the other cases, by dropping such a rule, we get an intuitionistic variant of each system. The present results are part of a larger project of a goal directed proof theory for non-classical logics; the purpose of this project is to show that most implicational logics stem from slight variations of a unique deduction method, and from different ways of structuring theories. Moreover, the proof systems we present follow the logic programming style of deduction and seem promising for proof search [Gabbay and Reyle 84, Miller et al. 91]. (shrink)

Este trabajo iba a tratar sobre por qué el antropocentrismo es un problemairrelevante para las discusiones de bioética, y deberíamos prescindir de él.El argumento era que sostener una actitud antropocéntrica, tanto moderadacomo dura, tenía las mismas consecuencias a nivel práctico. Un antropocentristaapelará a la utilidad del medio ambiente y de las especies queen él habitan para la vida humana; y por ello sería importante que cuidaradel ecosistema para mantener dichos beneficios. Por otro lado un no-antropocentrista,apelará a que los animales y (...) el ecosistema cuentan con unasuerte de valor intrínseco y deberíamos cuidarlo apelando a dicho valor. Espor ello que las distinciones sólo podrían verse a un nivel teórico. (shrink)

In this paper we propose a conditional logic called IBC to represent iterated belief revision systems. We propose a set of postulates for iterated revision which are a small variant of Darwiche and Pearl''s ones. The conditional logic IBC has a standard semantics in terms of selection function models and provides a natural representation of epistemic states. We establish a correspondence between iterated belief revision systems and IBC-models. Our representation theorem does not entail Gärdenfors'' Triviality Result.

Al principio este trabajo iba a tratar sobre por qué el antropocentrismo es un problema irrelevante para las discusiones de bioética y deberíamos prescindir de él. El argumento era que sostener una actitud antropocéntrica, tanto moderada como dura, tenía las mismas consecuencias a nivel práctico. Un antropocentrista apelará a la utilidad del medio ambiente y de las especies que en él habitan para la vida humana; y por ello sería importante que cuidara del ecosistema para mantener dichos beneficios. Por otro (...) lado, un no antropocentrista apelará a que los animales y el ecosistema cuentan con una suerte de valor intrínseco y deberíamos cuidarlos atendiendo a dicho valor. Es por ello que las distinciones sólo podrían verse a un nivel teórico. (shrink)

We present logic programming style “goal-directed” proof methods for Łukasiewicz logic Ł that both have a logical interpretation, and provide a suitable basis for implementation. We introduce a basic version, similar to goal-directed calculi for other logics, and make refinements to improve efficiency and obtain termination. We then provide an algorithm for fuzzy logic programming in Rational Pavelka logic RPL, an extension of Ł with rational constants.

Barlow's concept of the exploitation of environmental statistical regularities may be more plausibly related to brain mechanisms than Shepard's notion of internalisation. In our view, Barlow endorses a bottom-up approach to neural coding and processing, whereas we suggest that feedback interactions in the visual system, as well as chaotic correlation dynamics in the brain, are crucial in exploiting and assimilating environmental regularities. We also discuss the “conceptual tension” between Shepard's ideas of law internalisation and evolutionary adaptation. [Barlow; Shepard].

The 'Enciclopedia Filosofica' is an encyclopaedia of philosophical topics promoted by the Centre for Philosophical Studies of Gallarate and published, in its third and last edition in 2006, by the Bompiani publishing house in Milan. The first edition of the 'Enciclopedia Filosofica' was promoted by the Centre for Philosophical Studies of Gallarate in the 1950s, seeing the light in 1957-58. A second edition, published by the Sansoni publishing house in Florence, was published in 1968-69 and reprinted in 1979. The third (...) and last edition, published by Bompiani in 2006, is intended to cover the whole of philosophical knowledge and related disciplines with over ten thousand entries edited by about a thousand academics, both Italian and non-Italian, and distributed in twelve volumes for a total of 12,496 pages. (shrink)

In this paper we propoee a logic programming language which supports hypothetical updates together with integrity constraints. The language makes use of a revision mechanism, which is needed to restore consistency when an update violates some integrity constraint. The revision policy adopted is based on the simple idea that more recent information is preferred to earlier one. We show how this language can be used to represent and perform several types of defeasible reasoning. We develop a logical characterization of the (...) language in a three-valued conditional logic, by introducing a completion construction. We show that the operational semantics is sound and complete with respect to the completion construction. (shrink)

We study the topic of realization from classical justification logics in the context of the recently introduced Gödel justification logics. We show that the standard Gödel modal logics of Caicedo and Rodriguez are not realized by the Gödel justification logics and moreover, we study possible extensions of the Gödel justification logics, which are strong enough to realize the standard Gödel modal logics. On the other hand, we study the fragments of the standard Gödel modal logics, which are realized by the (...) usual Gödel justification logics. We prove the corresponding realization theorem by using Fitting’s merging of realizations as well as appropriate hypersequent calculi on the modal side, adapting the work by Metcalfe and Olivetti. For these hypersequent calculi, we also show a cut-elimination theorem. We provide natural semantical characterizations for all of these newly introduced logics. (shrink)

This paper presents several results on the non-commutative fuzzy logic HpsUL, a Hilbert system whose corresponding algebraic semantics is the variety of bounded representable residuated lattices. In particular, we prove that HpsUL is not complete with respect to algebras based on the real unit interval, which answers the question posed by Metcalfe, Olivetti and Gabbay and shows that HpsUL is not the logic of pseudo-uninorms and their residua.

To optimize the weak robustness of traditional face recognition algorithms, the classification accuracy rate is not high, the operation speed is slower, so a face recognition algorithm based on local binary pattern and stacked autoencoder is proposed. The advantage of LBP texture structure feature of the face image as the initial feature of sparse autoencoder learning, use the unified mode LBP operator to extract the histogram of the blocked face image, connect to form the LBP features of the entire image. (...) It is used as input of the stacked AE, feature extraction is done, realize the recognition and classification of face images. Experimental results show that the recognition rate of the algorithm LBP-SAE on the Yale database has achieved 99.05%, and it further shows that the algorithm has a higher recognition rate than the classic face recognition algorithm; it has strong robustness to light changes. Experimental results on the Olivetti Research Laboratory library shows that the developed method is more robust to light changes and has better recognition effects compared to traditional face recognition algorithms and standard stack AEs. (shrink)

Default logic is one of the most popular and successful formalisms for non-monotonic reasoning. In 2002, Bonatti and Olivetti introduced several sequent calculi for credulous and skeptical reasoning in propositional default logic. In this paper we examine these calculi from a proof-complexity perspective. In particular, we show that the calculus for credulous reasoning obeys almost the same bounds on the proof size as Gentzen’s system LK. Hence proving lower bounds for credulous reasoning will be as hard as proving lower (...) bounds for LK. On the other hand, we show an exponential lower bound to the proof size in Bonatti and Olivetti’s enhanced calculus for skeptical default reasoning. (shrink)

Neuroimaging and psychophysiological techniques have proved to be useful in comprehending the extent to which the visual modality is pervasive in mental imagery, and in comprehending the specificity of images generated through other sensory modalities. Although further research is needed to understand the nature of mental images, data attained by means of these techniques suggest that mental imagery requires at least two distinct processing components.