• Login
    View Item 
    •   Scholarship Repository at Florida Tech
    • College of Engineering
    • Computer Sciences & Cybersecurity
    • Technical Reports
    • View Item
    •   Scholarship Repository at Florida Tech
    • College of Engineering
    • Computer Sciences & Cybersecurity
    • Technical Reports
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Completeness of propositional logic as a program (with code)

    Thumbnail
    View/Open
    Technical Report (104.2Kb)
    Date
    2001-10-04
    Author
    Stansifer, Ryan
    Metadata
    Show full item record
    Abstract
    The proof of completeness for propositional logic is a constructive one, so a computer program is suggested by the proof. We prove the completeness theorem for Łukasiewicz’ axioms directly, and translate the proof into the functional languages SML and Haskell. In this paper we consider this proof as a program. The program produces enormous proof trees, but it is, we contend, as good a proof of completeness as the standard mathematical proofs.The real value of the exercise is the further evidence it provides that typed, functional languages can clearly express the complex abstractions of mathematics.
    URI
    http://hdl.handle.net/11141/86
    Collections
    • Technical Reports

    DSpace software copyright © 2002-2015  DuraSpace
    Contact Us | Send Feedback
    Theme by 
    @mire NV
     

     

    Browse

    All of Scholarship RepositoryCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    LoginRegister

    Statistics

    Most Read ItemsStatistics by CountryMost Read Authors

    DSpace software copyright © 2002-2015  DuraSpace
    Contact Us | Send Feedback
    Theme by 
    @mire NV