We study computability of the abstract linear Cauchy problem equation image)where A is a linear operator, possibly unbounded, on a Banach space X. We give necessary and sufficient conditions for A such that the solution operator K: x ↦ u of the problem is computable. For studying computability we use the representation approach to computable analysis developed by Weihrauch and others. This approach is consistent with the model used by Pour-El/Richards.

This paper explores what computational methodologies can tell us about philosophical education, particularly in the context of artificial intelligence (AI) ethics. Taking the readings on our AI ethics and responsible AI syllabi as a corpus of AI ethics literature, we conduct an analysis of the content of these courses through a variety of methods: word frequency analysis, term frequency–inverse document frequency (TF–IDF) scoring, document vectorization via SciBERT, clustering via k-means, and topic modelling using latent Dirichlet allocation (LDA). We (...) reflect on the findings of these analyses, and more broadly on what computational approaches can offer to the practice of philosophical education. Finally, we compare our approach to previous computational approaches in philosophy, and more broadly in the digital humanities. This project offers a proof of concept for how contemporary natural-language processing techniques can be used to support philosophical pedagogy: not only to reflect critically on what we teach, but to discover new materials, explore conceptual gaps, and make our courses more accessible to students from a range of disciplinary backgrounds. (shrink)

The article discusses the possibilities of the formal analysis of the fine-art painting composition on the basis of the classical definitions of beauty and computational aesthetics’ approaches of the second half of the 20th century he authors define the problem and consider solutions for the formalization of aesthetic perception in the context of aesthetic text, i.e., as part of the fine arts composition – a formal sequence of signs simply ordered in accordance with the syntactic rules’ system. The methodology (...) of the research is defined by the general semiotics, distinguishing semantics, syntax, and pragmatics of a sign, by the aesthetic analysis’ methods, ranging according to the author’s message aesthetics, receptive aesthetics, and text aesthetics, as well as by the computational analysis methods connected with neural network means of defining the images’ symmetry. The article reveals preconditions for the emergence and also the current state of computational aesthetics as an interdisciplinary branch of knowledge. Analyzing the problem from the perspective of philosophy, aesthetics, semiotics, and technology, the authors draw attention to the need to improve the computational aesthetics methods. Firstly, the existing methods do not always enable to describe the fine-art object adequately. Secondly, there exists the so-called reduction of aesthetic assertion transforming it into the assertion concerning the object’s external characteristics. As a result, the authors assume that the increasing complexity of the current mathematical models and the experts’ subjective assessment support will allow to reach a compromise solution that enables the development of computational aesthetics as a branch of knowledge. Enhancement and development of the mathematical models, taking into account the rules of semiotics and subjectivism of the human perception, is the relevant objective of computational analysis of the aesthetic fine-arts text. The results of the present research supports the classic statement regarding the underivability of semantic and pragmatic propositions from syntax. The research concludes that relevant objectives are to find a correlation between, one the one hand, the axes and points of symmetry, deriving from the neural simulation, and, on the other hand, aesthetic effect, emerging from the perception of fine-art paintings. (shrink)

In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we are asking the question which theorems can be continuously or computably transferred into each other? For this purpose theorems are considered via their realizers which are operations with certain input and output data. The technical tool to express continuous or computable relations between such operations is Weihrauch reducibility and the partially ordered degree structure induced by it. We have identified certain (...) choice principles such as co-finite choice, discrete choice, interval choice, compact choice and closed choice, which are cornerstones among Weihrauch degrees and it turns out that certain core theorems in analysis can be classified naturally in this structure. In particular, we study theorems such as the Intermediate Value Theorem, the Baire Category Theorem, the Banach Inverse Mapping Theorem, the Closed Graph Theorem and the Uniform Boundedness Theorem. We also explore how existing classifications of the Hahn—Banach Theorem and Weak Kőnig's Lemma fit into this picture. Well-known omniscience principles from constructive mathematics such as LPO and LLPO can also naturally be considered as Weihrauch degrees and they play an important role in our classification. Based on this we compare the results of our classification with existing classifications in constructive and reverse mathematics and we claim that in a certain sense our classification is finer and sheds some new light on the computational content of the respective theorems. Our classification scheme does not require any particular logical framework or axiomatic setting, but it can be carried out in the framework of classical mathematics using tools of topology, computability theory and computable analysis. We develop a number of separation techniques based on a new parallelization principle, on certain invariance properties of Weihrauch reducibility, on the Low Basis Theorem of Jockusch and Soare and based on the Baire Category Theorem. Finally, we present a number of metatheorems that allow to derive upper bounds for the classification of the Weihrauch degree of many theorems and we discuss the Brouwer Fixed Point Theorem as an example. (shrink)

Utilizing data from over 11,000 posts and 127,000 responses on Reddit groups over a 10-year period, we employed AI-powered content analysis to examine patterns in the discussions of Reddit users who post about prison and who the model classifies as before/after incarceration across various topics. Our findings revealed significant shifts regarding personal issues. These included issues relative to users’ mental health, substance use, spirituality, family relationships, and guilt and blame expression. The results offered insights into the human challenges faced (...) by individuals navigating the carceral system as expressed through their virtual identities. This study showcases how computational analysis of social media can reveal nuanced, longitudinal patterns in perceived carceral experiences while also highlighting methodological trade-offs between data richness and anonymity. (shrink)

Energy contributes significantly in almost all aspects of human life as well as economic activities and plays a crucial role in the infrastructural development of a county to alleviate poverty. Generating energy from a renewable source such as small hydropower through the application of pump operating as a turbine mode called Pump as Turbine is one of the best alternatives to provide clean and inexpensive energy. Using Pump as Turbine helps in generating reasonably priced hydroelectric power for communities in underdeveloped (...) counties. This study investigates the effects of internal flow behaviour and performance of Pump as Turbine under different rotational speed and flow rate. The rotational speed is an essential physical parameter as it affects the Pump as Turbine operation. A model-specific speed centrifugal pump model with head 32, flow rate of 12.5 and the rotational speed of 2900 rpm, has been selected for the study. Numerical simulations have been conducted using the k-ω turbulence model to solve three-dimensional equations. The pump mode experimental data were used to confirm the results for better analysis. The results predicted that vortex and turbulent kinetic energy increase per rotational speed increase. Also, at the higher rotational speed, very high recirculation of flow is detected at the blade suction chamber, although the pressure side has a smooth flow. This study provides beneficial information which will serve as a reference to help improve PAT performance along with selecting PAT for a small hydropower site. Future works will consider the impact of blade thickness and cavitation in Pump as Turbine. (shrink)

INTRODUCTION In the course of their excavations on Delos, the sacred island of Apollo, archaeologists discovered considerable remains of an Egyptian cult. ...

In this thesis, we study the complexity of some mathematical problems: in particular, those arising in computable analysis and algorithmic learning theory for algebraic structures. Our study is not limited to these two areas: indeed, in both cases, the results we obtain are tightly connected to ideas and tools coming from different areas of mathematical logic, including for example descriptive set theory and reverse mathematics.After giving the necessary preliminaries, we first study the uniform computational strength of the Cantor–Bendixson (...) theorem in the Weihrauch lattice. This work falls into the program connecting reverse mathematics and computable analysis via the framework of Weihrauch reducibility. We concentrate on problems related to perfect subsets of Polish spaces, studying the perfect set theorem, the Cantor–Bendixson theorem, and various problems arising from them. As far as we know, this is the first systematic study of problems at the level of $\mathbf {\Pi }^1_1\mathsf {-CA}_0$ in the Weihrauch lattice. We show that the strength of some of the problems we study depends on the topological properties of the Polish space under consideration, while others have the same strength once the space is rich enough.We continue considering problems related to (induced) subgraphs. We provide results on the (effective) Wadge complexity of sets of graphs, that are also used to determine the Weihrauch degree of certain decision problems. The decision problems we consider are defined for a fixed graph G, and they take as input a graph H, answering whether G is an (induced) subgraph of H: we also consider the opposite problem (i.e., answering whether H is an induced subgraph of G). We conclude this part on (induced) subgraphs considering the Weihrauch degree of “search problems.”These problems are defined for a fixed graph G, and they take as input a graph H such that G is an (induced) subgraph H: the output is a copy of G in H. In both cases, we highlight differences and analogies between the subgraph and the induced subgraph relation.We then move our attention to algorithmic learning theory, and we present the framework we use to study the learnability of families of algebraic structures: here, given a countable family of pairwise nonisomorphic structures $\mathfrak {K}$, a learner receives larger and larger pieces of an arbitrary copy of a structure in $\mathfrak {K}$ and, at each stage, is required to output a conjecture about the isomorphism type of such a structure. We say that $\mathfrak {K}$ is learnable if there exists a learner which eventually stabilizes to a correct guess. The framework was lacking a method for comparing the complexity of nonlearnable families, and so we propose a solution to this problem using tools coming from invariant descriptive set theory. To do so, we first prove that a family of structures is learnable if and only if its learning domain is continuously reducible to the relation $E_0$ of eventual agreement on infinite binary sequences and then, replacing $E_0$ with Borel equivalence relations of higher complexity, we obtain a new hierarchy of learning problems. This leads to the notion of E-learnability, where a family of structures $\mathfrak {K}$ is E-learnable, for a Borel equivalence relation E, if there is a continuous reduction from the isomorphism relation associated with $\mathfrak {K}$ to E. It is then natural to ask how the notion of E-learnability interacts with “classical” learning paradigms.Finally, we study the number of mind changes that a learner needs to learn a given family, both from a topological and a combinatorial point of view, and we consider how the complexity of a learner (in terms of Turing reducibility) affects the number of mind changes for learning a given family.Abstract prepared by Vittorio Cipriani.E-mail: [email protected]: https://air.uniud.it/handle/11390/1252226. (shrink)

John Pocock, Istvan Hont, and scholars of the Scottish Enlightenment have profoundly shaped how historians understand eighteenth-century debates about commerce and ‘commercial society’. Their influential interpretations – ranging from republican anxieties about corruption to the political-economic dynamics of trade and state power – continue to frame the field. This paper takes these positions as analytical starting points and examines them computationally. Using the largest existing corpus of eighteenth-century printed publications, we extract and model large-scale linguistic patterns to test three hypotheses (...) about the discursive relationship of commerce to other topics of political thought. Against the backdrop of overall ‘commercialisation’ of political thought taking place, the evidence aligns most strongly with Hont’s account of ‘jealousy of trade’, in which commerce is entwined with foreign rivalry and power-political concerns. Pocockian republican scepticism receives more limited support, and the broader Scottish Enlightenment narrative is only weakly reflected at scale. By situating early modern authors within these wider discursive structures, the paper demonstrates how computational methods can clarify, modify, and challenge established historiographical interpretations. (shrink)

Despotic leadership harms both employee motivation and well-being. It has been studied using several theories, including social exchange and social learning theory, the latter suggesting learning stems from imitation. This study explores dark side of leadership, particularly in current healthcare reforms in Pakistan, such as Medical Teaching Institute (MTI). The need to review changing structural hierarchies is emphasized, as unilateral decisions often lead to defensive silence rather than workplace aggression and bullying. This study investigated the moderating role of neuroticism in (...) the relationship between despotic leader- ship and workplace deviance, with emotional exhaustion mediating factor among healthcare sector employees. This study involved 294 professionals from public healthcare centres in Pakistan, achieving a 73% response rate. Five hypotheses were tested using Smart PLS for model testing and structural measurement along with SPSS and Preacher Hayes process models for moderated-mediation analysis. Results of linear regression analysis revealed that despotic leadership, mediated by emotional exhaustion, significantly impacts interpersonal and organizational deviance. Interestingly, neuroticism does not moderate this relationship, challenging previous literature. This study sheds light on despotic leadership’s broader influence beyond personality attributes, offering new theoretical and practical implications and guiding future research directions. (shrink)

We investigate Turing's contributions to computability theory for real numbers and real functions presented in [22, 24, 26]. In particular, it is shown how two fundamental approaches to computable analysis, the so-called ‘Type-2 Theory of Effectivity' (TTE) and the ‘realRAM machine' model, have their foundations in Turing's work, in spite of the two incompatible notions of computability they involve. It is also shown, by contrast, how the modern conceptual tools provided by these two paradigms allow a systematic interpretation (...) of Turing's pioneering work in the subject. (shrink)

The confrontations of stakeholder visions about agriculture and food production has become a focal point in the public sphere, coinciding with a diversification of agrifood models. This study analyzes the debates stemming from the coexistence of these models, particularly during the initial term of neoliberal-centrist Emmanuel Macron’s presidency in France. Employing collective monitoring from 2017 to 2021, a corpus of 958 online news and blog articles was compiled. Using a computational analysis, we reveal the framings and controversies emerging from (...) this media discourse. The macro-structuring of discourse on model coexistence revolves around scientific, economic and political framings. Coexistence is a complex of debates based on specific frames associated with specific arenas and actor configurations: growth of organic agriculture, transformations of agrifood systems, sciences of production and impacts, livestock and meat diet controversies, agroecological innovations, CAP reform criticism, discourse of peasant agriculture and State-Profession _co-gestion_. Employing global sentiment analysis and focusing on salient controversies, namely EGAlim law, pesticide regulations, and agribashing, we show the shift from conciliation to a hardening of debates. Finally, we discuss the causes and consequences of this trend. The political will to support the transition of agriculture remains influenced by the _co-gestion_ system, an inherited configuration of decision-makers instrumental in the agricultural modernization. As a consequence, significant agricultural challenges, particularly highlighted in the scientific macro-frame, persist unresolved. This lock-in of the agrifood system is based on defensive strategies that challenge the democratic debate about food and agricultural practices. (shrink)

This study explores the evolutionary trajectory of pragmatic functions in legal texts through a cross-temporal analysis of illocutionary act distributions, juxtaposing pre-modern legal codes (e.g., Hammurabi’s Code) with contemporary legal instruments. Grounded in Austin’s speech act theory and extended grammaticalization frameworks, the research employs computational linguistics methods—specifically Support Vector Machine (SVM) classification—to systematically identify and quantify pragmatic functions, including commands, prohibitions, authorizations, and declarations. Diachronic trends are visualized via Tableau to map structural shifts in linguistic realization of legal authority (...) over millennia. The findings reveal a robust pattern of grammaticalization: pre-modern texts predominantly utilize direct, deontically charged imperatives, whereas modern legal discourse exhibits a marked shift toward conditional, modalized structures that embed illocutionary force within syntactically complex, rule-based formulations. This transformation not only validates the hypothesis of pragmatic grammaticalization in legal language but also underscores the interplay between linguistic evolution, institutionalized legal rationality, and sociocultural shifts toward procedural justice. By integrating authentic translational examples and cross-jurisdictional comparisons, this study contributes to interdisciplinary scholarship at the intersection of legal linguistics, historical pragmatics, and computational discourse analysis. (shrink)

In this study, we use temporally aligned word embeddings and a large diachronic corpus of English to quantify language change in a data-driven, scalable way, which is grounded in language use. We show a unique and reliable relation between measures of language change and age of acquisition (AoA) while controlling for frequency, contextual diversity, concreteness, length, dominant part of speech, orthographic neighborhood density, and diachronic frequency variation. We analyze measures of language change tackling both the change in lexical representations and (...) the change in the relation between lexical representations and the words with the most similar usage patterns, showing that they capture different aspects of language change. Our results show a unique relation between language change and AoA, which is stronger when considering neighborhood-level measures of language change: Words with more coherent diachronic usage patterns tend to be acquired earlier. The results support theories positing a link between ontogenetic and ethnogenetic processes in language. (shrink)

In this article, we use a mix of computational techniques to identify textual shifts in the Ottoman şeyhülislams’ fetvas between the sixteenth and twentieth centuries. Our analysis, supplemented by a close reading of these texts, indicates that the fetvas underwent multiple forms of transformation, a consequence of the institutional evolution of the şeyhülislam’s fetva office that aimed to speed up and streamline the production of the fetvas: over time, the texts appropriated a more uniform character and came to contain (...) shorter responses. In the compositions of the questions, we identified many “trigger terms” that facilitated reflexive responses independent of the fetvas’ jurisprudential contexts, a tendency that became stronger after the second half of the seventeenth century. In addition, we propose in the article a methodology that measures the relative strengths of textual and conceptual links among the fetva corpora of various Ottoman şeyhülislams. This analysis informs us about possible paths of long-term evolution of this genre of jurisprudential documents. (shrink)

This article is a computational enquiry into the different ways in which two words, assumed to be central to the eighteenth-century concept of aesthetics, were used across that century. Using word co-association measures designed specifically for this study, I show the markedly different lexis that surrounded the words ‘beauty’ and ‘beautiful’ in three decades of historical textual data from Eighteenth-Century Collections Online. Having demonstrated that these words were used in very different semantic contexts in the beginning, middle, and end of (...) the century, the article presents semantic network diagrams which further demonstrate the distinctness of noun from adjective. I argue that while ‘beautiful’ is suspended in a semantic space that is recognizably aesthetic, ‘beauty’ is not. Furthermore, that which is deemed ‘beautiful,’ according to the evidence presented here, presents something of a challenge to received narratives of how the concept of aesthetics developed throughout the eighteenth century. (shrink)

The CompMusic project ran between 2011 and 2017 with the aim of promoting culturally-specific approaches in Computational Musicology, focusing on the art music traditions of India (Hindustani and Carnatic), Turkey (Turkish-Makam), Morocco (Arab-Andalusi), and China (Jingju). A large corpus was compiled for each of these traditions, from which much research was carried out. Since then, the evolution of new and increasingly more sophisticated methods and tools for Computational Musicology tasks has continued, and their application and development in culturally specific contexts (...) remain as important as ever. We present here the ongoing research and continuation of the CompMusic project for the tradition of Carnatic Music, introducing new methodologies for (1) Dataset gathering and management, (2) Music Information Retrieval tasks for feature extraction, and (3) Computational Musicology relevant tasks. In this paper, we present, by means of example contributions for each of the aforementioned cases, an overview of a long-term project aimed at providing the community with a complete catalog of tools for the continued research of this musical repertoire. (shrink)

In the field of economic analysis, computability in the formation of economic hypotheses is seen as the way forward. In this book, Professor Velupillai implements a theoretical research program along these lines. Choice theory, learning rational expectations equlibria, the persistence of adaptive behaviour, arithmetical games, aspects of production theory, and economic dynamics are given recursion theoretic (i.e. computable) interpretations. These interpretations lead to new kinds of questions being posed by the economic theorist. In particular, recurison theoretic decision problems (...) replace standard optimisation paradigms in economic analysis. Economic theoretic questions, posed recursion-theoretically, lead to answers that are ambiguous: undecidable choices, uncomputable learning processes, and algorithmically unplayable games become standard answers. Professor Velupillai argues that a recursion theoretic formalisation of economic analysisComputable Economicsmakes the subject intrinsically inductive and computational. (shrink)

This article explores the pattern-based design of traditional Iranian bazaars, emphasizing visual congruence of the components through quasi-fractal patterns. According to a context-oriented order, traditional bazaars, as integral parts of Iranian cities, follow an organized, mathematical approach. Using the box-counting method in ImageJ software, 13 samples from bazaars in Tabriz, Tehran, Kashan, Kerman, and Yazd were analyzed at macro, meso, and micro scales. The fractal dimensions, ranging from 1.48 to 1.66, align with traditional rather than modern architecture. The fractal dimension (...) of Timchehs is notably higher than that of Sarās. Further studies at finer scales are recommended. (shrink)

El autor analiza el pronunciamiento de Kierkegaard acerca de la mujer y lo femenino en el texto O lo Uno o lo Otro, especialmente en las partes I y II. Para esto, se seleccionaron palabras clave como “mujer”, “femenino”, “virginidad”, “novia”, “esposa”, entre muchas otras más y se empleó el programa de análisis comparativo SimCA 2.0 de Michael J. Greenacre con el objetivo de mostrar tanto las comunes como las diferentes posturas del esteta A y el esteta B, así como (...) ofrecer una serie de dimensiones discursivas presentes en el texto que arrojan un conjunto de conclusiones valiosas para la comprensión de esta obra kierkegaardiana y la postura del filósofo danés frente a la mujer y lo que le compete. Los resultados del análisis se muestran al final del artículo por medio de tablas que comparan el vocabulario de A y de B y muestran su frecuencia; otras figuras exhiben por medio de gráficas el comportamiento de las palabras clave frente a las dimensiones discursivas más importantes. (shrink)

Research conducted on Brain-Computer Interfaces has grown considerably during the last decades. With the help of BCIs, users can gain a wide range of functions. Our aim in this paper is to analyze the impact of BCIs on autonomy. To this end, we introduce three abilities that most accounts of autonomy take to be essential: the ability to use information and knowledge to produce reasons; the ability to ensure that intended actions are effectively realized ; and the ability to enact (...) intentions within concrete relationships and contexts. We then consider the impact of BCI technology on each of these abilities. Although on first glance, BCIs solely enhance self-determination because they restore or improve abilities, we will show that there are other positive, but also negative impacts on user autonomy, which require further philosophical and ethical discussions. (shrink)

L’analisi informatica di testi filosofici, la creazione di database, ipertesti o edizioni elettroniche non costituiscono più unicamente una ricerca di frontiera, ma sono da molti anni una risorsa preziosa per gli studi umanistici. Ora, non si tratta di richiedere alle macchine un ulteriore sforzo per comprendere il linguaggio umano, quanto piuttosto di perfezionare gli strumenti affinché esse possano essere a tutti gli effetti collaboratori di ricerca. Questo articolo è concepito come il resoconto di un esperimento finalizzato a documentare come le (...) associazioni lessicali di un gruppo selezionato di testi medievali possa offrire qualche suggerimento in merito ai loro contenuti teorici. Computer analysis of texts, creation of databases hypertexts and digital editions are not the final frontier of research anymore. Quite the contrary, from many years they have been representing a significant contribution to medieval studies. Therefore, we do not mean to make the computer able to grasp the meaning of human language and penetrate its secrets, but rather we aim at improving their tools, so that they will become an even more efficient equipment employed in research activities. This paper is thought as a sort of technical report with the proposed task to verify if an automatic identification of some word associations within a selected groups of medieval writings produces suggestions on the subject of the processed texts, able to be used in a theoretical inquiry. (shrink)

Comics are complex multimodal documents that make for intriguing materials to analyze with computer vision and computational linguistics. This review summarizes the growing developments in computational modeling which have been progressing to analyze visual narratives across their various substructures.

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)

Interest in the computational aspects of modeling has been steadily growing in philosophy of science. This paper aims to advance the discussion by articulating the way in which modeling and computational errors are related and by explaining the significance of error management strategies for the rational reconstruction of scientific practice. To this end, we first characterize the role and nature of modeling error in relation to a recipe for model construction known as Euler’s recipe. We then describe a general model (...) that allows us to assess the quality of numerical solutions in terms of measures of computational errors that are completely interpretable in terms of modeling error. Finally, we emphasize that this type of error analysis involves forms of perturbation analysis that go beyond the basic model-theoretical and statistical/probabilistic tools typically used to characterize the scientific method; this demands that we revise and complement our reconstructive toolbox in a way that can affect our normative image of science. (shrink)

We investigate the connections between computability theory and Nonstandard Analysis. In particular, we investigate the two following topics and show that they are intimately related. A basic property of Cantor space$2^ $ is Heine–Borel compactness: for any open covering of $2^ $, there is a finite subcovering. A natural question is: How hard is it to compute such a finite subcovering? We make this precise by analysing the complexity of so-called fan functionals that given any $G:2^ \to $, output (...) a finite sequence $\langle f_0, \ldots,f_n \rangle $ in $2^ $ such that the neighbourhoods defined from $\overline {f_i } G\left$ for $i \le n$ form a covering of $2^ $. A basic property of Cantor space in Nonstandard Analysis is Abraham Robinson’s nonstandard compactness, i.e., that every binary sequence is “infinitely close” to a standard binary sequence. We analyse the strength of this nonstandard compactness property of Cantor space, compared to the other axioms of Nonstandard Analysis and usual mathematics.Our study of yields exotic objects in computability theory, while leads to surprising results in Reverse Mathematics. We stress that and are highly intertwined, i.e., our study is holistic in nature in that results in computability theory yield results in Nonstandard Analysis and vice versa. (shrink)

This chapter will deal with an issue that is as much a problem for moral philosophy as it is for the computer world. My basic theme is that high technology, and computer technology in particular, raises ethical problems of a new sort that require considerable restructuring of our traditional ethical categories. It follows that our job as philosophers is not, as it is often thought to be, simply to apply ready-made categories to new situations; rather, it is to find new (...) categories, or new ways of interpreting old categories, in order to accommodate the challenges presented by new technologies. (shrink)

Three variants of Kurt Gödel's ontological argument, proposed by Dana Scott, C. Anthony Anderson and Melvin Fitting, are encoded and rigorously assessed on the computer. In contrast to Scott's version of Gödel's argument the two variants contributed by Anderson and Fitting avoid modal collapse. Although they appear quite different on a cursory reading they are in fact closely related. This has been revealed in the computer-supported formal analysis presented in this article. Key to our formal analysis is the (...) utilization of suitably adapted notions of ultrafilters, and a careful distinction between extensions and intensions of positive properties. (shrink)