Uninorm logic with the \(n\)-potency axiom (Q695273)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6117674
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Uninorm logic with the \(n\)-potency axiom |
scientific article; zbMATH DE number 6117674 |
Statements
Uninorm logic with the \(n\)-potency axiom (English)
0 references
20 December 2012
0 references
The paper deals with the extensions of Metcalfe and Montagna uninorm logic UL by means of the axiom of \(n\)-potency \(C_n := \varphi^n \leftrightarrow \varphi^{n-1}\). For each integer \(n \geq 2\), the resulting system is called \(C_n\mathrm{UL}\). The author proves standard completeness for every \(C_n\mathrm{UL}\) adapting the original method used by Jenei and Montagna to prove the analogous result for MTL, and introduces an analytic hypersequent calculus for each \(C_n\mathrm{UL}\).
0 references
uninorm-based logic
0 references
standard completeness
0 references
hypersequent calculus
0 references
residuated lattice
0 references
0 references
0.9107049107551576
0 references
0.8843672871589661
0 references
0.8230677247047424
0 references
0.8167285323143005
0 references
0.8061848878860474
0 references