Loading...
Please wait, while we are loading the content...
Similar Documents
L O ] 2 3 O ct 2 01 8 Saturated Models in Mathematical Fuzzy Logic *
| Content Provider | Semantic Scholar |
|---|---|
| Author | Badia, Guillermo |
| Copyright Year | 2018 |
| 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. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://export.arxiv.org/pdf/1810.09742 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
