English
Related papers

Related papers: Weak topologies for Linear Logic

200 papers

We study the model theoretic strength of various lattices that occur naturally in topology, like closed (semi-linear or semi-algebraic or convex) sets. The method is based on weak monadic second order logic and sharpens previous results by…

Logic · Mathematics 2018-07-26 Marcus Tressl

We present a categorical model for intuitionistic linear logic where objects are polynomial diagrams and morphisms are simulation diagrams. The multiplicative structure (tensor product and its adjoint) can be defined in any locally…

Logic in Computer Science · Computer Science 2019-02-20 Pierre Hyvernat

A weak pseudoline arrangement is a topological generalization of a line arrangement, consisting of curves topologically equivalent to lines that cross each other at most once. We consider arrangements that are outerplanar---each crossing is…

Computational Geometry · Computer Science 2016-01-27 David Eppstein , Mereke van Garderen , Bettina Speckmann , Torsten Ueckerdt

Informally, the 'linear representation hypothesis' is the idea that high-level concepts are represented linearly as directions in some representation space. In this paper, we address two closely related questions: What does "linear…

Computation and Language · Computer Science 2026-05-18 Kiho Park , Yo Joong Choe , Victor Veitch

Considering evolutionary equations in the sense of Picard, we identify a certain topology for material laws rendering the solution operator continuous if considered as a mapping from the material laws into the set of bounded linear…

Analysis of PDEs · Mathematics 2024-12-30 Andreas Buchinger , Nathanael Skrepek , Marcus Waurick

We construct a symmetric monoidal closed category of polynomial endofunctors (as objects) and simulation cells (as morphisms). This structure is defined using universal properties without reference to representing polynomial diagrams and is…

Logic in Computer Science · Computer Science 2015-07-01 Hyvernat Pierre

Generalized topological spaces are not necessarily closed under finite intersections. Moreover, the whole universe does not need to be open. We use modified version of this framework to establish certain models for non-normal modal logics.…

Logic · Mathematics 2020-05-28 Tomasz Witczak

Weak topologies that yield weak convergence for bounded sequences and nets in CAT($0$) spaces have been studied in the past. We are here concerned with weak topologies that yield weak convergence of unbounded sequences and nets. We analyze…

Metric Geometry · Mathematics 2022-04-05 Philip Miller , Arian Berdellima , Max Wardetzky

With the increasing empirical success of distributional models of compositional semantics, it is timely to consider the types of textual logic that such models are capable of capturing. In this paper, we address shortcomings in the ability…

Computation and Language · Computer Science 2013-06-11 Karl Moritz Hermann , Edward Grefenstette , Phil Blunsom

We present a relatively simple description of binary, definable subsets of models of weakly quasi-o-minimal theories. In particular, we closely describe definable linear orders and prove a weak version of the monotonicity theorem. We also…

Logic · Mathematics 2021-06-01 Slavko Moconja , Predrag Tanović

In this work, we show that both logic programming and abstract argumentation frameworks can be interpreted in terms of Nelson's constructive logic N4. We do so by formalizing, in this logic, two principles that we call non-contradictory…

Artificial Intelligence · Computer Science 2022-03-29 Jorge Fandinno , Luis Fariñas del Cerro

In this study, we devote our attention to the question of clarifying the existence of a weak solution to a class of quasilinear double-phase elliptic equations with logarithmic convection terms under some appropriate assumptions on data.…

Analysis of PDEs · Mathematics 2024-01-05 Minh-Phuong Tran , Thanh-Nhan Nguyen

We prove strong completeness results for some modal logics with the universal modality, with respect to their topological semantics over 0-dimensional dense-in-themselves metric spaces. We also use failure of compactness to show that, for…

Logic · Mathematics 2020-08-12 Robert Goldblatt , Ian Hodkinson

Extensional higher-order logic programming has been introduced as a generalization of classical logic programming. An important characteristic of this paradigm is that it preserves all the well-known properties of traditional logic…

Programming Languages · Computer Science 2020-02-19 Angelos Charalambidis , Zoltán Ésik , Panos Rondogiannis

A convergence theorem for martingales with c\`adl\`ag trajectories (right continuous with left limits everywhere) is obtained in the sense of the weak dual topology on Hilbert space, under conditions that are much weaker than those required…

Probability · Mathematics 2024-10-08 Bruno N. Remillard , Jean Vaillancourt

We introduce residuated ortholattices as a generalization of -- and environment for the investigation of -- orthomodular lattices. We establish a number of basic algebraic facts regarding these structures, characterize orthomodular lattices…

Logic · Mathematics 2021-09-14 Wesley Fussner , Gavin St. John

We extend the framework of abstract algebraic logic to weak logics, namely logical systems which are not necessarily closed under uniform substitution. We interpret weak logics by algebras expanded with an additional predicate and we…

Logic · Mathematics 2026-01-16 Georgi Nakov , Davide Emilio Quadrellaro

Linear topological spaces with partial ordering (linear kinematics) are studied. They are defined by a set of 8 axioms implying that topology, linear structure and ordering are compatible with each other. Most of the results are valid for…

General Relativity and Quantum Cosmology · Physics 2007-05-23 Victor Revoltovich Krym

The categorical compositional distributional model of meaning gives the composition of words into phrases and sentences pride of place. However, it has so far lacked a model of logical negation. This paper gives some steps towards providing…

Computation and Language · Computer Science 2020-05-12 Martha Lewis

The notion of a non-deterministic logical matrix (where connectives are interpreted as multi-functions) extends the traditional semantics for propositional logics based on logical matrices (where connectives are interpreted as functions).…

Logic · Mathematics 2024-12-19 Carlos Caleiro , Pedro Filipe , Sérgio Marcelino