English
Related papers

Related papers: Propositional Logics for the Lawvere Quantale

200 papers

Enriched Lawvere theories are a generalization of Lawvere theories that allow us to describe the operational semantics of formal systems. For example, a graph enriched Lawvere theory describes structures that have a graph of operations of…

Category Theory · Mathematics 2020-09-16 John C. Baez , Christian Williams

We study various formulations of the completeness of first-order logic phrased in constructive type theory and mechanised in the Coq proof assistant. Specifically, we examine the completeness of variants of classical and intuitionistic…

Logic in Computer Science · Computer Science 2021-12-15 Yannick Forster , Dominik Kirst , Dominik Wehr

This paper obtains a completeness result for inequational reasoning with applicative terms without variables in a setting where the intended semantic models are the full structures, the full type hierarchies over preorders for the base…

Logic in Computer Science · Computer Science 2022-02-18 Lawrence S. Moss , Thomas F. Icard

We present a logic named L_{LF} whose intended use is to formalize properties of specifications developed in the dependently typed lambda calculus LF. The logic is parameterized by the LF signature that constitutes the specification. Atomic…

Logic in Computer Science · Computer Science 2022-04-12 Gopalan Nadathur , Mary Southern

We introduce a two-sort weighted modal logic for possibilistic reasoning with fuzzy formal contexts. The syntax of the logic includes two types of weighted modal operators corresponding to classical necessity ($\Box$) and sufficiency…

Logic in Computer Science · Computer Science 2026-01-01 Prosenjit Howlader , Churn-Jung Liau

Beginning with a simple semantics for propositions, based on counting observations, it is shown that probabilistic and fuzzy logic correspond to two different heuristic assumptions regarding the combination of propositions whose evidence…

Artificial Intelligence · Computer Science 2020-09-29 Ben Goertzel

The first contribution of this paper is the presentation of a Pavelka - like formulation of possibilistic logic in which the language is naturally enriched by two connectives which represent negation (eg) and a new type of conjunction…

Artificial Intelligence · Computer Science 2013-02-21 Luca Boldrin , Claudio Sossai

This paper introduces the logic $QLET_{F}$, a quantified extension of the logic of evidence and truth $LET_{F}$, together with a corresponding sound and complete first-order non-deterministic valuation semantics. $LET_{F}$ is a…

Logic · Mathematics 2021-06-21 H. Antunes , A. Rodrigues , W. Carnielli , M. E. Coniglio

The exponential modalities of linear logic have been used by various authors to model infinite-dimensional quantum systems. This paper explains how these modalities can also give rise to the complementarity principle of quantum mechanics.…

Category Theory · Mathematics 2022-11-04 Robin Cockett , Priyaa Varshinee Srinivasan

The basic principles and results of Conservative Logic introduced by Fredkin and Toffoli on the basis of a seminal paper of Landauer are extended to d-valued logics, with a special attention to three-valued logics. Different approaches to…

Quantum Physics · Physics 2009-11-07 Gianpiero Cattaneo , Alberto Leporati , Roberto Leporini

In this paper we prove that three of the main propositional logics of dependence (including propositional dependence logic and inquisitive logic), none of which is structural, are structurally complete with respect to a class of…

Logic · Mathematics 2018-12-19 Rosalie Iemhoff , Fan Yang

We study a real valued propositional logic with unbounded positive and negative truth values that we call R-valued logic. Such logic slightly extends continuous propositional logic which, in turn, builds on Lukasiewicz many-valued logic.…

Logic · Mathematics 2015-12-16 Stefano Baratella , Domenico Zambella

We can measure the complexity of a logical formula by counting the number of alternations between existential and universal quantifiers. Suppose that an elementary first-order formula $\varphi$ (in $\mathcal{L}_{\omega,\omega}$) is…

Logic · Mathematics 2025-02-05 Matthew Harrison-Trainor , Miles Kretschmer

Fuzzy logic extends the classical truth values "true" and "false" with additional truth degrees in between. More specifically, fuzzy modal logics in this sense are given by a choice of fuzzy modalities and a fuzzy propositional base. It has…

Logic in Computer Science · Computer Science 2026-02-13 Stefan Gebhart , Lutz Schröder , Paul Wild

When a physicist performs a quantic measurement, new information about the system at hand is gathered. This paper studies the logical properties of how this new information is combined with previous information. It presents Quantum Logic as…

Quantum Physics · Physics 2008-02-24 Daniel Lehmann

The framework of quantitative equational logic has been successfully applied to reason about algebras whose carriers are metric spaces and operations are nonexpansive. We extend this framework in two orthogonal directions: algebras endowed…

Logic in Computer Science · Computer Science 2022-01-25 Matteo Mio , Ralph Sarkis , Valeria Vignudelli

We present a linearity theorem for a proof language of intuitionistic multiplicative additive linear logic, incorporating addition and scalar multiplication. The proofs in this language are linear in the algebraic sense. This work is part…

Logic in Computer Science · Computer Science 2025-09-25 Alejandro Díaz-Caro , Gilles Dowek

The one-variable fragment of any first-order logic may be considered as a modal logic, where the universal and existential quantifiers are replaced by a box and diamond modality, respectively. In several cases, axiomatizations of algebraic…

Logic · Mathematics 2022-09-20 Petr Cintula , George Metcalfe , Naomi Tokuda

Cumulative logics are studied in an abstract setting, i.e., without connectives, very much in the spirit of Makinson's early work. A powerful representation theorem characterizes those logics by choice functions that satisfy a weakening of…

Artificial Intelligence · Computer Science 2007-05-23 Daniel Lehmann

Building on our previous work on enriched regular logic, we introduce an enriched version of positive logic and relate it to enriched cone-injectivity classes and enriched accessible categories. To do this, we need a factorization system on…

Category Theory · Mathematics 2025-09-25 Jiří Rosický , Giacomo Tendas