Related papers: Fixed-point properties for predicate modal logics

The paper proves finite model property and decidability for a family of modal logics. A binary relation $R$ is called pretransitive, if $R^*=\cup_{i\leq m} R^i$ for some $m\geq 0$, where $R^*$ is the transitive reflexive closure of $R$. By…

The paper presents a solution to the long-standing question about the decidability of the two-variable fragment of the superintuitionistic predicate logic $\mathbf{QLC}$ defined by the class of linear Kripke frames, which is also the…

Nonmonotonic logics are usually characterized by the presence of some notion of 'conditional' that fails monotonicity. Research on nonmonotonic logics is therefore largely concerned with the defeasibility of argument forms and the…

Whether it be in normal form games, or in fair allocations, or in voter preferences in voting systems, a certain pattern of reasoning is common. From a particular profile, an agent or a group of agents may have an incentive to shift to a…

We prove that the irreducible decomposition of the permutation representation of GL(n,q) on GL(n,q)/GL(n-m,q) stabilizes for large n. We deduce, as a consequence, a representation stability theorem for finitely generated VIC-modules.

This article provides a geometric bridge between two entirely different character formulas for reductive Lie groups and answers the question posed by W.Schmid in [Sch]. A corresponding problem in the compact group setting was solved by…

Let $K$ be a number field, $f\in K[x]$ a quadratic polynomial, and $n\in\{1,2,3\}$. We show that if $f$ has a point of period $n$ in every non-archimedean completion of $K$, then $f$ has a point of period $n$ in $K$. For $n\in\{4,5\}$ we…

The $\mathcal{O}(\partial^2)$ background independent flow equations for conformally reduced gravity are shown to be equivalent to flow equations naturally adapted to scalar field theory with a wrong sign kinetic term. This sign change is…

We investigate the representation of the symmetric group afforded by the action on its conjugacy class of fixed point free involutions, over an algebraically closed field of finite characteristic p. We discuss the general form of the set of…

We initiate the study of finite characterizations and exact learnability of modal languages. A finite characterization of a modal formula w.r.t. a set of formulas is a finite set of finite models (labelled either positive or negative) which…

We establish new, and surprisingly tight, connections between propositional proof complexity and finite model theory. Specifically, we show that the power of several propositional proof systems, such as Horn resolution, bounded-width…

Conjugation, or Legendre transformation, is a basic tool in convex analysis, rational mechanics, economics and optimization. It maps a function on a linear topological space into another one, defined in the dual of the linear space by…

We classify all finite subgroups of the plane Cremona group which have a fixed point. In other words, we determine all rational surfaces X with an action of a finite group G such that X is equivariantly birational to a surface which has a…

This paper contributes to a theory of the behaviour of "finite-state" systems that is generic in the system type. We propose that such systems are modelled as coalgebras with a finitely generated carrier for an endofunctor on a locally…

We study compactness and L\"owenheim-Skolem properties of fragments of the class-sized logic $\mathcal{L}_{\infty \infty}$ and of class-sized versions of second-order and sort logics. In these fragments, certain combinations of infinitary…

Under the natural action of the pure mapping class group of a surface of genus at least three, we show that any global fixed point in the low-dimensional deformation space of the surface group corresponds to the trivial representation. A…

Orthogonality is a notion based on the duality between programs and their environments used to determine when they can be safely combined. For instance, it is a powerful tool to establish termination properties in classical formal systems.…

We say that a logic L has the Lyndon positivity property (LPP) if all formulas which are monotone in L (that is, are preserved under increasing the valuation on L-algebras) are L-equivalent to positive formulas (formulas without negation…

Let B be any Lp space for p in (1,infty) or any Banach space isomorphic to a Hilbert space, and k be a nonnegative integer. We show that if n is at least 4, then the universal lattice Gamma =SL_n (Z[x1,...,xk]) has property (F_B) in the…

While modal extensions of decidable fragments of first-order logic are usually undecidable, their monodic counterparts, in which formulas in the scope of modal operators have at most one free variable, are typically decidable. This only…