English
Related papers

Related papers: Blending margins: The modal logic K has nullary un…

200 papers

This paper presents the logic QRC$_1$, which is a strictly positive fragment of quantified modal logic. The intended reading of the diamond modality is that of consistency of a formal theory. Predicate symbols are interpreted as…

Logic · Mathematics 2020-10-15 Ana de Almeida Borges , Joost J. Joosten

We give a new construction of the algebraic $K$-theory of small permutative categories that preserves multiplicative structure, and therefore allows us to give a unified treatment of rings, modules, and algebras in both the input and…

K-Theory and Homology · Mathematics 2009-09-29 A. D. Elmendorf , M. A. Mandell

A logic has uniform interpolation if its formulas can be projected down to given subsignatures, preserving all logical consequences that do not mention the removed symbols; the weaker property of (Craig) interpolation allows the projected…

Logic in Computer Science · Computer Science 2022-05-03 Fatemeh Seifan , Lutz Schröder , Dirk Pattinson

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

There are many ways to represent the syntax of a language with binders. In particular, nominal frameworks are metalanguages that feature (among others) name abstraction types, which can be used to specify the type of binders. The resulting…

Logic in Computer Science · Computer Science 2026-05-25 Antoine Van Muylder , Andreas Nuyts , Dominique Devriese

We compute the algebraic K-theory modulo p and v_1 of the S-algebra ell/p = k(1), using topological cyclic homology. We use this to compute the homotopy cofiber of a transfer map K(L/p) --> K(L_p), which we interpret as the algebraic…

K-Theory and Homology · Mathematics 2009-11-26 Christian Ausoni , John Rognes

It has been shown in the late 1960s that each formula of first-order logic without constants and function symbols obeys a zero-one law: As the number of elements of finite models increases, every formula holds either in almost all or in…

Logic in Computer Science · Computer Science 2021-05-26 Rineke Verbrugge

Let K be an algebraically bounded structure and T be its theory. If T is model complete, then the theory of K endowed with a derivation, denoted by $T^{\delta}$, has a model completion. Additionally, we prove that if the theory T is…

Logic · Mathematics 2024-11-14 Fornasiero Antongiulio , Terzo Giuseppina

Locally affine Lie algebras are generalizations of affine Kac--Moody algebras with Cartan subalgebras of infinite rank whose root system is locally affine. In this note we study a class of representations of locally affine algebras…

Representation Theory · Mathematics 2009-04-02 Karl-Hermann Neeb

We present a Coq formalization of the Quantified Reflection Calculus with one modality, or $\mathsf{QRC}_1$. This is a decidable, strictly positive, and quantified modal logic previously studied for its applications in proof theory. The…

Logic in Computer Science · Computer Science 2023-12-20 Ana de Almeida Borges

A definition of summability is put forward in the framework of general Carleman ultraholomorphic classes in sectors, so generalizing $k-$summability theory as developed by J.-P. Ramis. Departing from a strongly regular sequence of positive…

Complex Variables · Mathematics 2014-02-10 Alberto Lastra , Stephane Malek , Javier Sanz

This paper is focused on the study of modal logics defined from valued Kripke frames, and particularly, on computability and expressibility questions of modal logics of transitive Kripke frames evaluated over certain residuated lattices. It…

Logic in Computer Science · Computer Science 2019-04-03 Amanda Vidal

Possibilistic logic offers a qualitative framework for representing pieces of information associated with levels of uncertainty of priority. The fusion of multiple sources information is discussed in this setting. Different classes of…

Artificial Intelligence · Computer Science 2013-01-18 Salem Benferhat , Didier Dubois , Souhila Kaci , Henri Prade

We examine the interplay between projectivity (in the sense that was introduced by S.~Ghilardi) and uniform post-interpolant for the classical and intuitionistic propositional logic. More precisely, we explore whether a projective…

Logic · Mathematics 2024-04-02 Mojtaba Mojtahedi , Konstantinos Papafilippou

Using the stress energy tensor, we establish some monotonicity formulae for vector bundle-valued p-forms satisfying the conservation law, provided that the base Riemannian (resp. K\"ahler) manifolds poss some real (resp. complex)…

Differential Geometry · Mathematics 2012-03-27 Yuxin Dong , Hezi Lin

For an abelian number field K containing a primitive p-th root of unity (p an odd prime) and satisfying certain technical conditions, we parametrize the Z_p[G(K/Q)]-annihilators of the "minus" part A_K^- of the p-class group by means of…

Number Theory · Mathematics 2010-09-17 Thong Nguyen Quang Do , Vésale Nicolas

Suppose that $G$ is a finite group and $K$ a non-trivial conjugacy class of $G$ such that $KK^{-1}=1\cup D\cup D^{-1}$ with $D$ a conjugacy class of $G$. We prove that $G$ is not a non-abelian simple group. We also give arithmetical…

Group Theory · Mathematics 2024-02-12 Antonio Beltrán , María José Felipe , Carmen Melchor

The aim of this paper is investigating the existence of weak solutions of the quasilinear elliptic model problem \[ \left\{\begin{array}{lr} - \divg (A(x,u)\, |\nabla u|^{p-2}\, \nabla u) + \dfrac1p\, A_t(x,u)\, |\nabla u|^p\ =\ f(x,u) &…

Analysis of PDEs · Mathematics 2013-10-03 A. M. Candela , G. Palmieri , K. Perera

Maslov's class $\overline{\text{K}}$ is an expressive fragment of First-Order Logic known to have decidable satisfiability problem, whose exact complexity, however, has not been established so far. We show that $\overline{\text{K}}$ has the…

Logic in Computer Science · Computer Science 2024-07-19 Oskar Fiuk , Emanuel Kieronski , Vincent Michielini

We introduce a novel decidable fragment of first-order logic. The fragment is one-dimensional in the sense that quantification is limited to applications of blocks of existential (universal) quantifiers such that at most one variable…

Logic · Mathematics 2014-04-16 Lauri Hella , Antti Kuusisto