Logics and WP calculi: First-order logic, Second-order logic, Henkin semantics, Separation Logic
Nobody has claimed this yet.
- Dominant language
- Lean
- Stars
- 709
- Forks
- 200
- Avg merge
- 3d 6h
- Merged PRs (30d)
- 45
Description
This issue is to propose a working group for formalizing in Lean 4 the following topics:
- first-order logic over arbitrary (data) structures
- second-order logic and their interpretations (full, Henkin semantics)
- separation logic including novel connectives (G for finiteness of domain, @ for logical counter-part of virtual memory)
- weakest precondition/strongest postcondition calculi, Hoare's logic and Reynolds' logic
Currently I have a first experiment with using Claude and Lean, to speed up the development work. See also: https://codeberg.org/praalhans/seplogic
A community effort may allow us to have a formalization of the meta-theoretical results, that are useful later for certifying the implementation of proof checkers of various (program) logics.
Contributor guide
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Start by reviewing the existing Lean and Claude experiment linked at https://codeberg.org/praalhans/seplogic, then compare it with the four topic areas listed in the issue. The scope and deliverables are not yet defined; done would require an agreed working-group plan and a concrete formalization target.
Written by the indexing model from the issue text.
Assessment
- Domain
- devtools
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Quiet
- Clarity
- Needs clarification
- Newbie friendliness
- 20/100