English
Related papers

Related papers: (Non-)well-founded derivations in the provability …

200 papers

We prove global existence, uniqueness and $\L1$ stability of solutions to general systems of nonlocal conservation laws modeling multiclass vehicular traffic. Each class follows its own speed law and has specific effects on the other…

Analysis of PDEs · Mathematics 2025-01-29 Rinaldo M. Colombo , Mauro Garavello , Claudia Nocita

We begin this note with a von Neumann algebraic version of the elementary but extremely useful fact about being able to extend inner-product preserving maps from a total set of the domain Hilbert space to an isometry defined on the entire…

Operator Algebras · Mathematics 2013-10-14 Panchugopal Bikram , Masaki Izumi , R. Srinivasan , V. S. Sunder

We establish decidability for the infinitely many axiomatic extensions of the commutative Full Lambek logic with weakening FLew (i.e. IMALLW) that have a cut-free hypersequent proof calculus (specifically: every analytic structural rule…

Logic in Computer Science · Computer Science 2021-04-21 A. R. Balasubramanian , Timo Lang , Revantha Ramanayake

The remarkable results of Foster and Vohra was a starting point for a series of papers which show that any sequence of outcomes can be learned (with no prior knowledge) using some universal randomized forecasting algorithm and…

Artificial Intelligence · Computer Science 2008-06-27 Vladimir V. V'yugin

In a first result we prove that every continuous local triple derivation on a JB$^*$-triple is a triple derivation. We also give an automatic continuity result, that is, we show that local triple derivations on a JB$^*$-triple are…

Functional Analysis · Mathematics 2017-05-17 María Burgos , Francisco J. Fernández-Polo , Antonio M. Peralta

Many-valued models generalise the structures from classical model theory by defining truth values for a model with an arbitrary algebra. Just as algebraic varieties provide semantics for many non-classical propositional logics, models…

Logic in Computer Science · Computer Science 2026-01-29 James Carr

In this paper a conditional logic is defined and studied. This conditional logic, DmBL, is constructed as close as possible to the Bayesian and is unrestricted, that is one is able to use any operator without restriction. A notion of…

Logic · Mathematics 2016-09-07 Frederic Dambreville

In this paper, we present an interactive semantics for derivations in an infinitary extension of classical logic. The formulas of our language are possibly infinitary trees labeled by propositional variables and logical connectives. We show…

Logic in Computer Science · Computer Science 2014-09-12 Michele Basaldella

Non-local theories of gravity are considered extended theories of gravity, meaning that when the non-local terms are canceled out, the limit of General Relativity (GR) is obtained. Several reasons have led us to consider this theory with…

General Relativity and Quantum Cosmology · Physics 2023-12-06 Amodio Carleo

Based on the recent development of commutator theory for loops, we provide both syntactic and semantic characterization of abelian normal subloops. We highlight the analogies between well known central extensions and central nilpotence on…

Group Theory · Mathematics 2015-09-21 David Stanovský , Petr Vojtěchovský

We introduce $L^2_{K,P}$, a monadic second-order language for reasoning about trees which characterizes the strongly Context-Free Languages in the sense that a set of finite trees is definable in $L^2_{K,P}$ iff it is (modulo a projection)…

cmp-lg · Computer Science 2008-02-03 James Rogers

When we investigate a type system, it is helpful if we can establish the well-foundedness of types or terms with respect to a certain hierarchy, and the Extended Calculus of Constructions (called $ECC$, defined and studied comprehensively…

Logic in Computer Science · Computer Science 2021-05-12 Eitetsu Ken , Masaki Natori , Kenji Tojo , Kazuki Watanabe

We give a new proof of the fact that finite bipartite graphs cannot be axiomatized by finitely many first-order sentences among FINITE graphs. (This fact is a consequence of a general theorem proved by L. Ham and M. Jackson, and the…

Logic · Mathematics 2021-04-01 Gábor Czédli

A long standing problem in the area of error correcting codes asks whether there exist good cyclic codes. Most of the known results point in the direction of a negative answer. The uncertainty principle is a classical result of harmonic…

Information Theory · Computer Science 2017-04-19 Shai Evra , Emmanuel Kowalski , Alexander Lubotzky

The paper deals with a comprehensive theory of mappings, whose local behavior can be described by means of linear subspaces, contained in the graphs of two (primal and dual) generalized derivatives. This class of mappings includes the…

Optimization and Control · Mathematics 2021-12-08 Helmut Gfrerer , Jiri V. Outrata

We argue that Godel's completeness theorem is equivalent to completability of consistent theories, and Godel's incompleteness theorem is equivalent to the fact that this completion is not constructive, in the sense that there are some…

Logic · Mathematics 2019-07-02 Saeed Salehi

We prove the following version of Milnor's theorem on solvable groups of exponential growth: A finitely generated solvable group which is not polycyclic contains an ascending HNN extension. Consequently, a finitely generated solvable group…

Group Theory · Mathematics 2007-05-23 Roger Alperin

The present paper is devoted to study 2-local derivations on infinite-dimensional Lie algebras over a field of characteristic zero. We prove that all 2-local derivations on the Witt algebra as well as on the positive Witt algebra are…

Rings and Algebras · Mathematics 2019-01-15 Shavkat Ayupov , Baxtiyor Yusupov

The main goal of the paper is to present a general model theoretic framework to understand a result of Shalev on probabilistically finite nilpotent groups. We prove that a suitable group where the equation $[x_1,\ldots,x_k]=1$ holds on a…

Logic · Mathematics 2022-04-26 Daniel Palacín

The semantic paradoxes are associated with self-reference or referential circularity. However, there are infinitary versions of the paradoxes, such as Yablo's paradox, that do not involve this form of circularity. It remains an open…

Combinatorics · Mathematics 2021-04-13 Brian Rabern , Landon Rabern