This paper is a contribution to graded model theory, in the context of mathematical fuzzy logic. We study characterizations of classes of graded structures in terms of the syntactic form of their first-order axiomatization. We focus on classes given by universal and universal-existential sentences. In particular, we prove two amalgamation results using the technique of diagrams in the setting of structures valued on a finite MTL-algebra, from which analogues of the Łoś–Tarski and the Chang–Łoś–Suszko preservation theorems follow.

In this paper, we will briefly look at the history of mathematical fuzzy logic in Czechoslovakia starting from the 1970s and extending until 2009. The role of P. Ha ́jek in the development of fuzzy logic is especially emphasized.

This paper aims at being a systematic investigation of different completeness properties of first-order predicate logics with truth-constants based on a large class of left-continuous t-norms . We consider standard semantics over the real unit interval but also we explore alternative semantics based on the rational unit interval and on finite chains. We prove that expansions with truth-constants are conservative and we study their real, rational and finite chain completeness properties. Particularly interesting is the case of considering canonical real and (...) rational semantics provided by the algebras where the truth-constants are interpreted as the numbers they actually name. Finally, we study completeness properties restricted to evaluated formulae of the kind , where φ has no additional truth-constants. (shrink)

Our work is a contribution to the model theory of fuzzy predicate logics. In this paper we characterize elementary equivalence between models of fuzzy predicate logic using elementary mappings. Refining the method of diagrams we give a solution to an open problem of Hájek and Cintula (J Symb Log 71(3):863–880, 2006, Conjectures 1 and 2). We investigate also the properties of elementary extensions in witnessed and quasi-witnessed theories, generalizing some results of Section 7 of Hájek and Cintula (J Symb Log (...) 71(3):863–880, 2006) and of Section 4 of Cerami and Esteva (Arch Math Log 50(5/6):625–641, 2011) to non-exhaustive models. (shrink)

The last decade has seen an enormous development in infinite-valued systems and in particular in such systems which have become known as mathematical fuzzy logics. The paper discusses the mathematical background for the interest in such systems of mathematical fuzzy logics, as well as the most important ones of them. It concentrates on the propositional cases, and mentions the first-order systems more superficially. The main ideas, however, become clear already in this restricted setting.

In Hájek et al. (J Symb Logic 65(2):669–682, 2000) the authors introduce the concept of supersound logic, proving that first-order Gödel logic enjoys this property, whilst first-order Łukasiewicz and product logics do not; in Hájek and Shepherdson (Ann Pure Appl Logic 109(1–2):65–69, 2001) this result is improved showing that, among the logics given by continuous t-norms, Gödel logic is the only one that is supersound. In this paper we will generalize the previous results. Two conditions will be presented: the first (...) one implies the supersoundness and the second one non-supersoundness. To develop these results we will use, between the other machineries, the techniques of completions of MTL-chains developed in Labuschagne and van Alten (Proceedings of the ninth international conference on intelligent technologies, 2008) and van Alten (2009). We list some of the main results. The first-order versions of MTL, SMTL, IMTL, WNM, NM, RDP are supersound; the first-order version of an axiomatic extension of BL is supersound if and only it is n-potent (i.e. it proves the formula ${\varphi^{n}\,\to\,\varphi^{n\,{+}\,1}}$ for some ${n\,\in\,\mathbb{N}^+}$ ). Concerning the negative results, we have that the first-order versions of ΠMTL, WCMTL and of each non-n-potent axiomatic extension of BL are not supersound. (shrink)

This paper deals with one kind of Kripke-style semantics, which we shall call algebraic Kripke-style semantics, for relevance logics. We first recall the logic R of relevant implication and some closely related systems, their corresponding algebraic structures, and algebraic completeness results. We provide simpler algebraic completeness proofs. We then introduce various types of algebraic Kripke-style semantics for these systems and connect them with algebraic semantics.

Structural completeness properties are investigated for a range of popular t-norm based fuzzy logics—including Łukasiewicz Logic, Gödel Logic, Product Logic, and Hájek's Basic Logic—and their fragments. General methods are defined and used to establish these properties or exhibit their failure, solving a number of open problems.

1. There are two distinct lines of research that aim at modelling belief and knowledge: modal logic and uncertainty theories. Modal logic extends classical logic by introducing knowledge or belief...

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 $\kappa $-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 $\kappa $-saturation in terms of the completion of a diagram representing a certain configuration of models and mappings. (shrink)

In this paper we investigate the connections between quantifier elimination, decidability and Uniform Craig Interpolation in Δ-core fuzzy logics added with propositional quantifiers. As a consequence, we are able to prove that several propositional fuzzy logics have a conservative extension which is a Δ-core fuzzy logic and has Uniform Craig Interpolation.

This paper presents an abstract study of completeness properties of non-classical logics with respect to matricial semantics. Given a class of reduced matrix models we define three completeness properties of increasing strength and characterize them in several useful ways. Some of these characterizations hold in absolute generality and others are for logics with generalized implication or disjunction connectives, as considered in the previous papers. Finally, we consider completeness with respect to matrices with a linear dense order and characterize it in (...) terms of an extension property and a syntactical metarule. This is the final part of the investigation started and developed in the papers :417–446, 2010; Arch Math Logic 53:353–372, 2016). (shrink)

This work presents a model-theoretic approach to the study of first-order theories of classes of BL-chains. Among other facts, we present several classes of BL-algebras, generating the whole variety of BL-algebras, whose first-order theory has quantifier elimination. Model-completeness and decision problems are also investigated. Then we investigate classes of BL-algebras having (or not having) the amalgamation property or the joint embedding property and we relate the above properties to the existence of ultrahomogeneous models.

In the field of many-valued logics, Hájek’s Basic Logic BL was introduced in Hájek (Metamathematics of fuzzy logic, trends in logic. Kluwer Academic Publishers, Berlin, 1998). In this paper we will study four families of n-contractive (i.e. that satisfy the axiom \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\phi^n\rightarrow\phi^{n+1}}$$\end{document}, for some \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${n\in\mathbb{N}^+}$$\end{document}) axiomatic extensions of BL and their corresponding varieties: BLn, SBLn, BLn and SBLn. Concerning BLn we have that (...) every BLn-chain is isomorphic to an ordinal sum of MV-chains of at most n + 1 elements, whilst every BLn-chain is isomorphic to an ordinal sum of MVn-chains (for SBLn and SBLn a similar property holds, with the difference that the first component must be the two elements boolean algebra); all these varieties are locally finite. Moving to the content of the paper, after a preliminary section, we will study generic and k-generic algebras, completeness and computational complexity results, amalgamation and interpolation properties. Finally, we will analyze the first-order versions of these logics, from the point of view of completeness and arithmetical complexity. (shrink)

In this paper we prove strong completeness of axiomatic extensions of first-order strict core fuzzy logics with the so-called quasi-witnessed axioms with respect to quasi-witnessed models. As a consequence we obtain strong completeness of Product Predicate Logic with respect to quasi-witnessed models, already proven by M.C. Laskowski and S. Malekpour in [19]. Finally we study similar problems for expansions with Δ, define Δ-quasi-witnessed axioms and prove that any axiomatic extension of a first-order strict core fuzzy logic, expanded with Δ, and (...) Δ-quasi-witnessed axioms are complete with respect to Δ-quasi-witnessed models. (shrink)

In 1950, B.A. Trakhtenbrot showed that the set of first-order tautologies associated to finite models is not recursively enumerable. In 1999, P. Hájek generalized this result to the first-order versions of Łukasiewicz, Gödel and Product logics, w.r.t. their standard algebras. In this paper we extend the analysis to the first-order versions of axiomatic extensions of MTL. Our main result is the following. Let \ be a class of MTL-chains. Then the set of all first-order tautologies associated to the finite models (...) over chains in \, fTAUT\, is \ -hard. Let TAUT\ be the set of propositional tautologies of \. If TAUT\ is decidable, we have that fTAUT\ is in \. We have similar results also if we expand the language with the Δ operator. (shrink)

We study the forcing operators on MTL-algebras, an algebraic notion inspired by the Kripke semantics of the monoidal t -norm based logic . At logical level, they provide the notion of the forcing value of an MTL-formula. We characterize the forcing operators in terms of some MTL-algebras morphisms. From this result we derive the equality of the forcing value and the truth value of an MTL-formula.

We present the logic BLChang, an axiomatic extension of BL (see [23]) whose corresponding algebras form the smallest variety containing all the ordinal sums of perfect MV-chains. We will analyze this logic and the corresponding algebraic semantics in the propositional and in the first-order case. As we will see, moreover, the variety of BLChang-algebras will be strictly connected to the one generated by Chang’s MV-algebra (that is, the variety generated by all the perfect MV-algebras): we will also give some new (...) results concerning these last structures and their logic. (shrink)