English
Related papers

Related papers: Algebraic Semantics for the Logic of Proofs

200 papers

We present a propositional logic with fundamental probabilistic semantics, in which each formula is given a real measure in the interval $[0,1]$ that represents its degree of truth. This semantics replaces the binarity of classical logic,…

Logic in Computer Science · Computer Science 2025-05-22 Francisco Aragão

This paper is a contribution to understanding what properties should a topological algebra on a Stone space satisfy to be profinite. We reformulate and simplify proofs for some known properties using syntactic congruences. We also clarify…

General Topology · Mathematics 2023-01-31 Jorge Almeida , Herman Goulet-Ouellet , Ondřej Klíma

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

Logic in Computer Science · Computer Science 2025-06-03 Yoshiki Nakamura , Ryoma Sin'ya

This chapter provides an introduction to some basic concepts of epistemic logic, basic formal languages, their semantics, and proof systems. It also contains an overview of the handbook, and a brief history of epistemic logic and pointers…

Artificial Intelligence · Computer Science 2015-03-04 Hans van Ditmarsch , Joseph Y. Halpern , Wiebe van der Hoek , Barteld Kooi

Underlying the theory of inferences, a primary task of logic is language analysis. Such a task can be understood as depending on a general theory of representation, taking as a starting point the idea that some entities (`` representations…

Logic in Computer Science · Computer Science 2023-07-21 Arnaud Plagnol

We investigate the expressive power of a Turing-complete logic based on game-theoretic semantics. By defining suitable fragments and variants of the logic, we obtain a range of natural characterizations for some fundamental families of…

Logic · Mathematics 2023-04-14 Antti Kuusisto

A new syntactic characterization of problems complete via Turing reductions is presented. General canonical forms are developed in order to define such problems. One of these forms allows us to define complete problems on ordered…

Computational Complexity · Computer Science 2014-11-25 Vladimir Naidenko

Propositional logic serves as a fundamental cornerstone in mathematical logic. This paper delves into a semiring characterization of propositional logic, employing the Gr\"oebner-Shirshov basis theory to furnish an algebraic framework for…

Logic · Mathematics 2024-01-18 Wenxi Li , Zhongzhi Wang

In R.D. Sorkin's framework for logic in physics a clear separation is made between the collection of unasserted propositions about the physical world and the affirmation or denial of these propositions by the physical world. The unasserted…

Quantum Physics · Physics 2018-02-16 Kate Clements , Fay Dowker , Petros Wallden

Game semantics and winning strategies offer a potential conceptual bridge between semantics and proof systems of logics. We illustrate this link for hybrid logic -- an extension of modal logic that allows for explicit reference to worlds…

Logic in Computer Science · Computer Science 2022-06-02 Robert Freiman

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

Debates concerning philosophical grounds for the validity of classical and intuitionistic logics often have the very nature of logical proofs as one of the main points of controversy. The intuitionist advocates for a strict notion of…

Logic in Computer Science · Computer Science 2025-04-07 Victor Nascimento , Luiz Carlos Pereira , Elaine Pimentel

Although reasoning about equations over strings has been extensively studied for several decades, little research has been done for equational reasoning on general clauses over strings. This paper introduces a new superposition calculus…

Logic in Computer Science · Computer Science 2025-03-12 Dohan Kim

In this paper, we introduce and investigate monadic NM-algebras: a variety of NM-algebras equipped with universal quantifiers. Also, we obtain some conditions under which monadic NM-algebras become monadic Boolean algebras. Besides, we show…

Logic · Mathematics 2017-09-15 Jun Tao Wang , Xiao Long Xin , Peng Fei He

Proofs, in Ludics, have an interpretation provided by their counter-proofs, that is the objects they interact with. We follow the same idea by proposing that sentence meanings are given by the counter-meanings they are opposed to in a…

Computation and Language · Computer Science 2009-10-09 Alain Lecomte , Myriam Quatrini

Using recent results in topos theory, two systems of higher-order logic are shown to be complete with respect to sheaf models over topological spaces---so-called ``topological semantics''. The first is classical higher-order logic, with…

Logic · Mathematics 2023-03-31 Steve Awodey , Carsten Butz

We provide a new foundational approach to the generalization of terms up to equational theories. We interpret generalization problems in a universal-algebraic setting making a key use of projective and exact algebras in the variety…

Logic · Mathematics 2026-03-31 Tommaso Flaminio , Sara Ugolini

Real-valued logics underlie an increasing number of neuro-symbolic approaches, though typically their logical inference capabilities are characterized only qualitatively. We provide foundations for establishing the correctness and power of…

Logic in Computer Science · Computer Science 2022-09-01 Ronald Fagin , Ryan Riegel , Alexander Gray

Christine Tasson introduced an algebraic notion of totality for a denotational model of linear logic in the category of vector spaces. The notion of total boolean function is, in a way, quite intuitive. This note provides a positive answer…

Logic in Computer Science · Computer Science 2009-11-03 Pierre Hyvernat

Boolean calculus has been studied extensively in the past in the context of switching circuits, error-correcting codes etc. This work generalizes several approaches to defining a differential calculus for Boolean functions. A unified theory…

Rings and Algebras · Mathematics 2020-02-06 Sriram Nagaraj