Hi, my name is Ezequiel. I am an advanced CS student from Argentina (Universidad Nacional de Rosario), I am also a TA there.I have a fairly good knowledge in math and logic, Ubuntu user since 2008. This would be my first open source project. I never used Sage before, but I would like to know if you are interested in extending the symbolic logic module.I would like to work on implementing First Order Logic but I don't know if the project it is big enough for GSoC and also don't know what would you like me to implement.I implemented Robinson's resolution method [1] with a friend in Haskell https://github.com/EzequielPostan/FOLATP . I enjoyed working on that project and I would like to work in related kind of implementations. I was thinking about implementing the first order logic parser, manipulations like convertion to normal forms (Skolem, Prenex, Horn), find unifiers of a pair of expresions, substitutions. Maybe a resolution method for propositional and/or first order logic. It would be nice to see a proof tree at least for the propositional logic and not just a truth table.I would like your opinion about the proposal Regards Ezequiel [1] http://en.wikipedia.org/wiki/Resolution_(logic)
-- You received this message because you are subscribed to the Google Groups "sage-gsoc" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at http://groups.google.com/group/sage-gsoc. For more options, visit https://groups.google.com/groups/opt_out.
