English
Related papers

Related papers: Algebraisable versions of predicate topological lo…

200 papers

We show that the infinite symmetric product of a connected graded-commutative algebra over the rationals is naturally isomorphic to the free graded-commutative algebra on the positive degree subspace of the original algebra. In particular,…

Rings and Algebras · Mathematics 2021-11-09 Jiahao Hu , Aleksandar Milivojević

Monadic second order logic and linear temporal logic are two logical formalisms that can be used to describe classes of infinite words, i.e., first-order models based on the natural numbers with order, successor, and finitely many unary…

Logic · Mathematics 2016-05-02 Silvio Ghilardi , Samuel J. van Gool

Uniform interpolation is the property that, for any formula and set of atoms, there exists the strongest consequence omitting those atoms. It plays a central role in knowledge representation and reasoning tasks such as knowledge update and…

Logic in Computer Science · Computer Science 2026-03-31 Kexu Wang , Liangda Fang

We introduce a novel real-valued endogenous logic for expressing properties of probabilistic transition systems called Riesz modal logic. The design of the syntax and semantics of this logic is directly inspired by the theory of Riesz…

Logic in Computer Science · Computer Science 2023-06-22 Robert Furber , Radu Mardare , Matteo Mio

There are many examples of dualities between topological spaces and algebras in the literature. Particularly, many of those examples come from the algebraic counterpart of a logical system, e.g, boolean and heyting algebras, MV-algebras,…

Category Theory · Mathematics 2023-11-08 Mayk de Andrade , Hugo Mariano

A famous result, conjectured by G\"odel in 1932 and proved by McKinsey and Tarski in 1948, says that $\varphi$ is a theorem of intuitionistic propositional logic IPC iff its G\"odel-translation $\varphi'$ is a theorem of modal logic S4. In…

Logic in Computer Science · Computer Science 2015-08-05 Steffen Lewitzka

We show that if we enrich first order logic by allowing quantification over isomorphisms between definable ordered fields the resulting logic, L(Q_{Of}), is fully compact. In this logic, we can give standard compactness proofs of various…

Logic · Mathematics 2016-09-06 Alan H. Mekler , Saharon Shelah

Finite topological spaces are in bijective correspondence with preorders on finite sets. We undertake their study using combinatorial tools that have been developed to investigate general discrete structures. A particular emphasis will be…

Algebraic Topology · Mathematics 2015-09-04 Loïc Foissy , Claudia Malvenuto , Frédéric Patras

We start a systematic investigation of the size of Craig interpolants, uniform interpolants, and strongest implicates for (quasi-)normal modal logics. Our main upper bound states that for tabular modal logics, the computation of strongest…

Logic in Computer Science · Computer Science 2026-05-15 Balder ten Cate , Louwe Kuijer , Frank Wolter

We study infinite dimensional tilting modules over a concealed canonical algebra of domestic or tubular type. In the domestic case, such tilting modules are constructed by using the technique of universal localization, and they can be…

Representation Theory · Mathematics 2019-11-07 Lidia Angeleri Hügel , Dirk Kussin

Non-classical generalizations of classical modal logic have been developed in the contexts of constructive mathematics and natural language semantics. In this paper, we discuss a general approach to the semantics of non-classical modal…

Logic · Mathematics 2024-06-25 Wesley H. Holliday

Consider a finite-dimensional algebra $A$ and any of its moduli spaces $\mathcal{M}(A,\mathbf{d})^{ss}_{\theta}$ of representations. We prove a decomposition theorem which relates any irreducible component of…

Representation Theory · Mathematics 2018-09-25 Calin Chindris , Ryan Kinser

The aim of this paper is to show that even if the natural algebraic semantic for modal (normal) logic is modal algebra, the more general class of subordination algebras (roughly speaking, the non symmetric contact algebras) is adequate too…

Logic · Mathematics 2020-06-17 Laurent De Rudder , Georges Hansoul , Valentine Stetenfeld

This paper considers two logics. The first one, $\mathbf{K}\mathsf{G}_\mathsf{inv}$, is an expansion of the G\"odel modal logic $\mathbf{K}\mathsf{G}$ with the involutive negation $\sim_\mathsf{i}$ defined as…

Logic · Mathematics 2024-01-30 Marta Bilkova , Thomas Ferguson , Daniil Kozhemiachenko

(Pre)closure spaces are a generalization of topological spaces covering also the notion of neighbourhood in discrete structures, widely used to model and reason about spatial aspects of distributed systems. In this paper we introduce an…

Logic in Computer Science · Computer Science 2021-01-01 Davide Castelnovo , Marino Miculan

On relational structures and on polymodal logics, we describe operations which preserve local tabularity. This provides new sufficient semantic and axiomatic conditions for local tabularity of a modal logic. The main results are the…

Logic · Mathematics 2025-07-16 Ilya B. Shapirovsky

We study operator spaces, operator algebras, and operator modules, from the point of view of the `noncommutative Shilov boundary'. In this attempt to utilize some `noncommutative Choquet theory', we find that Hilbert C$^*-$modules and their…

Operator Algebras · Mathematics 2007-05-23 David P. Blecher

We introduce the notion of implicative algebra, a simple algebraic structure intended to factorize the model constructions underlying forcing and realizability (both in intuitionistic and classical logic). The salient feature of this…

Logic · Mathematics 2020-07-15 Alexandre Miquel

In this paper we continue the study of the variety $\mathbb{MG}$ of monadic G\"odel algebras. These algebras are the equivalent algebraic semantics of the S5-modal expansion of G\"odel logic, which is equivalent to the one-variable monadic…

The logical parallelism of propositional connectives and type constructors extends beyond the static realm of predicates, to the dynamic realm of processes. Understanding the logical parallelism of process propositions and dynamic types was…

Logic in Computer Science · Computer Science 2023-11-03 Dusko Pavlovic
‹ Prev 1 4 5 6 7 8 10 Next ›