11 found
Order:
Disambiguations
Lawrence C. Paulson [10]Lawrence Paulson [3]Lex Paulson [2]L. Paulson [1]
  1.  26
    The Higher-Order Prover LEO-II.Christoph Benzmüller, Nik Sultana, Lawrence C. Paulson & Frank Theiß - 2015 - Journal of Automated Reasoning 55 (4):389-404.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   7 citations  
  2. 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  
  3.  14
    A formalised theorem in the partition calculus.Lawrence C. Paulson - 2024 - Annals of Pure and Applied Logic 175 (1):103246.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  4.  43
    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  
  5.  28
    Logic and computation: interactive proof with Cambridge LCF.Lawrence C. Paulson - 1987 - New York: Cambridge University Press.
    Logic and Computation is concerned with techniques for formal theorem-proving, with particular reference to Cambridge LCF (Logic for Computable Functions). Cambridge LCF is a computer program for reasoning about computation. It combines methods of mathematical logic with domain theory, the basis of the denotational approach to specifying the meaning of statements in a programming language. This book consists of two parts. Part I outlines the mathematical preliminaries: elementary logic and domain theory. They are explained at an intuitive level, giving references (...)
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  6.  20
    A machine-assisted proof of gödel’s incompleteness theorems for the theory of hereditarily finite sets.Lawrence C. Paulson - 2014 - Review of Symbolic Logic 7 (3):484-498.
  7.  38
    Ackermann’s function in iterative form: A proof assistant experiment.Lawrence C. Paulson - 2021 - Bulletin of Symbolic Logic 27 (4):426-435.
    Ackermann’s function can be expressed using an iterative algorithm, which essentially takes the form of a term rewriting system. Although the termination of this algorithm is far from obvious, its equivalence to the traditional recursive formulation—and therefore its totality—has a simple proof in Isabelle/HOL. This is a small example of formalising mathematics using a proof assistant, with a focus on the treatment of difficult recursions.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  8.  9
    The Routledge handbook of collective intelligence for democracy and governance.Stephen Boucher, Carina Antonia Hallin & Lex Paulson (eds.) - 2023 - New York: Routledge.
    The Routledge Handbook of Collective Intelligence for Democracy and Governance explores the concepts, methodologies, and implications of collective intelligence for democratic governance, in the first comprehensive survey of this field. Illustrated by a collection of inspiring case studies and edited by three pioneers in collective intelligence, this handbook serves as a unique primer on the science of collective intelligence applied to public challenges and will inspire public actors, academics, students, and activists across the world to apply collective intelligence in policymaking (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  9.  32
    Lightweight relevance filtering for machine-generated resolution problems.Jia Meng & Lawrence C. Paulson - 2009 - Journal of Applied Logic 7 (1):41-57.
  10.  10
    Cicero and the People’s Will: Philosophy and Power at the End of the Roman Republic.Lex Paulson - 2022 - Cambridge, United Kingdom ; New York, NY: Cambridge University Press.
    This book tells an overlooked story in the history of the will, a contested idea in both politics and philosophy of mind. For it is Cicero, statesman and philosopher, who gives shape to the notion of will as it would become in Western thought and who invents the idea of 'the will of the people'. In a single word – voluntas – he brings Roman law in contact with Greek ideas, chief among them Plato's claim that a rational elite must (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  11.  15
    LEO-II and Satallax on the Sledgehammer test bench.Nik Sultana, Jasmin Christian Blanchette & Lawrence C. Paulson - 2013 - Journal of Applied Logic 11 (1):91-102.