Name
Abstract | ||
|---|---|---|
This paper considers the problem of building saturated models for first-order graded logics. We define types as pairs of sets of formulas in one free variable which express properties that an element is expected, respectively, to satisfy and to falsify. We show, by means of an elementary chains construction, that each model can be elementarily extended to a saturated model where as many types as possible are realized. In order to prove this theorem we obtain, as by-products, some results on tableaux (understood as pairs of sets of formulas) and their consistency and satisfiability, and a generalization of the Tarski--Vaught theorem on unions of elementary chains. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/ISMVL.2018.00034 | 2018 IEEE 48th International Symposium on Multiple-Valued Logic (ISMVL) |
Keywords | Field | DocType |
mathematical fuzzy logic,first order graded logics,uninorms,residuated lattices,logic UL,types,saturated models,elementary chains | Saturated model,Discrete mathematics,Lattice (order),Algebra,Computer science,Fuzzy logic,Satisfiability,Semantics | Conference |
ISSN | ISBN | Citations |
0195-623X | 978-1-5386-4465-2 | 1 |
PageRank | References | Authors |
0.37 | 3 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| guillermo badia | 1 | 5 | 5.53 |
| Carles Noguera | 2 | 462 | 33.93 |