OpenLogicProject / OpenLogicProject/OpenLogic
Proof of Consistency Expansion (First Order Logic - Completeness)
Nobody has claimed this yet.
- Dominant language
- TeX
- Stars
- 1.4k
- Forks
- 288
- PR merge metrics
- No merged PRs in 30d
Description
In content/first-order-logic/completeness/henkin-expansions.tex, there is a proposition:
If $\Gamma$ is consistent in $\Lang L$ and $\Lang L'$ is obtained from
$\Lang L$ by adding !!a{denumerable} set of new !!{constant}s $\Obj d_0$,
$\Obj d_1$, \dots, then $\Gamma$ is consistent in~$\Lang L'$.
which doesn't have a proof. I think it should, although perhaps it could be an exercise (doesn't seem like it should be a very involved proof though).
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
Open content/first-order-logic/completeness/henkin-expansions.tex and read the surrounding completeness material and the proposition about adding a denumerable set of constants. Determine whether the intended resolution is a proof or an exercise, then update the proposition accordingly and verify that the surrounding LaTeX remains consistent.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- latex
- Domain
- content, documentation
- Issue type
- Documentation
- Difficulty
- 3/5
- Estimated time
- 1-2 days
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 45/100