Lecture

LISA proof assistant: Formalisation and Verification

Description

This lecture introduces the LISA proof assistant, focusing on its codebase organization, the kernel package containing trusted code for theorem production and proof verification, the FOL package for First Order Logic formalization, and the proof package built on top of FOL for defining sequents, proof steps, and theorems.

Instructor

ad est

Aliqua quis dolor mollit esse consectetur magna sunt tempor exercitation velit. Adipisicing enim minim et ullamco sit qui qui commodo culpa culpa aliquip ullamco consectetur tempor. Quis dolor commodo do ullamco. Et incididunt deserunt eiusmod consequat occaecat qui culpa.

Official source

https://mediaspace.epfl.ch/media/0_euwptenz

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Ontological neighbourhood

Logic

Classical logic: First-order logic

Mathematics

Mathematical logic: Set theory

Related lectures (29)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.