OpenLogicProject / OpenLogicProject/OpenLogic
Provability in PA
Nobody has claimed this yet.
- Dominant language
- TeX
- Stars
- 1.4k
- Forks
- 288
- PR merge metrics
- No merged PRs in 30d
Description
There should be a discussion of what PA can prove (esp that Q can't). It'd be independently interesting & important to see how applying the induction schema works, but various facts are also stated without proof in model-theory/models-of-arithmetic/models-of-PA
Contributor guide
No contributing guide indexed for this repository
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 reading model-theory/models-of-arithmetic/models-of-PA, especially the claims about what PA and Q can prove. Trace how the induction schema is currently presented, then add the requested discussion and proofs; the work is done when the relevant facts are justified in that section.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- tex
- Domain
- documentation
- Issue type
- Documentation
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 35/100