Kripke semantics, undecidability and standard completeness for Esteva and Godo's logic MTL\(\forall\) (Q1612691): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1023/a:1016500922708 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1496398693 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 10:06, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Kripke semantics, undecidability and standard completeness for Esteva and Godo's logic MTL\(\forall\) |
scientific article |
Statements
Kripke semantics, undecidability and standard completeness for Esteva and Godo's logic MTL\(\forall\) (English)
0 references
26 August 2002
0 references
The logic MTL\(\forall\) is the predicate version of the monoidal t-norm based logic MTL introduced by \textit{F. Esteva} and \textit{L. Godo} [Fuzzy Sets Syst. 124, 271-288 (2001; Zbl 0994.03017)]. The axioms of MTL\(\forall\) are those of the predicate version of the Full Lambek Calculus FL\(_{\text{ew}}\) (i.e. FL plus exchange and weakening) plus \((A \rightarrow B) \vee (B \rightarrow A)\) and \(\forall x(A \vee B) \rightarrow (A \vee \forall x B)\) (\(x\) not free in \(A\)) in a Hilbert-style axiomatization with modus ponens and generalization. Basically, Kripke structures for MTL are precisely the structures for FL\(_{\text{ew}}\) which are linearly ordered. In the case of MTL\(\forall\), not only the corresponding models are linearly ordered, but the domains are constant, i.e. they do not depend on the node of the model. The first result of the present paper is a proof of completeness of MTL\(\forall\) with respect to this Kripke semantics. Then two applications of the Kripke completeness are considered: the undecidability and the standard completeness of MTL\(\forall\).
0 references
many-valued logic
0 references
logics without contraction
0 references
Kripke semantics
0 references
left-continuous t-norms
0 references