A proof-search procedure for intuitionistic propositional logic (Q377482): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00153-013-0342-y / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2023242314 / rank | |||
Normal rank | |||
Revision as of 23:57, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A proof-search procedure for intuitionistic propositional logic |
scientific article |
Statements
A proof-search procedure for intuitionistic propositional logic (English)
0 references
6 November 2013
0 references
The author presents a sequent-root proof-search procedure for intuitionistic propositional logic, essentially based on Glivenko's theorem (see [\textit{V. Glivenko}, Bull. Cl. Sci., V. Sér., Acad. R. Belg. 15, 183--188 (1929; JFM 55.0030.05)]). It is shown that, in the context of modified intuitionistic multi-succedent and classical sequent calculi, both belonging to the family of the contraction-free Kleene's G3-style calculi (see [\textit{S. C. Kleene}, Introduction to metamathematics. Amsterdam: North-Holland Publishing Co (1952; Zbl 0047.00703)]), a sequent is provable iff the corresponding prefixed-sequent is derivable in the procedure.
0 references
propositional intuitionistic logic
0 references
sequent calculus
0 references
Glivenko's theorem
0 references
