English
Related papers

Related papers: Complete Additivity and Modal Incompleteness

200 papers

We define an extension of predicate logic, called Binding Logic, where variables can be bound in terms and in propositions. We introduce a notion of model for this logic and prove a soundness and completeness theorem for it. This theorem is…

Logic in Computer Science · Computer Science 2023-05-26 Gilles Dowek , Thérèse Hardin , Claude Kirchner

We consider the long-standing question of whether every regular LB-space is complete. This problem has been open since the 1950s and originates in Grothendieck's early work in functional analysis. Rather than seeking a direct proof or…

Functional Analysis · Mathematics 2026-04-28 Sven-Ake Wegner

This introduction begins with a section on fundamental notions of mathematical logic, including propositional logic, predicate or first-order logic, completeness, compactness, the L\"owenheim-Skolem theorem, Craig interpolation, Beth's…

Logic · Mathematics 2023-11-28 Anton Freund

We extend the meet-implication fragment of propositional intuitionistic logic with a meet-preserving modality. We give semantics based on semilattices and a duality result with a suitable notion of descriptive frame. As a consequence we…

Logic · Mathematics 2023-06-22 Jim de Groot , Dirk Pattinson

Provability logics are modal or polymodal systems designed for modeling the behavior of G\"odel's provability predicate in arithmetical theories and its natural extensions. If \Lambda is any ordinal, the G\"odel-L\"ob calculus GLP(\Lambda)…

Logic · Mathematics 2013-07-05 David Fernández-Duque

Let V be a simple vertex operator algebra and let G be a finite automorphism group of V. In [DY], it was shown that any irreducible V-module is a completely reducible V^G-module where V^G is the G-invariant sub-vertex operator algebra of V.…

Quantum Algebra · Mathematics 2007-05-23 Gaywalee Yamskulna

This paper is a mathematical investigation on Epstein semantics. One of the main tools of the present paper is the model-theoretic S-set construction introduced in (Krawczyk 2022). We use it to prove several results: 1) that each Epstein…

Logic · Mathematics 2025-06-09 Krzysztof A. Krawczyk

In a modular approach, we lift Hilbert-style proof systems for propositional, modal and first-order logic to generalized systems for their respective team-based extensions. We obtain sound and complete axiomatizations for the…

Logic in Computer Science · Computer Science 2018-03-28 Martin Lück

We discuss the problems of incompleteness and inexpressibility. We introduce almost self-referential formulas, use them to extend set theory, and relate their expressive power to that of infinitary logic. We discuss the nature of proper…

Logic · Mathematics 2016-12-20 Dmytro Taranovsky

Non-normal modal logics, interpreted on neighbourhood models which generalise the usual relational semantics, have found application in several areas, such as epistemic, deontic, and coalitional reasoning. We present here preliminary…

Logic in Computer Science · Computer Science 2022-07-04 Tiziano Dalmonte , Andrea Mazzullo , Ana Ozaki

This paper investigates the extension of lattice-based logics into modal languages. We observe that such extensions admit multiple approaches, as the interpretation of the necessity operator is not uniquely determined by the underlying…

Logic in Computer Science · Computer Science 2025-10-01 Alfredo R. Freire , Manuel A. Martins

For a finitely-generated vertex operator algebra of central charge c, a locally convex topological completion is constructed. We construct on the completion a structure of an algebra over the operad of the c/2-th power of the determinant…

Quantum Algebra · Mathematics 2007-05-23 Yi-Zhi Huang

A variety is said to be coherent if the finitely generated subalgebras of its finitely presented members are also finitely presented. In a recent paper by the authors it was shown that coherence forms a key ingredient of the uniform…

Logic · Mathematics 2019-02-08 Tomasz Kowalski , George Metcalfe

We show that C_2-cofiniteness is enough to prove a modular invariance property of vertex operator algebras without assuming the semisimplicity of Zhu algebra. For example, if a VOA V=\oplus_{m=0}^{\infty}V_m is C_2-cofinite, then the space…

Quantum Algebra · Mathematics 2007-05-23 Masahiko Miyamoto

We consider a modal logic that can formalise statements about uncertainty and beliefs such as `I think that my wallet is in the drawer rather than elsewhere' or `I am confused whether my appointment is on Monday or Tuesday'. To do that, we…

Logic · Mathematics 2025-12-01 Marta Bílková , Thomas M. Ferguson , Daniil Kozhemiachenko

Absolute algebras are a new type of algebraic structures, endowed with a meaningful notion of infinite sums of operations without supposing any underlying topology. Opposite to the usual definition of operadic calculus, they are defined as…

Algebraic Topology · Mathematics 2025-05-08 Victor Roca i Lucio

Fitting's Heyting-valued logic and Heyting-valued modal logic have already been studied from an algebraic viewpoint. In addition to algebraic axiomatizations with the completeness of Fitting's Heyting-valued logic and Heyting-valued modal…

Logic in Computer Science · Computer Science 2025-11-04 Litan Kumar Das , Kumar Sankar Ray , Prakash Chandra Mali

It has recently been discovered that both quantum and classical propositional logics can be modelled by classes of non-orthomodular and thus non-distributive lattices that properly contain standard orthomodular and Boolean classes,…

Logic in Computer Science · Computer Science 2008-12-17 Mladen Pavicic , Norman D. Megill

This paper is devoted to systematic studies of some extensions of first-order G\"odel logic. The first extension is the first-order rational G\"odel logic which is an extension of first-order G\"odel logic, enriched by countably many…

Judgment aggregation studies how to combine individual judgments on logically related propositions into a collective judgment. Classical impossibility results show that sufficiently strong logical interconnections force dictatorship under…

Logic in Computer Science · Computer Science 2026-05-25 Yutaka Nagai , Hirotaka Ono