English
Related papers

Related papers: The semantic conception of proof

200 papers

Translations between different nonmonotonic formalisms always have been an important topic in the field, in particular to understand the knowledge-representation capabilities those formalisms offer. We provide such an investigation in terms…

Artificial Intelligence · Computer Science 2014-01-17 Wolfgang Dvorak , Stefan Woltran

We introduce a novel semantics for a multi-agent epistemic operator of knowing how, based on an indistinguishability relation between plans. Our proposal is, arguably, closer to the standard presentation of knowing that modalities in…

Logic in Computer Science · Computer Science 2023-04-04 Carlos Areces , Raul Fervari , Andrés R. Saravia , Fernando R. Velázquez-Quesada

We present a logical framework that enables us to define a formal theory of computational trust in which this notion is analysed in terms of epistemic attitudes towards the possible objects of trust and in relation to existing evidence in…

Logic in Computer Science · Computer Science 2025-06-19 Francesco A. Genco

The idea that discourse relations are construed through explicit content and shared, or implicit, knowledge between producer and interpreter is ubiquitous in discourse research and linguistics. However, the actual contribution of the…

Computation and Language · Computer Science 2022-08-10 A. Reig-Alamillo , D. Torres-Moreno , E. Morales-González , M. Toledo-Acosta , A. Taroni , J. Hermosillo-Valadez

In this short paper, I present a few theorems on sentences of arithmetic which are related to Yablo's Paradox as G\"odel's first undecidable sentence was related to the Liar paradox. In particular, I consider two different arithemetizations…

Logic · Mathematics 2011-12-20 Graham Leach-Krouse

In this paper we propose a new perspective on the evolution and history of the idea of mathematical proof. Proofs will be studied at three levels: syntactical, semantical and pragmatical. Computer-assisted proofs will be give a special…

History and Overview · Mathematics 2007-05-23 Cristian S. Calude , Elena Calude , Solomon Marcus

I deal with two approaches to proof-theoretic semantics: one based on argument structures and justifications, which I call reducibility semantics, and one based on consequence among (sets of) formulas over atomic bases, called base…

Logic · Mathematics 2025-11-11 Antonio Piccolomini d'Aragona

A bilateralist take on proof-theoretic semantics can be understood as demanding of a proof system to display not only rules giving the connectives' provability conditions but also their refutability conditions. On such a view, then, a…

Logic in Computer Science · Computer Science 2025-10-17 Sara Ayhan

The persisting gap between the formal and the informal mathematics is due to an inadequate notion of mathematical theory behind the current formalization techniques. I mean the (informal) notion of axiomatic theory according to which a…

History and Overview · Mathematics 2011-09-21 Andrei Rodin

Defining various dishonest notions in a formal way is a key step to enable intelligent agents to act in untrustworthy environments. This review evaluates the literature for this topic by looking at formal definitions based on modal logic as…

Logic in Computer Science · Computer Science 2016-12-30 Toni Heidenreich

We show that the proof-theoretic notion of logical preorder coincides with the process-theoretic notion of contextual preorder for a CCS-like calculus obtained from the formula-as-process interpretation of a fragment of linear logic. The…

Logic in Computer Science · Computer Science 2019-02-20 Yuxin Deng , Iliano Cervesato , Robert J. Simmons

For those of us who generally live in the world of syntax, semantic proof techniques such as reducibility, realizability or logical relations seem somewhat magical despite -- or perhaps due to -- their seemingly unreasonable effectiveness.…

Programming Languages · Computer Science 2020-07-28 Pierre-Évariste Dagand , Lionel Rieg , Gabriel Scherer

This paper argues for a modal view of probability. The syntax and semantics of one particularly strong probability logic are discussed and some examples of the use of the logic are provided. We show that it is both natural and useful to…

Artificial Intelligence · Computer Science 2013-04-10 Alan M. Frisch , Peter Haddawy

We propose a formal treatment of scenarios in the context of a dialectical argumentation formalism for qualitative reasoning about uncertain propositions. Our formalism extends prior work in which arguments for and against uncertain…

Artificial Intelligence · Computer Science 2013-01-07 Peter McBurney , Simon Parsons

This is a short paper about the relationship between logic and computation. More specifically, it is about a relationship between the completeness proof for intuitionistic propositional logic within the form of proof-theoretic semantics…

Logic · Mathematics 2026-05-07 Tao Gu , David Pym , Eike Ritter , Edmund Robinson

The classical propositional logic is known to be sound and complete with respect to the set semantics that interprets connectives as set operations. The paper extends propositional language by a new binary modality that corresponds to…

Logic in Computer Science · Computer Science 2007-05-23 Pavel Naumov

The paper proposes a fresh look at the concept of goal and advances that motivational attitudes like desire, goal and intention are just facets of the broader notion of (acceptable) outcome. We propose to encode the preferences of an agent…

Logic in Computer Science · Computer Science 2022-09-13 Guido Governatori , Francesco Olivieri , Simone Scannapieco , Antonino Rotolo , Matteo Cristani

While previous sentiment analysis research has concentrated on the interpretation of explicitly stated opinions and attitudes, this work initiates the computational study of a type of opinion implicature (i.e., opinion-oriented inference)…

Computation and Language · Computer Science 2014-04-28 Janyce Wiebe , Lingjia Deng

We introduce a logical framework for reasoning about "uncertain interpretations" and investigate two key applications: a new semantics for implication capturing a kind of "meaning entailment", and a conservative notion of "evidentially…

Logic in Computer Science · Computer Science 2025-03-21 Adam Bjorndahl

The propositional logic is generalized on the real numbers field. The logical analog of the Bernoulli independent tests scheme is constructed. The variant of the nonstandard analysis is adopted for the definition of the logical function,…

General Mathematics · Mathematics 2010-09-15 G. A. Quznetsov