Nations usually define themselves in positive terms; they proclaim themselves strong and victorious, or developed and prosperous. But what does it mean when the opposite is true - when negative feelings like regret, nostalgia, melancholy and fatalism are said to be the true essence of a culture? And what does it mean when these feelings are encapsulated in a single, untranslatable word?Bringing together three such word-concepts from Europe's periphery - saudade in Portugal, the Czech litost of Milan Kundera and Orhan (...) Pamuk's of Istanbul - this book investigates claims that they embody the historical experiences and character of a people. In each case, it explores the historical, cultural and psychological mechanisms behind the invention of negative autostereotypes to offer new ways of thinking about individual and collective identities. This eclectic and broad-ranging study is not only a historical survey of emotions, but also a meditation on hope, belonging and the search for authenticity in the modern age. (shrink)

This article points out the criteria necessary in order for a qualitative scientific method to qualify itself as phenomenological in a descriptive Husserlian sense. One would have to employ description within the attitude of the phenomenological reduction, and seek the most invariant meanings for a context. The results of this analysis are used to critique an article by Klein and Westcott , that presents a typology of the development of the phenomenological psychological method.

The phenomenon of "social alchemy", containing the idea of the possibility of creating a new man and a new world and passing through all radical thought, especially of the New and Modern times, had and has a habit of pouring out into violence, in the broadest sense of the word, — from the guillotine and concentration camps to modern "information colonization of consciousness". Having received technological support, when digital technologies and new communication systems cover almost the entire world community, leaving (...) no one outside of their comprehensive influence, the phenomenon of "social alchemy" has acquired a qualitatively different, special and global significance. At the same time, the goals, means and actors have changed, only its radical component has remained unchanged, striving to transform society and build such social, political and economic structures and relations, that would correspond to certain ideas of some elites (economic, political, intellectual) about what should the global world be like in order to ensure their interests to the greatest extent. (shrink)

We show that there exist downwards properly $\Sigma _{2}^{0}$ (in fact noncuppable) e-degrees that are not high. We also show that every high e-degree bounds a noncuppable e-degree.

The paper demonstrates that a detailed analysis of Hegel’s criticism of rationalist metaphysics in the “Vorbegriff” (Preliminary Conception) chapter of the Encyclopedia Logic can shed light on the following critical features of Hegel’s metaphysics: (1) advancing semantic holism as an alternative to semantic atomism; (2) renouncing the projection of a substance-attribute formal structure onto actuality; (3) dismissing sense perception as the source of conceptual content; and (4) rejecting dualist ontology.

This book argues that the Doctrine of the Concept is the centerpiece of Hegel’s philosophical system and, through a close analysis of this final part of the Science of Logic, presents a detailed account of the key features of Hegel’s ontology.

To date, COVID-19 has spread across the world, changing our way of life and forcing us to wear face masks. This report demonstrates that face masks influence the human ability to infer emotions by observing facial configurations. Specifically, a mask obstructing a face limits the ability of people of all ages to infer emotions expressed by facial features, but the difficulties associated with the mask’s use are significantly pronounced in children aged between 3 and 5 years old. These findings are (...) of essential importance, as they suggest that we live in a time that may potentially affect the development of social and emotion reasoning, and young children’s future social abilities should be monitored to assess the true impact of the use of masks. (shrink)

In adapting Husserl’s philosophical phenomenological method to conduct research in psychology I included Husserl’s two methodical steps, the epochē and the reduction, as part of the scientific procedure. Zahavi objected to my use of those steps. This article is a response to his objections and it is a reaffirmation of the necessity of the epochē and reduction for Husserlian phenomenological psychological research. A description of Husserl’s acknowledged types of psychology and a description of his transcendental phenomenology are also presented along (...) with two outlines of how Husserlian phenomenological research could be conducted. (shrink)

Dzhaparidze, G., A generalized notion of weak interpretability and the corresponding modal logic, Annals of Pure and Applied Logic 61 113-160. A tree Tr of theories T1,...,Tn is called tolerant, if there are consistent extensions T+1,...,T+n of T1,...,Tn, where each T+i interprets its successors in the tree Tr. We consider a propositional language with the following modal formation rule: if Tr is a tree of formulas, then Tr is a formula, and axiomatically define in this language the decidable logics TLR (...) and TLRω. It is proved that TLR yields exactly the schemata of PA-provable sentences, if Tr is understood as “Tr is tolerant”. In fact, TLR axiomatizes a considerable fragment of provability logic with quantifiers over ∑1-sentences, and many relations that have been studied in the literature can be expressed in terms of tolerance. We introduce and study two more relations between theories: cointerpretability and cotolerance which are, in a sense, dual to interpretability and tolerance. Cointerpretability is a characterization of ∑1-conservativity for essentially reflexive theories in terms of translations. (shrink)

This article addresses the notion of “illusions of the multitude”, or the ideas created by the imagination in the analysis that Baruch Spinoza makes in his works. The text aims to explore the following questions: What characteristics reveal the ideas originating from the imagination? What role do these ideas play in the political and so- cial space? First, I emphasize Spinoza’s explanation of the imagination, as a first mode of knowledge. Secondly, I delve into the characteristics of the ideas that (...) stem from it and the affections that accompany them. Finally, I analyze their effects on the political and social space. (shrink)

This work is an attempt to lay foundations for a theory of interactive computation and bring logic and theory of computing closer together. It semantically introduces a logic of computability and sets a program for studying various aspects of that logic. The intuitive notion of computational problems is formalized as a certain new, procedural-rule-free sort of games between the machine and the environment, and computability is understood as existence of an interactive Turing machine that wins the game against any possible (...) environment. The formalism used as a specification language for computational problems, called the universal language, is a non-disjoint union of the formalisms of classical, intuitionistic and linear logics, with logical operators interpreted as certain—most basic and natural—operations on problems. Validity of a formula is understood as being “always computable”, and the set of all valid formulas is called the universal logic. The name “universal” is related to the potential of this logic to integrate, on the basis of one semantics, classical, intuitionistic and linear logics, with their seemingly unrelated or even antagonistic philosophies. In particular, the classical notion of truth turns out to be nothing but computability restricted to the formulas of the classical fragment of the universal language, which makes classical logic a natural syntactic fragment of the universal logic. The same appears to be the case for intuitionistic and linear logics . Unlike classical logic, these two do not have a good concept of truth, and the notion of computability restricted to the corresponding two fragments of the universal language, based on the intuitions that it formalizes, can well qualify as “intuitionistic truth” and “linear-logic truth”. The paper also provides illustrations of potential applications of the universal logic in knowledgebase, resourcebase and planning systems, as well as constructive applied theories. The author has tried to make this article easy to read. It is fully self-contained and can be understood without any specialized knowledge of any particular subfield of logic or computer science. (shrink)

Formulas of the propositional modal language with the unary modal operators □, Σ1, 1, Σ2, 2,… are considered as schemata of sentences of arithmetic , where □A is interpreted as “A is PA-provable”, ΣnA as “A is PA-equivalent to a Σn-sentence” and nA as “A is PA-equivalent to a Boolean combination of Σn-sentences”. We give an axiomatization and show decidability of the sets of the modal formulas which are schemata of: PA-provable, true arithmetical sentences.

El contexto rural colombiano, en los años noventa, se configuró, a partir de un discurso de desarrollo que desconoció y estigmatizó a la población campesina. En este sentido, “el trabajador agrario”, tal y como lo considera la Constitución Política de 1991, no refiere a la realidad específica de las comunidades campesinas, sino a un “pequeño productor”, que como lo indica el Informe de Desarrollo Humano de 2011, representa a individuo con un rol secundario, que con asistencia crediticia y técnica puede (...) ponerse a nivel, pero solo como productor de mediana escala. El presente artículo de reflexión tiene por objetivo analizar los efectos biopolíticos que ha tenido la visión política del desarrollo implementada en el campo colombiano, en esta época, haciendo énfasis en la forma como se han establecido las necesidades para esta población. (shrink)

A nonempty sequence T1,...,Tn of theories is tolerant, if there are consistent theories T 1 + ,..., T n + such that for each 1 i n, T i + is an extension of Ti in the same language and, if i n, T i + interprets T i+1 + . We consider a propositional language with the modality , the arity of which is not fixed, and axiomatically define in this language the decidable logics TOL and TOL. It is (...) shown that TOL (resp. TOL) yields exactly the schemata of PA-provable (resp. true) arithmetical sentences, if (A1,..., An) is understood as (a formalization of) PA+A1, ..., PA+An is tolerant. (shrink)

Neurotechnologies broadly understood are tools that have the capability to read, record and modify our mental activity by acting on its brain correlates. The emergence of increasingly powerful and sophisticated techniques has given rise to the proposal to introduce new rights specifically directed to protect mental privacy, freedom of thought, and mental integrity. These rights, also proposed as basic human rights, are conceived in direct relation to tools that threaten mental privacy, freedom of thought, mental integrity, and personal identity. In (...) this paper, our goal is to give a philosophical foundation to a specific right that we will call right to mental integrity. It encapsulates both the classical concepts of privacy and non-interference in our mind/brain. Such a philosophical foundation refers to certain features of the mind that hitherto could not be reached directly from the outside: intentionality, first-person perspective, personal autonomy in moral choices and in the construction of one's narrative, and relational identity. A variety of neurotechnologies or other tools, including artificial intelligence, alone or in combination can, by their very availability, threaten our mental integrity. Therefore, it is necessary to posit a specific right and provide it with a theoretical foundation and justification. It will be up to a subsequent treatment to define the moral and legal boundaries of such a right and its application. (shrink)

Computability logic (CL) is a recently launched program for redeveloping logic as a formal theory of computability, as opposed to the formal theory of truth that logic has more traditionally been. Formulas in it represent computational problems, "truth" means existence of an algorithmic solution, and proofs encode such solutions. Within the line of research devoted to finding axiomatizations for ever more expressive fragments of CL, the present paper introduces a new deductive system CL12 and proves its soundness and completeness with (...) respect to the semantics of CL. Conservatively extending classical predicate calculus and offering considerable additional expressive and deductive power, CL12 presents a reasonable, computationally meaningful, constructive alternative to classical logic as a basis for applied theories. To obtain a model example of such theories, this paper rebuilds the traditional, classical-logic-based Peano arithmetic into a computability-logic-based counterpart. Among the purposes of the present contribution is to provide a starting point for what, as the author wishes to hope, might become a new line of research with a potential of interesting findings—an exploration of the presumably quite unusual metatheory of CL-based arithmetic and other CL-based applied systems. (shrink)

This paper presents a soundness and completeness proof for propositional intuitionistic calculus with respect to the semantics of computability logic. The latter interprets formulas as interactive computational problems, formalized as games between a machine and its environment. Intuitionistic implication is understood as algorithmic reduction in the weakest possible — and hence most natural — sense, disjunction and conjunction as deterministic-choice combinations of problems , and “absurd” as a computational problem of universal strength.

Predicate modal formulas are considered as schemata of arithmetical formulas, where is interpreted as the standard formula of provability in a fixed sufficiently rich theory T in the language of arithmetic. QL T(T) and QL T are the sets of schemata of T-provable and true formulas, correspondingly. Solovay's well-known result — construction an arithmetical counterinterpretation by Kripke countermodel — is generalized on the predicate modal language; axiomatizations of the restrictions of QL T(T) and QL T by formulas, which contain no (...) variables different from x, are given by means of decidable prepositional bimodal systems; under the assumption that T is 1-complete, there is established the enumerability of the restrictions of QL T(T) and QL T by: 1) formulas in which the domains of different occurrences of don't intersect and 2) formulas of the form n A. (shrink)

Within the program of finding axiomatizations for various parts of computability logic, it was proven earlier that the logic of interactive Turing reduction is exactly the implicative fragment of Heyting’s intuitionistic calculus. That sort of reduction permits unlimited reusage of the computational resource represented by the antecedent. An at least equally basic and natural sort of algorithmic reduction, however, is the one that does not allow such reusage. The present article shows that turning the logic of the first sort of (...) reduction into the logic of the second sort of reduction takes nothing more than just deleting the contraction rule from its Gentzen-style axiomatization. The first sort of interactive reduction is also shown to come in three natural versions. While those three versions are very different from each other, their logical behaviors turn out to be indistinguishable, with that common behavior being precisely captured by implicative intuitionistic logic. Among the other contributions of the present article is an informal introduction of a series of new — finite and bounded — versions of recurrence operations and the associated reduction operations. (shrink)

I present a semantics for the language of first-order additive-multiplicative linear logic, i.e. the language of classical first-order logic with two sorts of disjunction and conjunction. The semantics allows us to capture intuitions often associated with linear logic or constructivism such as sentences = games, SENTENCES = resources or sentences = problems, where “truth” means existence of an effective winning strategy.The paper introduces a decidable first-order logic ET in the above language and gives a proof of its soundness and completeness (...) with respect to this semantics. Allowing noneffective strategies in the latter is shown to lead to classical logic.The semantics presented here is very similar to Blass's game semantics. Although there is no straightforward reduction between the two corresponding notions of validity, my completeness proof can likely be adapted to the logic induced by Blass's semantics to show its decidability, which was the main problem left open in Blass's paper.The reader needs to be familiar with classical logic and arithmetic. (shrink)

Predicate modal formulas with non-modalized quantifiers (call them Q-formulas) are considered as schemata of arithmetical formulas, where is interpreted as the provability predicate of some fixed correct extension T of arithmetic. A method of constructing 1) non-provable in T and 2) false arithmetical examples for Q-formulas by Kripke-like countermodels of certain type is given. Assuming the means of T to be strong enough to solve the (undecidable) problem of derivability in QGL, the Q-fragment of the predicate version of the logic (...) GL, we prove the recursive enumerability of the sets of Q-formulas all arithmetical examples of which are: 1) T-provable, 2) true. In. particular, the first one is shown to be exactly QGL and the second one to be exactly the Q-fragment of the predicate version of Solovay's logic S. (shrink)

The paper gives a soundness and completeness proof for the implicative fragment of intuitionistic calculus with respect to the semantics of computability logic, which understands intuitionistic implication as interactive algorithmic reduction. This concept — more precisely, the associated concept of reducibility — is a generalization of Turing reducibility from the traditional, input/output sorts of problems to computational tasks of arbitrary degrees of interactivity.

Dynamic topological logic provides a context for studying the confluence of the topological semantics for S4, topological dynamics, and temporal logic. The topological semantics for S4 is based on topological spaces rather than Kripke frames. In this semantics, □ is interpreted as topological interior. Thus S4 can be understood as the logic of topological spaces, and □ can be understood as a topological modality. Topological dynamics studies the asymptotic properties of continuous maps on topological spaces. Let a dynamic topological system (...) be a topological space X together with a continuous function f. f can be thought of in temporal terms, moving the points of the topological space from one moment to the next. Dynamic topological logics are the logics of dynamic topological systems, just as S4 is the logic of topological spaces. Dynamic topological logics are defined for a trimodal language with an S4-ish topological modality □, and two temporal modalities, ○ and *, both interpreted using the continuous function f. In particular, ○ expresses f’s action on X from one moment to the next, and * expresses the asymptotic behaviour of f. (shrink)

This paper constructs a cirquent calculus system and proves its soundness and completeness with respect to the semantics of computability logic. The logical vocabulary of the system consists of negation ${\neg}$ , parallel conjunction ${\wedge}$ , parallel disjunction ${\vee}$ , branching recurrence ⫰, and branching corecurrence ⫯. The article is published in two parts, with (the present) Part I containing preliminaries and a soundness proof, and (the forthcoming) Part II containing a completeness proof.

La Encíclica Laudato Si’ del Papa Francisco no solo realiza importantes afi rmaciones acerca de las cuestiones ambientales, sino que ofrece también indicaciones muy significativas para la adecuada comprensión de cuestiones antropológicas y éticas relevantes, en particular la ley natural. El presente trabajo intenta mostrar estos aportes y abrir horizontes de diálogo entre la tradición clásica y las posiciones actuales.

The paper introduces a semantics for the language of classical first order logic supplemented with the additional operators and . This semantics understands formulas as tasks. An agent , working as a slave for its master , can carry out the task αβ if it can carry out any one of the two tasks α, β, depending on which of them was requested by the master; similarly, it can carry out xα if it can carry out α for any particular (...) value for x selected by the master; an agent can carry out α→β if it can carry out β as long as it has, as a slave , an agent who carries out α; finally, carrying out P, where P is an atomic formula, simply means making P true; in particular, is a task that no agent can carry out. When restricted to the language of classical logic, the meaning of formulas is isomorphic to their classical meaning, which makes our semantics a conservative extension of classical semantics.This semantics can claim to be a formalization of the resource philosophy associated with linear logic, if resources are understood as agents carrying out tasks. The classical operators of our language correspond to the multiplicative operators of linear logic, while and correspond to the additive conjunction and universal quantifier, respectively.Our formalism may also have a potential to be used in AI as an alternative logic of planning and action. Its main appeal is that it is immune to the frame problem and the knowledge preconditions problem.The paper axiomatically defines a logic L in the above language and proves its soundness and completeness with respect to the task semantics in the following intuitive sense: L α iff α can be carried out by an agent who has nothing but its intelligence for carrying out tasks. This logic is shown to be semidecidable in the full language and decidable when the classical quantifier is forbidden in it. (shrink)

Background:In the variegated legislative framework on advance directives, the first specific regulation in Italy on this issue came into force only in 2018.Research objective:This qualitative study...

This paper constructs a cirquent calculus system and proves its soundness and completeness with respect to the semantics of computability logic. The logical vocabulary of the system consists of negation \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\neg}}$$\end{document}, parallel conjunction \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\wedge}}$$\end{document}, parallel disjunction \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\vee}}$$\end{document}, branching recurrence ⫰, and branching corecurrence ⫯. The article is published in two parts, with (the previous) (...) Part I containing preliminaries and a soundness proof, and (the present) Part II containing a completeness proof. (shrink)