English
Related papers

Related papers: Correspondence Theory for Many-valued Modal Logic

200 papers

In this paper we discuss some topics related to the general theory of frames. In particular we focus our attention to the existence of different 'reconstruction formulas' for a given vector of a certain Hilbert space and to some refinement…

funct-an · Mathematics 2008-02-03 Fabio Bagarello

This paper focuses on resolution in linguistic first order logic with truth value taken from linear symmetrical hedge algebra. We build the basic components of linguistic first order logic, including syntax and semantics. We present a…

Logic in Computer Science · Computer Science 2014-04-01 Thi-Minh-Tam Nguyen , Viet-Trung Vu , The-Vinh Doan , Duc-Khanh Tran

The theory of finite term algebras provides a natural framework to describe the semantics of functional languages. The ability to efficiently reason about term algebras is essential to automate program analysis and verification for…

Logic in Computer Science · Computer Science 2016-11-10 Laura Kovacs , Simon Robillard , Andrei Voronkov

The paper explores categorical interconnections between lattice-valued Relational systems and algebras of Fitting's lattice-valued modal logic. We define lattice-valued boolean systems, and then we study co-adjointness, adjointness of…

Category Theory · Mathematics 2018-08-21 Kumar Sankar Ray , Litan Kumar Das

Categories enriched over a commutative unital quantale can be studied as generalized, or many-valued, ordered structures. Because many concepts, such as complete distributivity, in lattice theory can be characterized by existence of certain…

Category Theory · Mathematics 2007-05-23 Hongliang Lai , Dexue Zhang

This paper studies the complexity of classical modal logics and of their extension with fixed-point operators, using translations to transfer results across logics. In particular, we show several complexity results for multi-agent logics…

Logic in Computer Science · Computer Science 2022-09-22 Luca Aceto , Antonis Achilleos , Elli Anastasiadi , Adrian Francalanza , Anna Ingolfsdottir

We present a family of paraconsistent counterparts of the constructive modal logic CK. These logics aim to formalise reasoning about contradictory but non-trivial propositional attitudes like beliefs or obligations. We define their…

Logic in Computer Science · Computer Science 2025-08-26 Han Gao , Daniil Kozhemiachenko , Nicola Olivetti

The finite set of subsystems of a finite quantum system with variables in ${\mathbb Z}(n)$, is studied as a Heyting algebra. The physical meaning of the logical connectives is discussed. It is shown that disjunction of subsystems is more…

Quantum Physics · Physics 2015-06-17 A. Vourdas

In this paper, we use the framework of neural machine translation to learn joint sentence representations across six very different languages. Our aim is that a representation which is independent of the language, is likely to capture the…

Computation and Language · Computer Science 2017-08-09 Holger Schwenk , Matthijs Douze

We provide a recursive construction of all the semi-Heyting algebras that can be defined on a chain with $n$ elements. This construction allows us to count them easily. We also compare the formula for the number of semi-Heyting chains thus…

Logic · Mathematics 2021-03-19 Luiz F. Monteiro , Juan Manuel Cornejo , Ignacio D. Viglizzo

The widespread usage of latent language representations via pre-trained language models (LMs) suggests that they are a promising source of structured knowledge. However, existing methods focus only on a single object per subject-relation…

Computation and Language · Computer Science 2023-07-10 Sneha Singhania , Simon Razniewski , Gerhard Weikum

A review is given of recent work aimed at constructing a quantum theory of cosmology in which all observables refer to information measurable by observers inside the universe. At the classical level the algebra of observables should be…

High Energy Physics - Theory · Physics 2009-10-31 Fotini Markopoulou

Sahlqvist theory is extended to the fragments of the intuitionistic propositional calculus that include the conjunction connective. This allows us to introduce a Sahlqvist theory of intuitionistic character amenable to arbitrary…

Logic · Mathematics 2025-02-05 Damiano Fornasiere , Tommaso Moraschini

A finite-dimensional Hilbert space is usually described in terms of an orthonormal basis, but in certain approaches or applications a description in terms of a finite overcomplete system of vectors, called a finite tight frame, may offer…

Mathematical Physics · Physics 2010-04-22 Nicolae Cotfas , Jean Pierre Gazeau

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

We investigate the equational theory of Kleene algebra terms with variable complements -- (language) complement where it applies only to variables -- w.r.t. languages. While the equational theory w.r.t. languages coincides with the language…

Logic in Computer Science · Computer Science 2023-09-07 Yoshiki Nakamura , Ryoma Sin'ya

A theorem of Eilenberg establishes that there exists a bijection between the set of all varieties of regular languages and the set of all varieties of finite monoids. In this article after defining, for a fixed set of sorts $S$ and a fixed…

Formal Languages and Automata Theory · Computer Science 2024-01-18 Juan Climent Vidal , Enric Cosme Llópez

The foundational character of certain algebraic structures as Boolean algebras and Heyting algebras is rooted in their potential to model classical and constructive logic, respectively. In this paper we discuss the contributions of…

Rings and Algebras · Mathematics 2014-09-16 João Pita Costa , Primož Škraba , Mikael Vejdemo-Johansson

A new analytic framework is first formalized via the usage of the Monadology (Leibniz 1898), to expand the understanding of Zermelo-Fraenkel-choice set theory (ZFC) and Von Neumann-Bernays-Godel set theory (NBG). Implicitly, the framework…

Information Theory · Computer Science 2024-04-02 Xiangjun Peng

This paper studies the geometric and algebraic aspects of the moduli spaces of quivers of fence type. We first provide two quotient presentations of the quiver varieties and interpret their equivalence as a generalized Gelfand-MacPherson…

Algebraic Geometry · Mathematics 2013-01-15 Yi Hu , Sangjib Kim