Saturated models of first-order many-valued logics

DOI10.1093/JIGPAL/JZAA027MaRDI QIDQ5066796zbMATH OpenOpenAlexFDO

Authors Guillermo Badia, Carles Noguera

Publication date 30 March 2022

Published in Logic Journal of the IGPL (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1810.09742

zbMATH Keywords

elementary chainsfirst-order graded logicslogic ULmathematical fuzzy logicresiduated latticessaturated modelstypesuninorms

Mathematics Subject Classification ID

Many-valued logic (03B50) Fuzzy logic; logic of vagueness (03B52) Models with special properties (saturated, rigid, etc.) (03C50)

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.

Recommendations

• A note on saturated models for many-valued logics
• Saturated models in institutions
• Systematization of finite many-valued logics through the method of tableaux
• Saturated models
• scientific article; zbMATH DE number 3902636

Cited in

(3)

• A note on saturated models for many-valued logics
• Saturated models
• Saturated models in institutions

This page was built for publication: Saturated models of first-order many-valued logics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5066796)