Lattice-valued representation of the cut-elimination theorem (Q1192582): 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.21099/tkbjm/1496161672 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W212831703 / rank | |||
Normal rank | |||
Latest revision as of 18:19, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lattice-valued representation of the cut-elimination theorem |
scientific article |
Statements
Lattice-valued representation of the cut-elimination theorem (English)
0 references
27 September 1992
0 references
Let \(L\) be a relatively pseudo-complemented complete lattice, \(F\) a set of formulas of a formal system (classical or intuitionistic). The author considers mappings \(m,M: F\to L\) satisfying a series of conditions. For such pairs of mappings he proves, as his main theorem: \(m(A)\leq M(B)\) for any provable sequent \(A\to B\). In the final section, he uses this result for a proof of the cut-elimination theorem.
0 references
relatively pseudo-complemented lattice
0 references
formal system
0 references
cut-elimination theorem
0 references
