Switch to: References

Citations of:

Church's type theory

Stanford Encyclopedia of Philosophy (2008)

Add citations

You must login to add citations.
  1. 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   1 citation  
  • Higher-Order Automated Theorem Provers.Benzmüller Christoph - 2015 - In David Delahaye & Bruno Woltzenlogel Paleo (eds.), All About Proofs, Proof for All. College Publications. pp. 171-214.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  • Foundations of applied mathematics I.Jeffrey Ketland - 2021 - Synthese 199 (1-2):4151-4193.
    This paper aims to study the foundations of applied mathematics, using a formalized base theory for applied mathematics: ZFCAσ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$ \mathsf {ZFCA}_{\sigma }$$\end{document} with atoms, where the subscript used refers to a signature specific to the application. Examples are given, illustrating the following five features of applied mathematics: comprehension principles, application conditionals, representation hypotheses, transfer principles and abstract equivalents.
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • Quantified Multimodal Logics in Simple Type Theory.Christoph Benzmüller & Lawrence C. Paulson - 2013 - Logica Universalis 7 (1):7-20.
    We present an embedding of quantified multimodal logics into simple type theory and prove its soundness and completeness. A correspondence between QKπ models for quantified multimodal logics and Henkin models is established and exploited. Our embedding supports the application of off-the-shelf higher-order theorem provers for reasoning within and about quantified multimodal logics. Moreover, it provides a starting point for further logic embeddings and their combinations in simple type theory.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  • Multimodal and intuitionistic logics in simple type theory.Christoph Benzmueller & Lawrence Paulson - 2010 - Logic Journal of the IGPL 18 (6):881-892.
    We study straightforward embeddings of propositional normal multimodal logic and propositional intuitionistic logic in simple type theory. The correctness of these embeddings is easily shown. We give examples to demonstrate that these embeddings provide an effective framework for computational investigations of various non-classical logics. We report some experiments using the higher-order automated theorem prover LEO-II.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  • Cut-Elimination for Quantified Conditional Logic.Christoph Benzmüller - 2017 - Journal of Philosophical Logic 46 (3):333-353.
    A semantic embedding of quantified conditional logic in classical higher-order logic is utilized for reducing cut-elimination in the former logic to existing results for the latter logic. The presented embedding approach is adaptable to a wide range of other logics, for many of which cut-elimination is still open. However, special attention has to be payed to cut-simulation, which may render cut-elimination as a pointless criterion.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  • Embedding and Automating Conditional Logics in Classical Higher-Order Logic.Christoph Benzmüller, Dov Gabbay, Valerio Genovese & Daniele Rispoli - 2012 - Annals of Mathematics and Artificial Intelligence 66 (1-4):257-271.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   4 citations