Results for 'Carla San Mauro'

957 found
Order:
  1.  3
    Aron e Tocqueville: un dialogo a distanza.Carla San Mauro - 2019 - Canterano (RM): Aracne editrice.
    Direct download  
     
    Export citation  
     
    Bookmark  
  2.  33
    Primitive recursive equivalence relations and their primitive recursive complexity.Luca San Mauro, Nikolay Bazhenov, Keng Meng Ng & Andrea Sorbi - forthcoming - Computability.
    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. (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  3. The category of equivalence relations.Luca San Mauro, Valentino Delle Rose & Andrea Sorbi - 2021 - Algebra and Logic 5 (60):295-307.
    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*) (...)
     
    Export citation  
     
    Bookmark  
  4.  23
    (1 other version)Bi‐embeddability spectra and bases of spectra.Ekaterina Fokina, Dino Rossegger & Luca San Mauro - 2019 - Mathematical Logic Quarterly 65 (2):228-236.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  5.  23
    Word problems and ceers.Valentino Delle Rose, Luca San Mauro & Andrea Sorbi - 2020 - Mathematical Logic Quarterly 66 (3):341-354.
    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 (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  6.  21
    How to make (mathematical) assertions with directives.Giorgio Venturi, Luca San Mauro & Laura Caponetto - 2023 - Synthese 202 (5):1-16.
    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 (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  7.  14
    Approximating Approximate Reasoning: Fuzzy Sets and the Ershov Hierarchy.Nikolay Bazhenov, Manat Mustafa, Sergei Ospichev & Luca San Mauro - 2021 - In Sujata Ghosh & Thomas Icard (eds.), Logic, Rationality, and Interaction: 8th International Workshop, Lori 2021, Xi’an, China, October 16–18, 2021, Proceedings. Springer Verlag. pp. 1-13.
    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 (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  8.  19
    How to approximate fuzzy sets: mind-changes and the Ershov Hierarchy.Nikolay Bazhenov, Manat Mustafa, Sergei Ospichev & Luca San Mauro - 2023 - Synthese 201 (2):1-25.
    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 (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  9.  9
    Learning families of algebraic structures from informant.Luca San Mauro, Nikolay Bazhenov & Ekaterina Fokina - 2020 - Information And Computation 1 (275):104590.
    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 (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  10.  11
    Degrees of bi-embeddable categoricity.Luca San Mauro, Nikolay Bazhenov, Ekaterina Fokina & Dino Rossegger - 2021 - Computability 1 (10):1-16.
    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 (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  11. (1 other version)Church-Turing Thesis, in Practice.Luca San Mauro - 2018 - In John Baldwin (ed.), Truth, Existence and Explanation. Springer Verlag. pp. 225-248.
    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 (...)
    No categories
     
    Export citation  
     
    Bookmark  
  12.  26
    Calculating the mind-change complexity of learning algebraic structures.Luca San Mauro, Nikolay Bazhenov & Vittorio Cipriani - 2022 - In Ulrich Berger, Johanna N. Y. Franklin, Florin Manea & Arno Pauly (eds.), Revolutions and Revelations in Computability. pp. 1-12.
    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 (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  13.  5
    Measuring the complexity of reductions between equivalence relations.Luca San Mauro, Ekaterina Fokina & Dino Rossegger - 2019 - Computability 3 (8):265-280.
    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 (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  14.  19
    At least one black sheep: Pragmatics and the language of mathematics.Luca San Mauro, Marco Ruffino & Giorgio Venturi - 2020 - Journal of Pragmatics 1 (160):114-119.
    In this paper we argue, against a somewhat standard view, that pragmatic phenomena occur in mathematical language. We provide concrete examples supporting this thesis.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  15. Trial and error mathematics: Dialectical systems and completions of theories.Luca San Mauro, Jacopo Amidei, Uri Andrews, Duccio Pianigiani & Andrea Sorbi - 2019 - Journal of Logic and Computation 1 (29):157-184.
    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 (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  16. Computable bi-embeddable categoricity.Luca San Mauro, Nikolay Bazhenov, Ekaterina Fokina & Dino Rossegger - 2018 - Algebra and Logic 5 (57):392-396.
    We study the algorithmic complexity of isomorphic embeddings between computable structures.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  17.  13
    On the Turing complexity of learning finite families of algebraic structures.Luca San Mauro & Nikolay Bazhenov - 2021 - Journal of Logic and Computation 7 (31):1891-1900.
    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 (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  18.  33
    The entropic tongue: Disorganization of natural language under LSD.Camila Sanz, Carla Pallavicini, Facundo Carrillo, Federico Zamberlan, Mariano Sigman, Natalia Mota, Mauro Copelli, Sidarta Ribeiro, David Nutt, Robin Carhart-Harris & Enzo Tagliazucchi - 2021 - Consciousness and Cognition 87:103070.
  19.  96
    Thin Objects Are Not Transparent.Matteo Plebani, Luca San Mauro & Giorgio Venturi - 2023 - Theoria 89 (3):314-325.
    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.
    No categories
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  20.  67
    Speech acts in mathematics.Marco Ruffino, Luca San Mauro & Giorgio Venturi - 2020 - Synthese 198 (10):10063-10087.
    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 (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  21. On logicality and natural logic.Salvatore Pistoia-Reda & Luca San Mauro - 2021 - Natural Language Semantics 29 (3):501-506.
    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 (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  22.  23
    Classifying equivalence relations in the Ershov hierarchy.Nikolay Bazhenov, Manat Mustafa, Luca San Mauro, Andrea Sorbi & Mars Yamaleev - 2020 - Archive for Mathematical Logic 59 (7-8):835-864.
    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. (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  23.  19
    Investigating the Computable Friedman–Stanley Jump.Uri Andrews & Luca San Mauro - 2024 - Journal of Symbolic Logic 89 (2):918-944.
    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 (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  24.  93
    Trial and error mathematics I: Dialectical and quasidialectical systems.Jacopo Amidei, Duccio Pianigiani, Luca San Mauro, Giulia Simi & Andrea Sorbi - 2016 - Review of Symbolic Logic 9 (2):299-324.
  25.  27
    Trial and error mathematics II: Dialectical sets and quasidialectical sets, their degrees, and their distribution within the class of limit sets.Jacopo Amidei, Duccio Pianigiani, Luca San Mauro & Andrea Sorbi - 2016 - Review of Symbolic Logic 9 (4):810-835.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  26.  38
    Degrees of bi-embeddable categoricity of equivalence structures.Nikolay Bazhenov, Ekaterina Fokina, Dino Rossegger & Luca San Mauro - 2019 - Archive for Mathematical Logic 58 (5-6):543-563.
    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 (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  27.  37
    Universal computably enumerable equivalence relations.Uri Andrews, Steffen Lempp, Joseph S. Miller, Keng Meng Ng, Luca San Mauro & Andrea Sorbi - 2014 - Journal of Symbolic Logic 79 (1):60-88.
  28.  30
    On the Structure of Computable Reducibility on Equivalence Relations of Natural Numbers.Uri Andrews, Daniel F. Belin & Luca San Mauro - 2023 - Journal of Symbolic Logic 88 (3):1038-1063.
    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 (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  29.  14
    Contextualiser l’atrocite? Le musee de la memoire et Des droits de l’homme au chili.Mauro Basaure - 2019 - Les Ateliers de l'Éthique / the Ethics Forum 14 (2):183-207.
    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é. (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  30.  7
    San Tommaso e il pensiero post-moderno.Mauro La Spisa - 1982 - Milano: Massimo.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  31.  76
    Avicenna among medieval jews the reception of avicenna's philosophical, scientific and medical writings in jewish cultures, east and west.Gad Freudenthal & Mauro Zonta - 2012 - Arabic Sciences and Philosophy 22 (2):217-287.
    The reception of Avicenna by medieval Jewish readers presents an underappreciated enigma. Despite the philosophical and scientific stature of Avicenna, his philosophical writings were relatively little studied in Jewish milieus, be it in Arabic or in Hebrew. In particular, Avicenna's philosophical writings are not among the “Hebräische Übersetzungen des Mittelalters” – only very few of them were translated into Hebrew. As an author associated with a definite corpus of writings, Avicenna hardly existed in Jewish philosophy in Hebrew. Paradoxically, however, some (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  32.  26
    San Bonaventura, La conoscenza in Cristo. Introduzione, traduzione, commento di Lettorio Mauro.Fernand Van Steenberghen - 1988 - Revue Philosophique De Louvain 86 (70):253-254.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  33.  21
    Segurança Alimentar e Nutricional Em Tempos de Covid-19: Impactos Na África, América Latina e Portugal.Maitu Abibo Buanango, Lilian Fernanda Galesi-Pacheco, Yudi Paulina Garcia Ramirez, Cristina Amaro da Costa, Jaqueline Sgarbi Santos, Ana Pinto de Loura & Carla Maria Vieira - 2020 - Simbio-Logias Revista Eletrônica de Educação Filosofia e Nutrição 12 (16):100-117.
    Economic and sanitary crises have great repercussions on access to food and the health of the population. In this context, austerity policies can have devastating effects on social rights. The purpose of this essay is to reflect on the impact of various types of crises on the Human Right to Adequate Food and Nutrition (DHANA) and on Food and Nutritional Security (SAN) of vulnerable populations and to identify of public policies, programs and actions developed based on the relief of the (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  34.  28
    Franz Brentano. Sources and Legacy / Intentionality and Philosophy of Mind / Metaphysics, Logic, Epistemology / Ethics, Aesthetics, Religion (Critical Assessments of Leading Philosophers).Mauro Antonelli & Federico Boccaccini (eds.) - 2018 - New York: Routledge.
    Franz Brentano was a leading philosopher and psychologist of the nineteenth century. Indeed, the impact of his scholarship was so great that he became synonymous with a school of thought and a new approach in scientific philosophy. The Brentano School stood against the Idealistic and post-Kantian German tradition and Brentano played a crucial role in the founding of Austrian philosophy. He had an enormous impact on the work of Husserl and Heidegger, as well as on Moore’s _Ethics_ and Stout and (...)
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  35. Franz Brentano’s Intentionality Thesis.Mauro Antonelli - 2012 - In Alessandro Salice (ed.), Intentionality: Historical and Systematic Perspectives. Munich: Philosophia Verlag.
  36.  5
    Il tempo dell'altro in J. Derrida.Carla Amadio - 2012 - Torino: G. Giappichelli.
    Direct download  
     
    Export citation  
     
    Bookmark  
  37.  21
    Exploring thought experiments: Michael T. Stuart, Yiftach Fehige and James Robert Brown : The Routledge companion to thought experiments. Routledge: Oxon, New York, 2018, 567pp., USD$235.00 HB.Carla Rita Palmerino - 2019 - Metascience 28 (3):455-458.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  38.  5
    I sofisti.Mauro Bonazzi - 2010 - Roma: Carocci.
  39. (1 other version)Pŏphak tʻongnon.San-dŏk Hwang - 1973
     
    Export citation  
     
    Bookmark  
  40.  20
    Intentional Object and Correlate: From Brentano to Marty.Mauro Antonelli & Federico Boccaccini - 2021 - Revista de Filosofia Moderna E Contemporânea 9 (2):13-33.
    The aim of this article is to amend some misunderstandings about Franz Brentano's thesis of intentionality, defending a different interpretation from the current one about the nature of intentional object and intentional correlate, and proposing an analysis of the origin of this conceptual confusion. The main problem lies in his student Anton Marty's interpretation of the immanent object, paving the way for an immanentist reading of Brentano's theory of intentionality.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  41. De Plotino a S. Agustín.San Miguel & José Ramón - 1964 - Madrid,: Librería Editorial Augustinus.
     
    Export citation  
     
    Bookmark  
  42.  19
    Ciencias humanas y ciencias naturales, una relación ambigua desde la fenomenología.Javier San Martín - 2012 - Recerca.Revista de Pensament I Anàlisi 12:13-22.
    A partir de la afirmación en la que Ortega dice que el científico se aloja en el ser humano, el texto pretende, por un lado y desde una perspectiva fenomenológica, abordar el vínculo entre las ciencias naturales y las ciencias humanas y sociales y, por otro lado, analizar las consecuencias de las maneras en las que estos dos grupos de ciencias se han relacionado a fin de imaginar la posición que tanto las ciencias naturales como las humanas y sociales deben (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  43.  28
    La Filosofía de la paz de Vicent Martínez Guzmán y la fenomenología.Javier San Martín - 2021 - Investigaciones Fenomenológicas 16:291.
    El objetivo de este ensayo es primero honrar la memoria de Vicent Martínez Guzmán, destacando sus importantes contribuciones a la filosofía. Dada su relación con el autor, ha parecido lo más oportuno centrarse en la relación de su filosofía con la fenomenología puesto que otros colegas desentrañarán otras facetas. Para cumplir ese cometido el ensayo tiene cuatro partes. En la primera se hace una presentación de las etapas de la filosofía de nuestro autor. En la segunda se expone, con bastante (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  44.  38
    Manifestation of Trauma: The Effect of Early Traumatic Experiences and Adult Attachment on Parental Reflective Functioning.Pamela San Cristobal, Maria P. Santelices & Daniel A. Miranda Fuenzalida - 2017 - Frontiers in Psychology 8.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  45.  67
    What is Loneliness? Towards a Receptive Account.Mauro Rossi - 2023 - Topoi 42 (5):1109-1122.
    In this paper, I pursue two main goals. The first is to raise three objections against Tom Roberts and Joel Krueger’s recent account of loneliness (2021). The second is to sketch an alternative, receptive account. Roberts and Krueger focus on loneliness conceived of as an occurrent emotion. According to their account, loneliness involves two components: (1) a pro-attitude (e.g., a desire) towards certain social goods and (2) an awareness that such goods “are missing and out of reach, either temporarily or (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  46. Franz Brentano: critical assessments of leading philosophers.Mauro Antonelli & Federico Boccaccini (eds.) - 2019 - New York: Routledge.
     
    Export citation  
     
    Bookmark  
  47. Pŏpchʻŏrhak kangŭi.San-dŏk Hwang - 1975 - Sŏul : Pangmunsa : chʻong konggŭpchʻŏ Sejong Sŏwŏn,:
    No categories
     
    Export citation  
     
    Bookmark  
  48.  79
    La natura delle cose: introduzione ai fondamenti e alla filosofia della fisica.Valia Allori, Mauro Dorato, Federico Laudisa & Nino Zanghi (eds.) - 2005 - Roma: Carocci.
    The year 2005 has been named the World Year of Physics in recognition of the 100th anniversary of Albert Einstein's "Miracle Year," in which he published four landmark papers which had deep and great influence on the last and the current century: quantum theory, general relativity, and statistical mechanics. Despite the enormous importance that Einstein’s discoveries played in these theories, most physicists adopt a version of quantum theory which is incompatible with the idea that motivated Einstein in the first place. (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  49.  7
    Probability, Dynamics and Causality: Essays in Honour of Richard C. Jeffrey.D. Costantini & Maria Carla Galavotti - 1997 - Springer Verlag.
    The proceedings of a June 1995 conference in Luino, Italy. One poem and 16 papers explore various issues in the philosophy of science with an emphasis on the foundations of probability and statistics and quantum mechanics. The topics include subjective probability, Bayesian statistics, probability kinematics, causal decision making, and probability and realism in quantum mechanics. The problem of collecting new evidence and updating probability judgements are addressed in reference to different applications. No index. Reprinted from Erkenntnis vol. 45, nos. 2-3 (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  50.  31
    Complexity and Project Management: Challenges, Opportunities, and Future Research.José R. San Cristóbal, Emma Diaz, Luis Carral, José A. Fraguela & Gregorio Iglesias - 2019 - Complexity 2019:1-2.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
1 — 50 / 957