Hi Ramana, >Isn't MESON (without limits) complete?
I think it's complete for first order logic (although I'm not completely sure about whether it's complete for first order logic with equality). However, we're in a higher order logic here, right? So I guess it won't be complete for the HOL logic? >I think the only question is how long you would be willing >to wait for each proof, and possibly how much memory >you have. I think the difference between undecidable and infeasible is overrated :-) Freek ------------------------------------------------------------------------------ Live Security Virtual Conference Exclusive live event will cover all the ways today's security and threat landscape has changed and how IT managers can respond. Discussions will include endpoint security, mobile security and the latest in malware threats. http://www.accelacomm.com/jaw/sfrnl04242012/114/50122263/ _______________________________________________ hol-info mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/hol-info
