Chain logic and Shelah’s Infinitary logic
نویسندگان
چکیده
For a cardinal of the form κ = בκ, Shelah’s logic L 1 has characterisation as maximal above $${ \cup _{\lambda < \kappa }}{L_{\lambda ,\omega }}$$ satisfying strengthening undefinability well-order. Karp’s chain [20] is known to satisfy well-order and interpolation. We prove that if singular countable cofinality, . Moreover, we show strong limit cardinals $$L_{ , }^c{ }}L_{\lambda ,\lambda }^c$$ with models version then gives partial solution Problem 1.4 from [28], which asked whether for cofinality there was strictly between $${L_{{\kappa ^ + },\omega },{\kappa }}}$$ having modulo accepting upper bound model class Lκ, κ, satisfies required properties. In addition, this not κ-compact, question have on various occasions. contribute further development by proving Union Lemma identifying chain-independent fragment logic, showing it still considerable expressive power. conclusion, shown simply defined emulates in interpolation, maximality respect it, Lemma. addition completeness theorem.
منابع مشابه
Supervenience and Infinitary Logic
The discussion of supervenience is replete with the use of infinitary logical operations. For instance, one may often find a supervenient property that corresponds to an infinite collection of supervenience-base properties, and then ask about the infinite disjunction of all those base properties. This is crucial to a well-known argument of Kim (1984) that supervenience comes nearer to reduction...
متن کاملStationary Sets and Infinitary Logic
Let K0 λ be the class of structures 〈λ,<,A〉, where A ⊆ λ is disjoint from a club, and let K1 λ be the class of structures 〈λ,<,A〉, where A ⊆ λ contains a club. We prove that if λ = λ is regular, then no sentence of Lλ+κ separates K 0 λ and K 1 λ. On the other hand, we prove that if λ = μ+, μ = μ, and a forcing axiom holds (and א1 = א1 if μ = א0), then there is a sentence of Lλλ which separates ...
متن کاملNon-Denumerable Infinitary Modal Logic
Segerberg established an analogue of the canonical model theorem in modal logic for infinitary modal logic. However, the logics studied by Segerberg and Goldblatt are based on denumerable sets of pairs 〈Γ, α〉 of sets Γ of well-formed formulae and well-formed formulae α. In this paper I show how a generalisation of the infinite cut-rule used by Segerberg and Goldblatt enables the removal of the ...
متن کاملInfinitary equilibrium logic and strongly equivalent logic programs
Strong equivalence is an important concept in the theory of answer set programming. Informally speaking, two sets of rules are strongly equivalent if they have the same meaning in any context. Equilibrium logic was used to prove that sets of rules expressed as propositional formulas are strongly equivalent if and only if they are equivalent in the logic of here-and-there. We extend this line of...
متن کاملHierarchies in Transitive Closure Logic, Stratified Datalog and Infinitary Logic
We establish a general hierarchy theorem for quantiier classes in the innnitary logic L ! 1! on nite structures. In particular, it is shown that no innnitary formula with bounded number of universal quantiiers can express the negation of a transitive closure. This implies the solution of several open problems in nite model theory: On nite structures, positive transitive closure logic is not clo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Israel Journal of Mathematics
سال: 2021
ISSN: ['1565-8511', '0021-2172']
DOI: https://doi.org/10.1007/s11856-021-2207-0