Saturated models of first-order many-valued logics
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985556%3A_____%2F22%3A00537231" target="_blank" >RIV/67985556:_____/22:00537231 - isvavai.cz</a>
Result on the web
<a href="https://academic.oup.com/jigpal/article-abstract/30/1/1/5879257?redirectedFrom=fulltext" target="_blank" >https://academic.oup.com/jigpal/article-abstract/30/1/1/5879257?redirectedFrom=fulltext</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1093/jigpal/jzaa027" target="_blank" >10.1093/jigpal/jzaa027</a>
Alternative languages
Result language
angličtina
Original language name
Saturated models of first-order many-valued logics
Original language description
This paper is devoted to the problem of existence of saturated models for first-order many-valued logics. We consider a general notion of type as pairs of sets of formulas in one free variable that express properties that an element of a model should, respectively, satisfy and falsify. By means of an elementary chains construction, we prove that each model can be elementarily extended to a κ-saturated model, i.e. a 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. Finally, we provide a structural characterization of κ-saturation in terms of the completion of a diagram representing a certain configuration of models and mappings.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10102 - Applied mathematics
Result continuities
Project
<a href="/en/project/GA17-04630S" target="_blank" >GA17-04630S: Predicate graded logics and their applications to computer science</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2022
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Logic Journal of the IGPL
ISSN
1367-0751
e-ISSN
1368-9894
Volume of the periodical
30
Issue of the periodical within the volume
1
Country of publishing house
GB - UNITED KINGDOM
Number of pages
22
Pages from-to
1-20
UT code for WoS article
000744508900001
EID of the result in the Scopus database
2-s2.0-85050989071