English
Related papers

Related papers: Compactness in positive logic

200 papers

Compact categories have lately seen renewed interest via applications to quantum physics. Being essentially finite-dimensional, they cannot accomodate (co)limit-based constructions. For example, they cannot capture protocols such as quantum…

Logic in Computer Science · Computer Science 2016-04-20 Chris Heunen

In this paper we examine two basic topological properties of partial metric spaces, namely compactness and completeness. Our main result claims that in these spaces compactness is equivalent to sequential compactness. We also show that…

General Topology · Mathematics 2022-02-01 Dariusz Bugajewski , Piotr Maćkowiak , Ruidong Wang

We develop a duality for (modal) lattices that need not be distributive, and use it to study positive (modal) logic beyond distributivity, which we call weak positive (modal) logic. This duality builds on the Hofmann, Mislove and Stralka…

Logic · Mathematics 2023-12-01 Nick Bezhanishvili , Anna Dmitrieva , Jim de Groot , Tommaso Moraschini

We give a new proof of a theorem of Mints that the positive fragment of minimal predicate logic is decidable. The idea of the proof is to replace the eigenvariable condition of sequent calculus by an appropriate scoping mechanism. The…

Logic in Computer Science · Computer Science 2023-05-16 Gilles Dowek , Ying Jiang

How can non-classical logic contribute to the analysis of complexity in computer science? In this paper, we give a step towards this question, taking a logical model-theoretic approach to the analysis of complexity in fuzzy constraint…

Logic · Mathematics 2019-11-18 Pilar Dellunde , Amanda Vidal

We characterize exactly the compactness properties of the product of \kappa\ copies of the space \omega\ with the discrete topology. The characterization involves uniform ultrafilters, infinitary languages, and the existence of nonstandard…

General Topology · Mathematics 2016-08-30 Paolo Lipparini

Affine continuous logic is extended to affine integration logic. Affine compactness theorem is proved by both the ultramean construction and Henkin's method. Also, a proof system and a completeness theorem are given. An appropriate variant…

Logic · Mathematics 2026-02-24 Seyed-Mohammad Bagheri

We characterize the notion of definable compactness for topological spaces definable in o-minimal structures, answering questions of Peterzil and Steinhorn (1999) and Johnson (2018). Specifically, we prove the equivalence of various…

Logic · Mathematics 2025-04-29 Pablo Andújar Guerrero

We study the extension of dependence logic D by a majority quantifier M over finite structures. We show that the resulting logic is equi-expressive with the extension of second-order logic by second-order majority quantifiers of all…

Logic in Computer Science · Computer Science 2013-03-11 Arnaud Durand , Johannes Ebbing , Juha Kontinen , Heribert Vollmer

We extend the definition of weak and strong convergence to sequences of Sobolev-functions whose underlying domains themselves are converging. In contrast to previous works, we do so without ever assuming any sort of reference configuration.…

Analysis of PDEs · Mathematics 2024-11-20 Nikita Evseev , Malte Kampschulte , Alexander Menovschikov

The paper has a form of a talk on the given topic. It consists of three parts. The first part of the paper contains main notions, the second one is devoted to logical geometry, the third part describes types and isotypeness. The problems…

Logic · Mathematics 2013-06-05 Boris Plotkin

The study of complex systems through the lens of category theory consistently proves to be a powerful approach. We propose that cognition deserves the same category-theoretic treatment. We show that by considering a highly-compact cognitive…

Neurons and Cognition · Quantitative Biology 2021-08-04 Sophie Alyx Taylor , Son Cao Tran , Dan V. Nicolau

This paper introduces an abstract notion of fragments of monadic second-order logic. This concept is based on purely syntactic closure properties. We show that over finite words, every logical fragment defines a lattice of languages with…

Formal Languages and Automata Theory · Computer Science 2015-03-20 Manfred Kufleitner , Alexander Lauser

Motivated by the analysis and geometry of metric-measure structures in infinite dimensions, we study the category of extended metric-topological spaces, along with many of its distinguished subcategories (such as the one of compact spaces).…

Category Theory · Mathematics 2026-01-13 Enrico Pasqualetto , Timo Schultz , Janne Taipalus

We introduce the space of relative orders on a group and show that it is compact whenever the group is finitely generated. We use this to show that if $G$ is a finitely generated group acting by order preserving homeomorphism of on the…

Group Theory · Mathematics 2018-06-12 Yago Antolín , Cristóbal Rivas

We already saw in [A1] that the space of dynamically marked rational maps can be identified to a subspace of the space of covers between trees of spheres on which there is a notion of convergence that makes it sequentially compact. In the…

Dynamical Systems · Mathematics 2017-09-15 Matthieu Arfeux

We study structures which have arisen in recent work by the present author and Bob Coecke on a categorical axiomatics for Quantum Mechanics; in particular, the notion of strongly compact closed category. We explain how these structures…

Quantum Physics · Physics 2009-10-16 Samson Abramsky

When studying the causal propagation of a field in a globally hyperbolic spacetime M, one often wants to express the physical intuition that it has compact support in spacelike directions, or that its support is a spacelike compact set. We…

Mathematical Physics · Physics 2013-05-15 Ko Sanders

We introduce the notion of functionally compact sets into the theory of nonlinear generalized functions in the sense of Colombeau. The motivation behind our construction is to transfer, as far as possible, properties enjoyed by standard…

Functional Analysis · Mathematics 2016-03-01 Paolo Giordano , Michael Kunzinger

We define and study logics in the framework of probabilistic team semantics and over metafinite structures. Our work is paralleled by the recent development of novel axiomatizable and tractable logics in team semantics that are closed under…

Logic in Computer Science · Computer Science 2021-04-12 Miika Hannula , Minna Hirvonen , Juha Kontinen