English
Related papers

Related papers: Degrees of the finite model property: the antidich…

200 papers

The paper presents theorems on the calculation of the index of a singular point and at the infinity of monotone type mappings. These theorems cover basic cases when the principal linear part of a mapping is degenerate. Applications of these…

Analysis of PDEs · Mathematics 2007-05-23 A. P. Kovalenok , P. P. Zabreiko

In "Frobenius Categories versus Brauer Blocks", Progress in Math. 274, we have introduced the Frobenius categories F over a finite p-group P, and we have associated to F - suitably endowed with some central k*-extensions - a "Grothendieck…

Group Theory · Mathematics 2010-04-12 Lluis Puig

The satisfiability problem for First-order Modal Logic (\FOML) is undecidable even for simple fragments like having only unary predicates, two variables etc. Recently a new way to identify decidable fragments of \FOML has been introduced…

Logic in Computer Science · Computer Science 2025-06-03 Varad Joshi , Anantha Padmanabha

This article supplements recent work of the authors. (1) A criterion for failure of covariant finiteness of a full subcategory of $\Lambda\text{-mod}$ is given, where $\Lambda$ is a finite dimensional algebra. The criterion is applied to…

Representation Theory · Mathematics 2014-07-10 B. Huisgen-Zimmermann , S. O. Smalø

The property of exponential dichotomy can be seen as a generalization of the hyperbolicity condition for non autonomous linear finite dimensional systems of ordinary differential equations. In 1978 W.A. Coppel proved that the exponential…

Classical Analysis and ODEs · Mathematics 2024-11-11 Heli Elorreaga , Juan Peña , Gonzalo Robledo

We design a two-scale finite element method (FEM) for linear elliptic PDEs in non-divergence form $A(x) : D^2 u(x) = f(x)$ in a bounded but not necessarily convex domain $\Omega$ and study it in the max norm. The fine scale is given by the…

Numerical Analysis · Mathematics 2017-08-03 Ricardo H. Nochetto , Wujun Zhang

We determine the structure of the obstruction group of the Hasse norm principle for a finite separable extension $K/k$ of a global field of degree $d$, where $d$ has a square-free prime factor $p$ and a $p$-Sylow subgroup of the Galois…

Number Theory · Mathematics 2025-08-15 Yasuhiro Oki

Let $K/\mathbb{Q}$ be a real cyclic extension of degree divisible by $p$. We analyze the {\it statement} of the "Real Abelian Main Conjecture", for the $p$-class group $\mathcal{H}_K$ of $K$, in this non semi-simple case. The classical {\it…

Number Theory · Mathematics 2023-12-13 Georges Gras

For each natural number $n$ we study the modal logic determined by the class of transitive Kripke frames in which there are no cycles of length greater than $n$ and no strictly ascending chains. The case $n=0$ is the G\"odel-L\"ob…

Logic · Mathematics 2023-11-08 Robert Goldblatt

We introduce the semantically-defined constructive master-modality logics $\sf CK^*$ and $\sf WK^*$, extending the basic constructive modal logic $\sf CK$ and the Wijesekera-style logic $\sf WK$ obtained by impossing infallibility. Using…

Logic in Computer Science · Computer Science 2026-03-06 Sofía Santiago-Fernández , David Fernández-Duque , Joost J. Joosten

Given a weakly compact cardinal $\kappa$, we give an axiomatization of intuitionistic first-order logic over $\mathcal{L}_{\kappa^+, \kappa}$ and prove it is sound and complete with respect to Kripke models. As a consequence we get the…

Logic · Mathematics 2020-12-29 Christian Espíndola

We study the degree of irreducible morphisms in any Auslander-Reiten component of a finite dimensional algebra over an algebraically closed field. We give a characterization for an irreducible morphism to have finite left (or right) degree.…

Representation Theory · Mathematics 2016-05-11 Patrick Le Meur , Claudia Chaio , Sonia Trepode

We continue the investigation into the computational status of the existence of moduli of regularity (and their use for rates of convergence) in the sense of Kohlenbach, Lopez and Nicolae (2019), carried out w.r.t. classical reverse…

Logic in Computer Science · Computer Science 2026-03-05 Ulrich Kohlenbach

We investigate completeness for modal G\"odel logics with respect to finite G\"odel-Kripke models, along with related aspects. It is well known that the logics studied in [4, 11] fail to be complete with respect to finite G\"odel-Kripke…

Logic · Mathematics 2026-05-18 Amanda Vidal , Ricardo O. Rodriguez

This paper exhibits a general and uniform method to prove completeness for certain modal fixpoint logics. Given a set \Gamma of modal formulas of the form \gamma(x, p1, . . ., pn), where x occurs only positively in \gamma, the language…

Logic in Computer Science · Computer Science 2008-12-16 Luigi Santocanale , Yde Venema

We study Constraint Satisfaction Problems (CSPs) in an infinite context. We show that the dichotomy between easy and hard problems -- established already in the finite case -- presents itself as the strength of the corresponding De…

Logic · Mathematics 2024-10-30 Tamás Kátay , László Márton Tóth , Zoltán Vidnyánszky

We provide a general and syntactically-defined family of sequent calculi, called \emph{semi-analytic}, to formalize the informal notion of a "nice" sequent calculus. We show that any sufficiently strong (multimodal) substructural logic with…

Logic in Computer Science · Computer Science 2024-09-04 Amirhossein Akbar Tabatabai , Raheleh Jalali

We investigate the properties of the Extended Fock Basis (EFB) of Clifford algebras introduced in [1]. We show that a Clifford algebra can be seen as a direct sum of multiple spinor subspaces that are characterized as being left…

Mathematical Physics · Physics 2012-05-22 Marco Budinich

A conjecture in algorithmic model theory predicts that the model-checking problem for first-order logic is fixed-parameter tractable on a hereditary graph class if and only if the class is monadically dependent. Originating in model theory,…

Combinatorics · Mathematics 2024-03-28 Jan Dreier , Nikolas Mählmann , Szymon Toruńczyk

Fagin defined the class $NP$ by the means of Existential Second-Order logic. Feder and Vardi expressed it (up to polynomial equivalence) by special fragments of Existential Second-Order logic (SNP), while the authors used forbidden expanded…

Computational Complexity · Computer Science 2026-01-09 Gábor Kun , Jaroslav Nešetřil