Source: "This book addresses the fundamentals of machine ethics. It discusses abilities required for ethical machine reasoning and the programming features that enable them. It connects ethics, psychological ethical processes, and machine implemented procedures. From a technical point of view, the book uses logic programming and evolutionary game theory to model and link the individual and collective moral realms. It also reports on the results of experiments performed using several model implementations. Opening specific and promising inroads into the terra incognita (...) of machine ethics, the authors define here new tools and describe a variety of program-tested moral applications and implemented systems. In addition, they provide alternative readings paths, allowing readers to best focus on their specific interests and to explore the concepts at different levels of detail. Mainly written for researchers in cognitive science, artificial intelligence, robotics, philosophy of technology and engineering of ethics, the book will also be of general interest to other academics, undergraduates in search of research topics, science journalists as well as science and society forums, legislators and military organizations concerned with machine ethics.". (shrink)

The relation between ex falso and disjunctive syllogism, or even the justification of ex falso based on disjunctive syllogism, is an old topic in the history of logic. This old topic reappears in contemporary logic since the introduction of minimal logic by Johansson. The disjunctive syllogism seems to be part of our general non-problematic inferential practices and superficially it does not seem to be related to or to depend on our acceptance of the frequently disputable ex falso rule. We know (...) that the acceptance of the ex falso is a sufficient condition for the acceptance of the disjunctive syllogism, but the interesting question is: is the ex falso a necessary condition for the acceptance of the disjunctive syllogism? The aim of the present paper is to discuss some possible ways to define systems that combines the preservation of the disjunctive syllogism with the rejection of the ex falso. (shrink)

Much has been said about intuitionistic and classical logical systems since Gentzen’s seminal work. Recently, Prawitz and others have been discussing how to put together Gentzen’s systems for classical and intuitionistic logic in a single unified system. We call Prawitz’ proposal the Ecumenical System, following the terminology introduced by Pereira and Rodriguez. In this work we present an Ecumenical sequent calculus, as opposed to the original natural deduction version, and state some proof theoretical properties of the system. We reason that (...) sequent calculi are more amenable to extensive investigation using the tools of proof theory, such as cut-elimination and rule invertibility, hence allowing a full analysis of the notion of Ecumenical entailment. We then present some extensions of the Ecumenical sequent system and show that interesting systems arise when restricting such calculi to specific fragments. This approach of a unified system enabling both classical and intuitionistic features sheds some light not only on the logics themselves, but also on their semantical interpretations as well as on the proof theoretical properties that can arise from combining logical systems. (shrink)

In 2015 Dag Prawitz proposed an Ecumenical system where classical and intuitionistic logic could coexist in peace. The classical logician and the intuitionistic logician would share the universal quantifier, conjunction, negation and the constant for the absurd, but they would each have their own existential quantifier, disjunction and implication, with different meanings. Prawitz’ main idea is that these different meanings are given by a semantical framework that can be accepted by both parties. The aim of the present paper is [1] (...) to prove the normalization theorem for the propositional fragment NEp of Prawitz’ ecumenical system, and [2] to show that NEp is sound and complete with respect to a Kripke-style semantics for the language of NEp. (shrink)

Recent works about ecumenical systems, where connectives from classical and intuitionistic logics can co-exist in peace, warmed the discussion on proof systems for combining logics. This discussion has been extended to alethic modalities using Simpson’s meta-logical characterization: necessity is independent of the viewer, while possibility can be either intuitionistic or classical. In this work, we propose a pure, label free calculus for ecumenical modalities, nEK\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {nEK}$$\end{document}, where exactly one logical operator figures (...) in introduction rules and every basic object of the calculus can be read as a formula in the language of the ecumenical modal logic EK\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {EK}$$\end{document}. We prove that nEK\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {nEK}$$\end{document} is sound and complete w.r.t. the ecumenical birelational semantics and discuss fragments and extensions. (shrink)

The introduction and elimination rules for material implication in natural deduction are not complete with respect to the implicational fragment of classical logic. A natural way to complete the system is through the addition of a new natural deduction rule corresponding to Peirce's formula → A) → A). E. Zimmermann [6] has shown how to extend Prawitz' normalization strategy to Peirce's rule: applications of Peirce's rule can be restricted to atomic conclusions. The aim of the present paper is to extend (...) Seldin's normalization strategy to Peirce's rule by showing that every derivation Π in the implicational fragment can be transformed into a derivation Π' such that no application of Peirce's rule in Π' occurs above applications of →-introduction and →-elimination. As a corollary of Seldin's normalization strategy we obtain a form of Glivenko's theorem for the classical {→}-fragment. (shrink)

A common misconception among logicians is to think that intuitionism is necessarily tied-up with single conclusion calculi. Single conclusion calculi can be used to model intuitionism and they are convenient, but by no means are they necessary. This has been shown by such influential textbook authors as Kleene, Takeuti and Dummett, to cite only three. If single conclusions are not necessary, how do we guarantee that only intuitionistic derivations are allowed? Traditionally one insists on restrictions on particular rules: implication right, (...) negation right and universal quantification right are required to be single conclusion rules. In this note we show that instead of a cardinality restriction such as one-conclusion-only, we can use a notion of dependency between formulae to enforce the constructive character of derivations. The system we obtain, called FIL for full intuitionistic logic, satisfies basic properties such as soundness, completeness and cut elimination. We present two motivating applications of FIL and discuss some future work. (shrink)

We prove that a combinatorial consequence of the negation of the PCF conjecture for intervals, involving free subsets relative to set mappings, is not implied by even the strongest known large cardinal axiom.

In 2015 Dag Prawitz proposed a natural deduction ecumenical system, where classical logic and intuitionistic logic are codified in the same system. In his ecumenical system, Prawitz recovers the harmony of rules, but the rules for the classical operators do not satisfy separability. In fact, the classical rules are not pure, in the sense that negation is used in the definition of the introduction and elimination rules for the classical operators. In this work we propose an ecumenical system adapting, to (...) the natural deduction framework, Girard’s mechanism of stoup. This allows for the definition of a pure harmonic natural deduction system for the propositional fragment of Prawitz’s ecumenical logic. We conclude by presenting an extension proposal to the first-order setting and a different approach to purity based on some ideas proposed by Julien Murzi. (shrink)

RESUMO Na "Kritik der praktischen Vernunft", os conceitos do factum da razão e do sentimento de respeito pela lei moral geram grandes divergências interpretativas. O presente artigo tem como objetivo apresentar as interpretações de Zeljko Loparic, Guido Antônio de Almeida e Flávia Carvalho Chagas. ABSTRACT In "Kritik der praktischen Vernunft", the concepts of factum of reason and of feeling of respect for the moral law generate great interpretative divergences. This paper aims to present the interpretations of Zeljko Loparic, Guido Antônio (...) de Almeida and Flávia Carvalho Chagas. (shrink)

Epistemic naturalism holds that the results or methodologies from the cognitive sciences are relevant to epistemology, and some have maintained that scientific methods are more compatible with externalist theories of justification than with internalist theories. But practically all discussions about naturalized epistemology are framed exclusively in terms of cognitive psychology, which is only one of the cognitive sciences. The question addressed in this essay is whether a commitment to naturalism really does favor externalism over internalism, and we offer reasons for (...) thinking that naturalism in epistemology is compatible with both internalist and externalist conceptions of justification. We also argue that there are some distinctively internalist aims that are currently being studied scientifically and these notions, and others, should be studied by scientific methods. (shrink)

In this paper we show the embedding of Hybrid Probabilistic Logic Programs into the rather general framework of Residuated Logic Programs, where the main results of (definite) logic programming are validly extrapolated, namely the extension of the immediate consequences operator of van Emden and Kowalski. The importance of this result is that for the first time a framework encompassing several quite distinct logic programming semantics is described, namely Generalized Annotated Logic Programs, Fuzzy Logic Programming, Hybrid Probabilistic Logic Programs, and Possibilistic (...) Logic Programming. Moreover, the embedding provides a more general semantical structure paving the way for defining paraconsistent probabilistic reasoning with a logic programming semantics. (shrink)

This paper deals with the recent Swedish proposals of a Intuitionistic notion of Truth, by Dag Prawitz and Per Martin-Löf.

A lógica não contém teoremas puramente existenciais: as únicas sentenças existenciaisválidas são aquelas com análogas universais válidas. Aqui, mostramos que istorealmente é assim quando corretamente interpretado: toda validade ex- istencial possuiuma análoga universal simples, que também é válida. Também caracterizamos validadesuniversais e existenciais em termos de tautologias.

In this article, we intend to show how Habermas's intellectual project began to take shape since its first book. In this work sharp differences already appear in relation to the first generation of Critical Theory, especially when it comes to the diagnosis of late capitalism. Thus, we hope to recover the importance of the work and the subject to the understanding of the theoretical trajectory of the author. Moreover, at this point Habermas still maintains a posture of radical critique of (...) the capitalist order, which will be clearly reviewed in the works of maturity, particularly from the 80s. (shrink)

In this paper we show the embedding of Hybrid Probabilistic Logic Programs into the rather general framework of Residuated Logic Programs, where the main results of (definite) logic programming are validly extrapolated, namely the extension of the immediate consequences operator of van Emden and Kowalski. The importance of this result is that for the first time a framework encompassing several quite distinct logic programming semantics is described, namely Generalized Annotated Logic Programs, Fuzzy Logic Programming, Hybrid Probabilistic Logic Programs, and Possibilistic (...) Logic Programming. Moreover, the embedding provides a more general semantical structure paving the way for defining paraconsistent probabilistic reasoning with a logic programming semantics. (shrink)

Proceedings of the Tenth Brazilian Conference on Mathematical Logic. Coleção CLE, volume 14, 1995. Centro De Lógica, Epistemologia e História da Ciência, Unicamp, Campinas, SP, Brazil.

Pensar a técnica e a tecnologia com Álvaro Vieira Pinto: contribuições para o ensino da filosofia no ensino médio profissional Resumo: Este artigo apresenta uma análise do processo de fabricação dos conceitos relacionados à técnica e à tecnologia na obra “O conceito de Tecnologia” (Vol. 1) de Álvaro Vieira Pinto. Primeiramente aborda-se os conceitos de máquina e de técnica e o modo como esses conceitos se conectam com o problema do “desenvolvimento” nacional. Em seguida explora-se o problema da ideologização da (...) noção de “era tecnológica” e a relação do conceito de tecnologia com a ideologia dominante. Por fim a partir da metodologia do ensino de filosofia por problemas, propõe caminhos possíveis para a introdução do ensino da filosofia da técnica e da filosofia da tecnologia no ensino médio profissional. Palavras-chave: Álvaro Vieira Pinto; Filosofia da Tecnologia; Ensino Médio Profissional; Filosofia Brasileira. Thinking about technique and technology with Álvaro Vieira Pinto: contributions to the teaching of philosophy in Technical High School Abstract: This paper analyzes the conceptualization of techcnique and technology in the book “The Concept of Technology” (Vol.1) of Álvaro Vieira Pinto. The first section focus on the concepts of machine and technique and the connections with the “national developlment problem” in Vieira Pinto work. Then the text explores the ideological treatment of the concept of “Technological Era” and the relationship between technology and dominant ideology. In the end, guided by the methodology of teaching philosophy through problems, the last section proposes some paths to introduce the philosophy of technique and techonology in the practice of teaching Philosophy in the Technical High School. Key-words: Álvaro Vieira Pinto; Philosophy of Technology; Technical High School; Brazilian Philosophy. Penser la technique et la technologie avec Álvaro Vieira Pinto : contributions à l'enseignement de la philosophie dans l'enseignement technique secondaire Résumé: Cet article présente une analyse de les méthodes de fabrication de concepts liés à la technique et à la technologie dans l'ouvrage « Le concept de la Technologie » (Vol. 1) d'Álvaro Vieira Pinto. D’abord, les concepts de machine et de technique sont discutés, ainsi que la manière dont ces concepts sont liés au problème du « développement national». Ensuite, les problèmes de l'idéologisation de la notion d'« âge technologique » et de la relation du concept de technologie avec l'idéologie dominante sont explorés. Enfin, à partir de la méthodologie de l'enseignement de la philosophie par problèmes, on propose des pistes possibles pour introduire la philosophie de la technique et la philosophie de la technologie dans l'enseignement secondaire technique. Mots-clés: Álvaro Vieira Pinto; Philosophie de la Technologie; Enseignement Secondaire Technique; Philosophie Brésilienne. Data de registro: 13/10/2021 Data de aceite: 15/03/2022. (shrink)

Los constantes cambios que sacuden el mundo actual han hecho entrar en una situación organizacional de ruptura paradigmática; hoy los viejos lenguajes son insuficientes para llegar a ser éticos, sensitivos y rentables en el día a día. Las organizaciones que aprenden, concebidas como sistemas complejos, deben ser autoconscientes y estar en proceso de construcción y deconstrucción permanente que posibiliten el desarrollo de valores para un ambiente de trabajo dinámico y potenciador. Se propone el concepto de “fárbices caórdicas” como elemento esencial (...) de un conjunto que resulta parte indeclinable de la composición de otros elementos que coinciden en resonancia sinérgica, en un todo llamado globalización. (shrink)

This essay proposes a review of the conceptual basis of the Complex Paradigm o Complex Thought. It reviews its core assumptions and give examples in the social sciences.

In 1930, Johann von Neumann, together with Rudolf Carnap and Arend Heyting, participated in a conference held in Königsberg, called “Second Seminar on the Epistemology of Exact Sciences”. The idea behind the reunion of these three researchers was to compose a fairly faithful picture of the three main foundational programs of mathematics at the time: formalism, logicism, and intuitionism. The main objective of this paper is to propose an analysis of the text “The Formalist Foundation of Mathematics” presented by von (...) Neumann in this conference. We show how, from von Neumann's perspective, the problem of the consistency of mathematical theories results from the transformation of a genuinely philosophical question into a genuinely logical-mathematical question and how a proof of consistency could be seen as the solution to the foundational problem. In the final part of the text, we present some considerations about Gerhard Gentzen’s consistency proofs and their importance to contemporary proof theory. (shrink)

Psychological experiments have shown that humans do not reason according to classical logic. Therefore, we might argue that logic-based approaches in general are not suitable for modeling human reasoning. Yet, we take a different view and are convinced that logic can help us as an underlying formalization of a cognitive theory, but claim rather that classical logic is not adequate for this purpose. In this chapter we investigate abduction and its link to human reasoning. In particular we discuss three different (...) variations we have explored and show how they can be adequately modeled within a novel computational and integrated, cognitive theory, the Weak Completion Semantics. (shrink)

This paper is a continuation of dag-like proof compression research initiated in [9]. We investigate proof compression phenomenon in a particular, most transparent case of propositional DNF Logic. We define and analyze a very efficient semi-analytic sequent calculus SEQ*0 for propositional DNF. The efficiency is achieved by adding two special rules CQ and CS; the latter rule is a variant of the weakened substitution rule WS from [9], while the former one being specially designed for DNF sequents. We show that (...) dag-like SEQ*0 has good deterministic proof search strategy. Furthermore, we expose six examples showing that dag-like deducibility in SEQ*0 admits exponential-size proof compression, as compared to familiar proof systems like cutfree sequent calculi, resolution and cutting plane proof systems. (shrink)

A PROTEÇÃO DOS DIREITOS HUMANOS NO CONTINENTE EUROPEU: BREVES APONTAMENTOS.

Sambin [6] proved the normalization theorem for GL, the modal logic of provability, in a sequent calculus version called by him GLS. His proof does not take into account the concept of reduction, commonly used in normalization proofs. Bellini [1], on the other hand, gave a normalization proof for GL using reductions. Indeed, Sambin's proof is a decision procedure which builds cut-free proofs. In this work we formalize this procedure as a recursive function and prove its recursiveness in an arithmetically (...) formalizable way, concluding that the normalization of GL can be formalized in PA. MSC: 03F05, 03B35, 03B45. (shrink)

Sambin [6] proved the normalization theorem for GL, the modal logic of provability, in a sequent calculus version called by him GLS. His proof does not take into account the concept of reduction, commonly used in normalization proofs. Bellini [1], on the other hand, gave a normalization proof for GL using reductions. Indeed, Sambin's proof is a decision procedure which builds cut-free proofs. In this work we formalize this procedure as a recursive function and prove its recursiveness in an arithmetically (...) formalizable way, concluding that the normalization of GL can be formalized in PA. MSC: 03F05, 03B35, 03B45. (shrink)

ABSTRACT One major problem in the process of knowledge assimilation is how to deal with inconsistency of new knowledge and the existing knowledge base. In this paper we present a formal, provably correct and yet computational methodology for assimilation of new knowledge into knowledge bases about actions and changes based on the slogan: what is believed is what is explained. Technically, we employ Gelfond and Lifschitz' action description language A to describe domains of actions. The knowledge bases on domains of (...) actions are defined and obtained by a new translation from domain descriptions in A into abductive normal logic programs, where a time dimension is incorporated. The knowledge bases are shown to be both sound and complete with respect to their domain descriptions. In particular, we propose a possible causes approach (PCA) to knowledge assimilation about evolving domains of actions, in contrast to Ginsberg's possible worlds approach (PWA) and Winslett's possible models approach (PMA). A possible cause of new knowledge consists of abduced occurrences of actions and value propositions about the initial state of the domain of actions, that would allow to derive the new knowledge. We show how to compute possible causes with abductive logic programming, and present some techniques to improve search efficiency. We use examples to compare our possible causes approach with syntax-based approaches, such as Ginsberg's possible worlds approach, and semantics-based approaches, such as Winslett's possible models approach, to belief revision/update. (shrink)

These are the proceedings of the First International Conference on Compu- tional Logic (CL 2000) which was held at Imperial College in London from 24th to 28th July, 2000. The theme of the conference covered all aspects of the theory, implementation, and application of computational logic, where computational logic is to be understood broadly as the use of logic in computer science. The conference was collocated with the following events: { 6th International Conference on Rules and Objects in Databases (DOOD (...) 2000) { 10th International Workshop on Logic-based Program Synthesis and Tra- formation (LOPSTR 2000) { 10th International Conference on Inductive Logic Programming (ILP 2000). CL 2000 consisted of seven streams: { Program Development (LOPSTR 2000) { Logic Programming: Theory and Extensions { Constraints { Automated Deduction: Putting Theory into Practice { Knowledge Representation and Non-monotonic Reasoning { Database Systems (DOOD 2000) { Logic Programming: Implementations and Applications. The LOPSTR 2000 workshop constituted the program development stream and the DOOD 2000 conference constituted the database systems stream. Each stream had its own chair and program committee, which autonomously selected the papers in the area of the stream. Overall, 176 papers were submitted, of which 86 were selected to be presented at the conference and appear in these proceedings. The acceptance rate was uniform across the streams. In addition, LOPSTR 2000 accepted about 15 extended abstracts to be presented at the conference in the program development stream. (shrink)

Coletânea de artigos em homenagem a Guido Antonio de Almeida e Raul Ferreira Landim Filho.