English
Related papers

Related papers: Semisimplicity, Glivenko theorems, and the exclude…

200 papers

Let~$G$ be a unitary group of an~$\epsilon$-hermitian form~$h$ given over a nonarchimedean local field~$F_0$ of odd residue characteristic. We introduce a geometric combinatoric condition under which we prove "Intertwining implies…

Number Theory · Mathematics 2016-11-09 Daniel Skodlerack , Shaun Stevens

We introduce infinitary action logic with exponentiation -- that is, the multiplicative-additive Lambek calculus extended with Kleene star and with a family of subexponential modalities, which allows some of the structural rules…

Logic in Computer Science · Computer Science 2021-07-09 Stepan L. Kuznetsov , Stanislav O. Speranski

Szemeredi's Regularity Lemma is a very useful tool of extremal combinatorics. Recently, several refinements of this seminal result were obtained for special, more structured classes of graphs. We survey these results in their rich…

Combinatorics · Mathematics 2020-03-31 Yiting Jiang , Jaroslav Nesetril , Patrice Ossona de Mendez , Sebastian Siebertz

Prawitz suggested expanding a natural deduction system for intuitionistic logic to include rules for classical logic constructors, allowing both intuitionistic and classical elements to coexist without losing their inherent characteristics.…

Logic · Mathematics 2025-04-15 João Rasga , Cristina Sernadas

Simple conceptual graphs are considered as the kernel of most knowledge representation formalisms built upon Sowa's model. Reasoning in this model can be expressed by a graph homomorphism called projection, whose semantics is usually given…

Artificial Intelligence · Computer Science 2011-06-10 J. F. Baget , M. L. Mugnier

The general aim of this article is to study the negation fragment of classical logic within the framework of contemporary (Abstract) Algebraic Logic. More precisely, we shall find the three classes of algebras that are canonically…

Logic · Mathematics 2023-03-14 Luciano J. González

We present a logic for reasoning with if-then formulas which involve constants for rational truth degrees from the unit interval. We introduce graded semantic and syntactic entailment of formulas. We prove the logic is complete in Pavelka…

Logic in Computer Science · Computer Science 2015-02-26 Vilem Vychodil

We study the fluted fragment of first-order logic which is often viewed as a multi-variable non-guarded extension to various systems of description logics lacking role-inverses. In this paper we show that satisfiable fluted sentences (even…

Logic in Computer Science · Computer Science 2024-12-02 Daumantas Kojelis

For an arbitrary rational polyhedron we consider its decompositions into Minkowski summands and, dual to this, the free extensions of the associated pair of semigroups. Being free for the pair of semigroups is equivalent to flatness for the…

Algebraic Geometry · Mathematics 2020-04-17 Klaus Altmann , Alexandru Constantinescu , Matej Filip

In \cite{Kawasetsu:2018irs}, Kawasetsu proved that the simple W-algebra associated with a minimal nilpotent element $W_{k}(\mathfrak{g},f_\theta)$ is rational and $C_2$-cofinite for $\mathfrak{g}=D_4,E_6,E_7,E_8$ with non-admissible level…

Mathematical Physics · Physics 2024-06-21 Kaiwen Sun

We explore the consequences of layering a Lambek proof system over an arbitrary (constraint) logic. A simple model-theoretic semantics for our hybrid language is provided for which a particularly simple combination of Lambek's and the proof…

cmp-lg · Computer Science 2008-02-03 Jochen Doerre , Suresh Manandhar

The definition of a reference frame in General Relativity is achieved through the construction of a congruence of time-like world-lines. In this framework, splitting techniques enable us to express physical phenomena in analogy with Special…

General Physics · Physics 2026-05-13 Matteo Luca Ruggiero

We propose a new modal logic endowed with a simple deductive system to interpret Aristotle's theory of the modal syllogism. While being inspired by standard propositional modal logic it is also a logic of terms that admits a (sound)…

Logic · Mathematics 2022-06-15 Clarence Protin

This paper explores the connection between two central results in the proof theory of classical logic: Gentzen's cut-elimination for the sequent calculus and Herbrands "fundamental theorem". Starting from Miller's expansion-tree-proofs, a…

Logic · Mathematics 2010-05-24 Richard McKinley

We use folding techniques to define a new class of gentle-like algebras that generalise the iterated tilted algebras of type $C$ and $\widetilde{C}$, which we call folded gentle algebras. We then show that folded gentle algebras satisfy…

Representation Theory · Mathematics 2025-03-28 Drew Damien Duffield

We give a general framework for the treatment of perturbations of types and structures in continuous logic, allowing to specify which parts of the logic may be perturbed. We prove that separable, elementarily equivalent structures which are…

Logic · Mathematics 2010-04-22 Itaï Ben Yaacov

In this paper, we give an algebraic completeness theorem for constructive logic with strong negation in terms of finite rough set-based Nelson algebras determined by quasiorders. We show how for a quasiorder $R$, its rough set-based Nelson…

Rings and Algebras · Mathematics 2014-03-26 Jouni Järvinen , Piero Pagliani , Sándor Radeleczki

We study filtration of quasi--coherent sheaves. We prove a version of Kaplansky Theorem for quasi--coherent sheaves, by using Drinfeld's notion of almost projective module and the Hill Lemma. We also show a Lazard-like theorem for flat…

Algebraic Geometry · Mathematics 2011-09-05 Sergio Estrada , Pedro A. Guil Asensio , Sinem Odabasi

For a simply-connected simple algebraic group $G$ over $\C$, we exhibit a subvariety of its affine Grassmannian that is closely related to the nilpotent cone of $G$, generalizing a well-known fact about $GL_n$. Using this variety, we…

Representation Theory · Mathematics 2013-12-17 Pramod N. Achar , Anthony Henderson

Let K be a variety of (commutative, integral) residuated lattices. The substructural logic usually associated with K is an algebraizable logic that has K as its equivalent algebraic semantics, and is a logic that preserves truth, i.e., 1 is…

Logic · Mathematics 2009-10-02 F. Bou , F. Esteva , J. M. Font , A. Gil , L. Godo , A. Torrens , V. Verdú
‹ Prev 1 8 9 10 Next ›