English
Related papers

Related papers: A Class of Generalised Quantifiers for k-Variable …

200 papers

The paper considers the representation of k-valued logical functions in the class of disjunctive normal forms. Various classes of monotone functions of k-valued logic are investigated. Theorems are proved on the coincidence of reduced and…

Logic · Mathematics 2024-02-01 Anvar Kabulov , Abdussattar Baizhumanov , Mansur Berdimurodov

We show how general principles of symmetry in quantum mechanics lead to twisted notions of a group representation. This framework generalizes both the classical 3-fold way of real/complex/quaternionic representations as well as a…

High Energy Physics - Theory · Physics 2015-06-11 Daniel S. Freed , Gregory W. Moore

In a first part we propose an introduction to multisymplectic formalisms, which are generalisations of Hamilton's formulation of Mechanics to the calculus of variations with several variables: we give some physical motivations, related to…

Mathematical Physics · Physics 2007-05-23 Frederic Helein

We establish the strictness of several set quantifier alternation hierarchies that are based on modal logic, evaluated on various classes of finite graphs. This extends to the modal setting a celebrated result of Matz, Schweikardt and…

Logic in Computer Science · Computer Science 2016-03-01 Fabian Reiter

We present new proofs and generalizations of unimodality of the q-binomial coefficients \binom{n}{k}_q as polynomials in q. We use an algebraic approach by interpreting the differences between numbers of certain partitions as Kronecker…

Combinatorics · Mathematics 2014-03-13 Igor Pak , Greta Panova

In this paper we introduce and study the so-called continuous $K$-theory for a certain class of "large" stable $\infty$-categories, more precisely, for dualizable presentable categories. For compactly generated categories, the continuous…

K-Theory and Homology · Mathematics 2025-02-07 Alexander I. Efimov

We develop an equivariant theory of graphs with respect to quantum symmetries and present a detailed exposition of various examples. We portray unitary tensor categories as a unifying framework encompassing all finite classical simple…

Operator Algebras · Mathematics 2026-01-06 Michael Brannan , Roberto Hernández Palomares

We present news proofs of the additivity, resolution and cofinality theorems for the algebraic $K$-theory of exact categories. These proofs are entirely algebraic, based on Grayson's presentation of higher algebraic $K$-groups via binary…

K-Theory and Homology · Mathematics 2013-11-21 Tom Harris

We give an almost entirely model-theoretic account of both Ramsey classes of finite structures and of generalized indiscernibles as studied in special cases in (for example) [7], [9]. We understand "theories of indiscernibles" to be special…

Logic · Mathematics 2012-10-30 Cameron Donnay Hill

Quantum processes describe concurrent communicating systems that may involve quantum information. We propose a notion of open bisimulation for quantum processes and show that it provides both a sound and complete proof methodology for a…

Logic in Computer Science · Computer Science 2012-01-04 Yuxin Deng , Yuan Feng

We introduce proper display calculi for basic monotonic modal logic,the conditional logic CK and a number of their axiomatic extensions. These calculi are sound, complete, conservative and enjoy cut elimination and subformula property. Our…

Let $K$ denote a simply connected compact Lie group and let $G=K^{\mathbb C}$, the complexification. It is known that there exists an $LK$ bi-invariant probability measure on a natural hyperfunction completion of the complex loop group…

Mathematical Physics · Physics 2025-12-23 Doug Pickrell

The uniform one-dimensional fragment of first-order logic was introduced a few years ago as a generalization of the two-variable fragment of first-order logic to contexts involving relations of arity greater than two. Quantifiers in this…

Logic in Computer Science · Computer Science 2023-10-03 Emanuel Kieroński

We define a general notion of transition system where states and action labels can be from arbitrary nominal sets, actions may bind names, and state predicates from an arbitrary logic define properties of states. A Hennessy-Milner logic for…

Logic in Computer Science · Computer Science 2023-06-22 Joachim Parrow , Johannes Borgström , Lars-Henrik Eriksson , Ramūnas Forsberg Gutkovas , Tjark Weber

Canonical formulas are a powerful tool for studying intuitionistic and modal logics. Actually, they provide a uniform and semantic way to axiomatise all extensions of intuitionistic logic and all modal logics above K4. Although the method…

Logic · Mathematics 2016-06-23 Nick Bezhanishvili , Nick Galatos , Luca Spada

Locality is a property of logics, based on Hanf's and Gaifman's theorems, and that was shown to be very useful in the context of finite model theory. In this paper I present a homotopic variation for locality, namely a Quillen model…

Category Theory · Mathematics 2020-05-20 Hendrick Maia

We give examples of (i) a simple theory with a formula (with parameters) which does not fork over the empty set but has mu measure 0 for every automorphism invariant Keisler measure mu, and (ii) a definable group G in a simple theory such…

A. Vistoli proved a decomposition theorem for the rational equivariant algebraic K-theory of a variety under the action of a finite group $G$. We generalize his result to more general algebraic (co)homology theories having the Mackey…

Algebraic Geometry · Mathematics 2025-05-21 Francesco Sala

We introduce a monotone modal analogue of the intuitionistic (normal) modal logic IK using a translation into a suitable (intuitionistic) first-order logic. We axiomatise the logic and give a semantics by means of intuitionistic…

Logic · Mathematics 2025-07-21 Jim de Groot

Invertible map equivalences are approximations of graph isomorphism that refine the well-known Weisfeiler-Leman method. They are parametrised by a number k and a set Q of primes. The intuition is that two graphs G and H which are equivalent…

Logic in Computer Science · Computer Science 2019-08-28 Anuj Dawar , Erich Grädel , Wied Pakusa