Hacktoberfest 2026: the issues maintainers tagged for October, open and beginner-friendly. Browse Hacktoberfest issues

Provability in PA

Open
  • Is something wrong?
#128 0 comments 0 reactions 0 assignees View on GitHub

Nobody has claimed this yet.

Assessment

Difficulty
4/5
Estimated time
3-5 days
Newbie friendliness
35/100
Issue type
Documentation
Clarity
Mostly clear
Activity status
Stale
Tech stack
tex
Domain
documentation

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.

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

Dominant language
TeX
Stars
1.4k
Forks
289
No merged PRs in 30d

Getting set up

This project ships no dev container, Dockerfile or contributing guide, so setting up is up to you: start from its README, and see our first-contribution guide for the general steps.

First steps

  1. Read the whole issue, then the project's contributing guide.
  2. Comment on the issue to say you are picking it up — it saves two people doing the same work.
  3. Fork the repository and make your change on a branch.
  4. Open a pull request that references the issue number.

More from OpenLogicProject/OpenLogic

All issues in OpenLogicProject/OpenLogic

Similar issues

More Documentation issues

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.