Show simple item record

dc.contributor.advisorStansifer, Ryan
dc.contributor.authorStansifer, Ryan
dc.date.accessioned2013-10-16T17:13:14Z
dc.date.available2013-10-16T17:13:14Z
dc.date.issued2001-10-04
dc.identifier.citationStansifer, R., (2001). Completeness of propositional logic as a program (CS-2001-1). Melbourne, FL. Florida Institute of Technology.en_US
dc.identifier.othercs-2001-1
dc.identifier.urihttp://hdl.handle.net/11141/86
dc.description.abstractThe 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.en_US
dc.language.isoen_USen_US
dc.rightsCopyright held by author.en_US
dc.titleCompleteness of propositional logic as a program (with code)en_US
dc.typeTechnical Reporten_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record