activity
20022026
most citedGeneralized quantifiers in Dependence Logic

29 citations · 60 across the 6 of their papers we have counts for

collaborators

9 papers

math.LO2026

Generalized Quantifiers: Scope Dominance and Branching

Fredrik Engström

Let and be proper upward monotone unary generalized quantifiers on a fixed domain . We study the validity, over all structures with domain , of \[ M \models Px\,Q…

math.LO2026

Intuitionistic Implication in Elementary Team Logics

Fredrik Engström, Juha Kontinen

The logic FOT is a team-based logic whose expressive power coincides with first-order logic at the level of both sentences and open formulas. In contrast to dependence and independ…

math.LO2014★ 1 cited

Implicitly definable generalized quantifiers

Fredrik Engström

We give a new elementary proof of the main theorem of [Fef12]: Quantifiers implicitly definable in pure second-order logic equipped with Henkin semantics implies are (explicitly) d…

math.LO2013★ 27 cited

Invariance and definability, with and without equality

Denis Bonnay, Fredrik Engström

The dual character of invariance under transformations and definability by some operations has been used in classical work by for example Galois and Klein. Following Tarski, philos…

math.LO2012★ 2 cited

Characterizing Quantifier Extensions of Dependence Logic

Fredrik Engström, Juha Kontinen

We characterize the expressive power of extensions of Dependence Logic and Independence Logic by monotone generalized quantifiers in terms of quantifier extensions of existential s…

math.LO2011★ 29 cited

Generalized quantifiers in Dependence Logic

Fredrik Engström

We introduce generalized quantifiers, as defined in Tarskian semantics by Mostowski and Lindström, in logics whose semantics is based on teams instead of assignments, e.g., IF-logi…