English
Related papers

Related papers: Structurally complete finitary extensions of posit…

200 papers

We contribute to the refined understanding of the language-logic-algebra interplay in the context of first-order properties of countable words. We establish decidable algebraic characterizations of one variable fragment of FO as well as…

Logic in Computer Science · Computer Science 2021-07-06 Bharat Adsul , Saptarshi Sarkar , A. V. Sreejith

We study the complexity of reachability problems on branching extensions of vector addition systems, which allows us to derive new non-elementary complexity bounds for fragments and variants of propositional linear logic. We show that…

Logic in Computer Science · Computer Science 2022-05-18 Ranko Lazić , Sylvain Schmitz

Within the possibilistic approach to uncertainty modeling, the paper presents a modal logical system to reason about qualitative (comparative) statements of the possibility (and necessity) of fuzzy propositions. We relate this qualitative…

Logic in Computer Science · Computer Science 2013-02-28 Petr Hajek , Dagmar Harmancová , Francesc Esteva , Pere Garcia , Lluis Godo

We develop a method for showing that various modal logics that are valid in their countably generated canonical Kripke frames must also be valid in their uncountably generated ones. This is applied to many systems, including the logics of…

Logic · Mathematics 2024-11-20 Robert Goldblatt , Ian Hodkinson

Lukasiewicz logic is a "fuzzy" logic in which truth value can be real numbers in the unit interval. There are connectives for min, max, addition and complement (1-x). The "value" of a closed formula in a fuzzy (relational model) is defined…

Logic · Mathematics 2016-09-07 Martin Goldstern

We expand the notion of characteristic formula to infinite finitely presentable subdirectly irreducible algebras. We prove that there is a continuum of varieties of Heyting algebras containing infinite finitely presentable subdirectly…

Logic in Computer Science · Computer Science 2012-08-14 Alex Citkin

It is proved that the category $\mathbb{EM}$ of extended multisets is dually equivalent to the category $\mathbb{CHMV}$ of compact Hausdorff MV-algebras with continuous homomorphisms, which is in turn equivalent to the category of complete…

Logic · Mathematics 2017-06-12 Jean B. Nganou

We consider model-theoretic properties related to the expressive power of three analogues of $L_{\omega_1, \omega}$ for metric structures. We give an example showing that one of these infinitary logics is strictly more expressive than the…

Logic · Mathematics 2017-08-10 Christopher J. Eagle

Substructural logics are formal logical systems that omit familiar structural rules of classical and intuitionistic logic such as contraction, weakening, exchange (commutativity), and associativity. This leads to a resource-sensitive…

Logic in Computer Science · Computer Science 2025-05-01 Nikolaos Galatos , Vitor Greati , Revantha Ramanayake , Gavin St. John

Let (R; m; k) be a local noetherian domain with field of fractions K and R_v a valuation ring, dominating R (not necessarily birationally). Let v|K be the restriction of v to K; by definition, v|K is centered at R. Let \hat{R} denote the…

Algebraic Geometry · Mathematics 2012-11-05 F. J. Herrera Govantes , M. A. Olalla Acosta , M. Spivakovsky , B. Teissier

Let L be a countable and locally finite CW complex. Suppose that the class of all metrizable compacta of extension dimension not greater than L contains a universal element which is an absolute extensor in dimension L. Our main result shows…

Geometric Topology · Mathematics 2007-05-23 Alex Karasev , Vesko Valov

In this paper we provide a (negative) solution to a problem posed by Stanis{\l}aw Krajewski. Consider a recursively enumerable theory U and a finite expansion of the signature of U that contains at least one predicate symbol of arity $\ge$…

Logic · Mathematics 2017-12-06 Fedor Pakhomov , Albert Visser

We propose an extension of the classical variational theory of evolution equations that accounts for dynamics also in possibly non-reflexive and non-separable spaces. The pivoting point is to establish a novel variational structure, based…

Analysis of PDEs · Mathematics 2021-09-17 Alexander Menovschikov , Anastasia Molchanova , Luca Scarpa

We prove that the MSO+U logic is compositional in the following sense: whether an MSO+U formula holds in a tree T depends only on MSO+U-definable properties of the root of T and of subtrees of T starting directly below the root. Another…

Logic in Computer Science · Computer Science 2020-05-07 Paweł Parys

The multiplicative fragment of Linear Logic is the formal system in this family with the best understood proof theory, and the categorical models which best capture this theory are the fully complete ones. We demonstrate how the Hyland-Tan…

Logic in Computer Science · Computer Science 2017-01-11 Andrea Schalk , Hugh Paul Steele

In this paper we investigate the combinatorial structure of 3-dimensional Minkowski-Voronoi continued fractions. Our main goal is to prove the asymptotic stability of Minkowski-Voronoi complexes in special two-parametric families of rank-1…

Number Theory · Mathematics 2017-02-02 Oleg Karpenkov , Alexey Ustinov

We study two notions of definability for classes of relational structures based on modal extensions of {\L}ukasiewicz finitely valued-logics. The main results of the paper are the equivalent of the Goldblatt - Thomason theorem for these…

Logic · Mathematics 2015-11-26 Bruno Teheux

The present paper investigates proof-theoretical and algebraic properties for the probability logic FP(L,L), meant for reasoning on the uncertainty of Lukasiewicz events. Methodologically speaking, we will consider a translation function…

Logic · Mathematics 2023-03-14 Tommaso Flaminio , Sara Ugolini

An extension of the super Korteweg-de Vries integrable system in terms of operator valued functions is obtained. In particular the extension contains the $N=1$ Super KdV and coupled systems with functions valued on a symplectic space. We…

Mathematical Physics · Physics 2015-06-22 A. Restuccia , A. Sotomayor

We study a many-valued generalization of Propositional Dynamic Logic where formulas in states and accessibility relations between states of a Kripke model are evaluated in a finite FL-algebra. One natural interpretation of this framework is…

Logic in Computer Science · Computer Science 2020-12-23 Igor Sedlár
‹ Prev 1 3 4 5 6 7 10 Next ›