-
Notifications
You must be signed in to change notification settings - Fork 4
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
feat(Normal Modal): Strength of Logics Part.1 #23
Merged
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
2 tasks
SnO2WMaN
commented
Feb 11, 2024
あまりにもコミットが積み上がったので一旦これでPRとしては完了したものとしてreadyにする.示したものは以下.
|
iehality
reviewed
Mar 21, 2024
rebaseして現行の修正分に合わせた. |
Logic/HilbertStyle.leanを削除しLogic/HilbertStyle2.leanはLogic/Deduction.leanに改名しました。また命題直感主義論理の証明体系を |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
TODO
Γ ⊢ᴹ[Λ]! p → Γ ⊨ᴹ[(𝔽(Λ) : FrameClass β)] p
(h : Λ₁ ⪯ᴸ Λ₂): Γ ⊨ᴹ[(𝔽(Λ₂) : FrameClass α)] p → Γ ⊨ᴹ[(𝔽(Λ₁) : FrameClass α)] p
Optional
Completeness
とLogic.FrameClassDefinability
の証明はAxiomSetに依らずほとんど同じなのでマクロなどを駆使して再利用できるようにしたい(さもなければmodal cubeの残りの論理に対して全く同じ証明を10個ほど書かなければならないため,コード量がただただかさむ)