01673nlm0 22004691i 450 9900092614104033219783642033599000926141FED01000926141(Aleph)000926141FED0100092614120100926d2009----km-y0itay50------baengDEdrnn-008mamaaTheorem Proving in Higher Order LogicsRisorsa elettronica22nd International Conference, TPHOLs 2009, Munich, Germany, August 17-20, 2009. Proceedingsedited by Stefan Berghofer, Tobias Nipkow, Christian Urban, Makarius WenzelBerlin ; HeidelbergSpringer2009Lecture Notes in Computer Science0302-97435674Documento elettronicoTestoFormato html, pdfBerghofer,StefanNipkow,TobiasUrban,ChristianWenzel,MakariusITUNINAREICATUNIMARCFull text per gli utenti Federico IIhttp://dx.doi.org/10.1007/978-3-642-03359-9EB990009261410403321Algorithm Analysis and Problem ComplexityComputational complexityComputer scienceComputer ScienceComputer softwareDiscrete Mathematics in Computer ScienceLogic designLogics and Meanings of ProgramsMathematical Logic and Formal LanguagesMathematics of ComputingModels and PrinciplesTheorem Proving in Higher Order Logics772309UNINA