In 1969, Lindström proved his celebrated theorem characterizing first-order logic and established criteria for the first-order definability of formal theories for discrete structures. Barwise, Shelah, Väänänen, and others extended Lindström’s characterizability program to classes of infinitary logic systems, including a recent paper by Džamonja and Väänänen on Karp’s chain logic, which satisfies interpolation, undefinability of well-order, and is maximal in the class of logic systems with these …
Read moreIn 1969, Lindström proved his celebrated theorem characterizing first-order logic and established criteria for the first-order definability of formal theories for discrete structures. Barwise, Shelah, Väänänen, and others extended Lindström’s characterizability program to classes of infinitary logic systems, including a recent paper by Džamonja and Väänänen on Karp’s chain logic, which satisfies interpolation, undefinability of well-order, and is maximal in the class of logic systems with these properties. From the perspective of the article analysis, research on chain logic delivers a promising idea of chain models and a new definition of satisfiability, particularly for quantifier expressions. Our paper gives a framework for Lindström-type characterizability of predicate logic systems interpreted semantically in models with objects based on measures (analytic structures). In particular, Hájek’s logic of integrals (HLI) is redefined as an abstract logic with a new type of Hájek’s satisfiability and constitutes a maximal logic in the class of logic systems for describing analytic structures with Lebesgue integrals and satisfying compactness, elementary chain condition, and weak negation.