11 found
Order:
  1. Logics of Formal Inconsistency Enriched with Replacement: An Algebraic and Modal Account.Walter Carnielli, Marcelo E. Coniglio & David Fuenmayor - 2022 - Review of Symbolic Logic 15 (3):771-806.
    One of the most expected properties of a logical system is that it can be algebraizable, in the sense that an algebraic counterpart of the deductive machinery could be found. Since the inception of da Costa's paraconsistent calculi, an algebraic equivalent for such systems have been searched. It is known that these systems are non self-extensional (i.e., they do not satisfy the replacement property). More than this, they are not algebraizable in the sense of Blok-Pigozzi. The same negative results hold (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  2.  61
    Formalisation and Evaluation of Alan Gewirth's Proof for the Principle of Generic Consistency in Isabelle/HOL.David Fuenmayor & Christoph Benzmüller - unknown
    An ambitious ethical theory ---Alan Gewirth's "Principle of Generic Consistency"--- is encoded and analysed in Isabelle/HOL. Gewirth's theory has stirred much attention in philosophy and ethics and has been proposed as a potential means to bound the impact of artificial general intelligence.
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  3.  23
    A Computational-Hermeneutic Approach for Conceptual Explicitation.Christoph Benzmüller & David Fuenmayor - 2019 - In Matthieu Fontaine, Cristina Barés-Gómez, Francisco Salguero-Lamillar, Lorenzo Magnani & Ángel Nepomuceno-Fernández (eds.), Model-Based Reasoning in Science and Technology: Inferential Models for Logic, Language, Cognition and Computation. Springer Verlag.
    We present a computer-supported approach for the logical analysis and conceptual explicitation of argumentative discourse. Computational hermeneutics harnesses recent progresses in automated reasoning for higher-order logics and aims at formalizing natural-language argumentative discourse using flexible combinations of expressive non-classical logics. In doing so, it allows us to render explicit the tacit conceptualizations implicit in argumentative discursive practices. Our approach operates on networks of structured arguments and is iterative and two-layered. At one layer we search for logically correct formalizations for each (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  4.  24
    Can Computers Help to Sharpen our Understanding of Ontological Arguments?Christoph Benzmüller & David Fuenmayor - 2018 - In Christoph Benzmüller & David Fuenmayor (eds.), Mathematics and Reality, Proceedings of the 11th All India Students' Conference on Science Spiritual Quest, 6-7 October, 2018, IIT Bhubaneswar, Bhubaneswar, India. The Bhaktivedanta Institute. pp. 195226.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  5. A Case Study on Computational Hermeneutics: E. J. Lowe’s Modal Ontological Argument.David Fuenmayor & Christoph Benzmueller - manuscript
    Computers may help us to better understand (not just verify) arguments. In this article we defend this claim by showcasing the application of a new, computer-assisted interpretive method to an exemplary natural-language ar- gument with strong ties to metaphysics and religion: E. J. Lowe’s modern variant of St. Anselm’s ontological argument for the existence of God. Our new method, which we call computational hermeneutics, has been particularly conceived for use in interactive-automated proof assistants. It aims at shedding light on the (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  6.  20
    Semantical investigations on non-classical logics with recovery operators: negation.David Fuenmayor - forthcoming - Logic Journal of the IGPL.
    We investigate mathematical structures that provide natural semantics for families of (quantified) non-classical logics featuring special unary connectives, known as recovery operators, that allow us to ‘recover’ the properties of classical logic in a controlled manner. These structures are known as topological Boolean algebras, which are Boolean algebras extended with additional operations subject to specific conditions of a topological nature. In this study, we focus on the paradigmatic case of negation. We demonstrate how these algebras are well-suited to provide a (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  7.  32
    Computer-supported Analysis of Positive Properties, Ultrafilters and Modal Collapse in Variants of Gödel's Ontological Argument.Christoph Benzmüller & David Fuenmayor - 2020 - Bulletin of the Section of Logic 49 (2).
    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 (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  8. Mathematics and Reality, Proceedings of the 11th All India Students' Conference on Science Spiritual Quest, 6-7 October, 2018, IIT Bhubaneswar, Bhubaneswar, India.Christoph Benzmüller & David Fuenmayor (eds.) - 2018 - The Bhaktivedanta Institute.
    No categories
     
    Export citation  
     
    Bookmark  
  9.  7
    Who Finds the Short Proof?Christoph Benzmüller, David Fuenmayor, Alexander Steen & Geoff Sutcliffe - forthcoming - Logic Journal of the IGPL.
    This paper reports on an exploration of Boolos’ Curious Inference, using higher-order automated theorem provers (ATPs). Surprisingly, only suitable shorthand notations had to be provided by hand for ATPs to find a short proof. The higher-order lemmas required for constructing a short proof are automatically discovered by the ATPs. Given the observations and suggestions in this paper, full proof automation of Boolos’ and related examples now seems to be within reach of higher-order ATPs.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  10.  27
    Automated Reasoning with Complex Ethical Theories--A Case Study Towards Responsible AI.David Fuenmayor & Christoph Benzmüller - unknown
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  11.  20
    Computational Hermeneutics: Using Computers to Interpret Philosophical Arguments.David Fuenmayor & Christoph Benzmüller - unknown
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark