English
Related papers

Related papers: A Finite Model Property for Intersection Types

200 papers

In this paper we show that the irreducible representations of a finite inverse semigroup $S$ over an algebraically closed field $F$ are in bijection with the conjugacy classes of $S$ if the characteristic of $F$ is zero or a prime number…

Representation Theory · Mathematics 2012-08-29 Zhenheng Li , Zhuo Li

We introduce a logic to express structural properties of automata with string inputs and, possibly, outputs in some monoid. In this logic, the set of predicates talking about the output values is parametric, and we provide sufficient…

Formal Languages and Automata Theory · Computer Science 2018-10-09 Emmanuel Filiot , Nicolas Mazzocchi , Jean-François Raskin

We propose a new approach for proving safety of infinite state systems. It extends the analyzed system by transitive relations until its diameter D becomes finite, i.e., until constantly many steps suffice to cover all reachable states,…

Logic in Computer Science · Computer Science 2026-05-05 Florian Frohn , Jürgen Giesl

In a type-theoretic fibration category in the sense of Shulman (representing a dependent type theory with at least 1, Sigma, Pi, and identity types), we define the type of constant functions from A to B. This involves an infinite tower of…

Logic · Mathematics 2015-10-23 Nicolai Kraus

We have a quick look at various finite model properties for residuated semigroups. In particular, we solve Problem 19.17 from Relation Algebras by Games by Hirsch and Hodkinson.

Logic · Mathematics 2022-11-22 Szabolcs Mikulás

We give homotopy invariant definitions corresponding to three well known properties of complete intersections, for the ring, the module theory and the endomorphisms of the residue field, and we investigate them for the mod p cochains on a…

Algebraic Topology · Mathematics 2014-10-01 D. J. Benson , J. P. C. Greenlees , S. Shamir

We establish several finiteness properties of groups defined by algebraic difference equations. One of our main results is that a subgroup of the general linear group defined by possibly infinitely many algebraic difference equations in the…

Algebraic Geometry · Mathematics 2020-07-30 Michael Wibmer

A theory based on the superposition principle is developed to uncover the basic physics of the wave behavior in a finite grating of N unit cells. The theory reveals that bound states in the continuum (BICs) of infinite quality factor…

Optics · Physics 2024-11-20 Huawei Liang , Yuanzhi Liu , Yu-Jia Zeng , Yangjian Cai , Tingyin Ning

The Triguarded Fragment (TGF) is among the most expressive decidable fragments of first-order logic, subsuming both its two-variable and guarded fragments without equality. We show that the TGF has the finite model property (providing a…

Logic in Computer Science · Computer Science 2021-01-26 Emanuel Kieroński , Sebastian Rudolph

We show that the BF theory in any space-time dimension, when quantized in a certain linear covariant gauge, possesses a vector supersymmetry. The generator of the latter together with those of the BRS transformations and of the translations…

High Energy Physics - Theory · Physics 2009-10-22 C. Lucchesi , O. Piguet , S. P. Sorella

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ø

Let $\MP_d$ denote the space of polynomials $f: \C \to \C$ of degree $d\geq 2$, modulo conjugation by $\Aut(\C)$. Using properties of polynomial trees (as introduced in [DM, math.DS/0608759]), we show that if $f_n$ is a divergent sequence…

Dynamical Systems · Mathematics 2007-05-23 Laura DeMarco

The main result of this paper is to show that all binomial identities are orderable. This is a natural statement in the combinatorial theory of finite sets, which can also be applied in distributed computing to derive new strong bounds on…

Discrete Mathematics · Computer Science 2016-06-24 Dmitry N. Kozlov

Alternating automata have been widely used to model and verify systems that handle data from finite domains, such as communication protocols or hardware. The main advantage of the alternating model of computation is that complementation is…

Formal Languages and Automata Theory · Computer Science 2017-08-17 Radu Iosif , Xiao Xu

We study the problem of counting the total number of affine solutions of a system of n binomials in n variables over an algebraically closed field of characteristic zero. We show that we may decide in polynomial time if that number is…

Commutative Algebra · Mathematics 2007-05-23 Eduardo Cattani , Alicia Dickenstein

We develop a constructive theory of finite multisets in Homotopy Type Theory, defining them as free commutative monoids. After recalling basic structural properties of the free commutative-monoid construction, we formalise and establish the…

Logic in Computer Science · Computer Science 2023-06-22 Vikraman Choudhury , Marcelo Fiore

If T is an model complete theory with the strict order property, then the theory of the models of T with an automorphism has no model companion.

Logic · Mathematics 2007-05-23 Hirotaka Kikyo , Saharon Shelah

Divisibility monoids are a natural lattice-theoretical generalization of Mazurkiewicz trace monoids, namely monoids in which the distributivity of the involved divisibility lattices is kept as an hypothesis, but the relations between the…

General Mathematics · Mathematics 2007-05-23 Matthieu Picantin

As a motivation, we first recall the possible connection of electric-magnetic duality to finiteness in N=1 super-Yang-Mills theories (SYM). Then, we present the criterion for all-order finiteness (i.e., vanishing of the beta-functions at…

High Energy Physics - Phenomenology · Physics 2011-04-15 C. Lucchesi , G. Zoupanos

In sequential functional languages, sized types enable termination checking of programs with complex patterns of recursion in the presence of mixed inductive-coinductive types. In this paper, we adapt sized types and their metatheory to the…

Programming Languages · Computer Science 2024-04-16 Siva Somayyajula , Frank Pfenning