English
Related papers

Related papers: An Arithmetical Interpretation of Verification and…

200 papers

Mathematical proof aims to deliver confident conclusions, but a very similar process of deduction can be used to make uncertain estimates that are open to revision. A key ingredient in such reasoning is the use of a "default" estimate of…

Artificial Intelligence · Computer Science 2022-11-15 Paul Christiano , Eric Neyman , Mark Xu

Moores Paradox is a test case for any formal theory of belief. In Knowledge and Belief, Hintikka developed a multimodal logic for statements that express sentences containing the epistemic notions of knowledge and belief. His account…

Logic in Computer Science · Computer Science 2020-06-23 Andrés Páez

Mathematical proofs are both paradigms of certainty and some of the most explicitly-justified arguments that we have in the cultural record. Their very explicitness, however, leads to a paradox, because the probability of error grows…

Symbolic Computation · Computer Science 2022-04-13 Scott Viteri , Simon DeDeo

We introduce a basic intuitionistic conditional logic $\mathsf{IntCK}$ that we show to be complete both relative to a special type of Kripke models and relative to a standard translation into first-order intuitionistic logic. We show that…

Logic · Mathematics 2023-06-21 Grigory Olkhovikov

Expectation is a central notion in probability theory. The notion of expectation also makes sense for other notions of uncertainty. We introduce a propositional logic for reasoning about expectation, where the semantics depends on the…

Artificial Intelligence · Computer Science 2014-07-29 Joseph Y. Halpern , Riccardo Pucella

By using the abstract structures investigated in the first Part of this article, we develop a semantics for an epistemic language, which expresses sentences like "Alice knows that Bob does not understand that PI is irrational". One is…

Logical inference leads to one of the major interpretations of probability theory called logical interpretation, in which the probability is seen as a measure of the plausibility of a logical statement under incomplete information. In this…

Quantum Physics · Physics 2022-01-03 Tsubasa Ichikawa

The classical view of epistemic logic is that an agent knows all the logical consequences of their knowledge base. This assumption of logical omniscience is often unrealistic and makes reasoning computationally intractable. One approach to…

Artificial Intelligence · Computer Science 2018-05-09 Yijia Chen , Abdallah Saffidine , Christoph Schwering

We find a translation with particularly nice properties from intuitionistic propositional logic in countably many variables to intuitionistic propositional logic in two variables. In addition, the existence of a possibly-not-as-nice…

Logic · Mathematics 2007-05-23 Michael O'Connor

Quantified propositional intuitionistic logic is obtained from propositional intuitionistic logic by adding quantifiers \forall p, \exists p over propositions. In the context of Kripke semantics, a proposition is a subset of the worlds in a…

Logic · Mathematics 2015-04-21 Richard Zach

We report our findings on the properties of Flagg and Friedman's translation from Epistemic into Intuitionistic logic, which was proposed as the basis of a comprehensive proof method for the faithfulness of the Goodel translation. We focus…

Logic in Computer Science · Computer Science 2015-11-24 Alessandro Provetti , Andrea Zucchellini

Belief merging is an important but difficult problem in Artificial Intelligence, especially when sources of information are pervaded with uncertainty. Many merging operators have been proposed to deal with this problem in possibilistic…

Artificial Intelligence · Computer Science 2012-03-19 Guilin Qi , Jianfeng Du , Weiru Liu , David A. Bell

This paper makes a first step towards a logic of learning from experiments. For this, we investigate formal frameworks for modeling the interaction of causal and (qualitative) epistemic reasoning. Crucial for our approach is the idea that…

Artificial Intelligence · Computer Science 2021-12-02 Fausto Barbero , Katrin Schulz , Fernando R. Velázquez-Quesada , Kaibo Xie

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

We present a type of epistemic logics that encapsulates both the dynamics of acquiring knowledge (knowing) and losing information (forgetting), alongside the integration of group knowledge concepts. Our approach is underpinned by a system…

Logic in Computer Science · Computer Science 2024-10-31 Xiaolong Liang , Yì N. Wáng

What is the proper explanation of intuitionistic hypothetical judgment, and thence propositional implication? The answer is unclear from the writings of Brouwer and Heyting, who in their lifetimes propounded multiple (sometimes conflicting)…

Logic in Computer Science · Computer Science 2015-11-30 Jonathan Sterling

Inquisitive modal logic, InqML, is a generalisation of standard Kripke-style modal logic. In its epistemic incarnation, it extends standard epistemic logic to capture not just the information that agents have, but also the questions that…

Logic in Computer Science · Computer Science 2017-07-28 Ivano Ciardelli , Martin Otto

We present automated theorem provers for the first-order logic of here and there (HT). They are based on a native sequent calculus for the logic of HT and an axiomatic embedding of the logic of HT into intuitionistic logic. The analytic…

Logic in Computer Science · Computer Science 2026-01-08 Jens Otten , Torsten Schaub

How do people understand and evaluate claims about others' beliefs, even though these beliefs cannot be directly observed? In this paper, we introduce a cognitive model of epistemic language interpretation, grounded in Bayesian inferences…

Computation and Language · Computer Science 2025-04-21 Lance Ying , Tan Zhi-Xuan , Lionel Wong , Vikash Mansinghka , Joshua B. Tenenbaum

We show that intuitionistic logic is deductively equivalent to Connexive Heyting Logic (CHL), hereby introduced as an example of a strong connexive logic with intuitive semantics. We use the reverse algebraisation paradigm: CHL is presented…

Logic · Mathematics 2022-09-01 Davide Fazio , Antonio Ledda , Francesco Paoli