The paper gives a survey of known results related to computational devices (finite and pushâ€“down automata) recognizing monadic generalized quantifiers in finite models. Some of these results areâ€¦ (More)

We consider first order modal logic C firstly defined by Carnap in Meaning and Necessity [1]. We prove elimination of nested modalities for this logic, which gives additionally Skolemâ€“LÃ¶wenheimâ€¦ (More)

In this technical appendix we provide proof techniques and proofs of the representation theorems from [KalociÅ„ski et al., 2018]. In general, the idea behind our proofs is easy. Hopefully, thisâ€¦ (More)

Let FM (A), for A = (Ï‰, . . .), be a family of finite, initial segments of A. One can see FM (A) as a family of finite arithmetics related to the arithmetic A. In the talk I will survey what is knownâ€¦ (More)