English
Related papers

Related papers: Iterated reflection principles over full disquotat…

200 papers

In this article, we consider iteration principles for contraction, with the goal of identifying properties for contractions that respect conditional beliefs. Therefore, we investigate and evaluate four groups of iteration principles for…

Artificial Intelligence · Computer Science 2022-02-08 Kai Sauerwald , Gabriele Kern-Isberner , Christoph Beierle

The logic of bunched implication BI provides a framework for reasoning about resource composition and forms the basis for an assertion language of separation logic which is used to reason about software programs. Propositional BI is…

Logic in Computer Science · Computer Science 2026-01-06 Revantha Ramanayake

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

Computability logic is a formal theory of (interactive) computability in the same sense as classical logic is a formal theory of truth. This approach was initiated very recently in "Introduction to computability logic" (Annals of Pure and…

Logic in Computer Science · Computer Science 2011-04-15 Giorgi Japaridze

Classically, any structure for a signature $\Sigma$ may be completed to a model of a desired regular theory $T$ by means of the chase construction or small object argument. Moreover, this exhibits $\mathrm{Mod}(T)$ as weakly reflective in…

Logic · Mathematics 2026-04-14 Henrik Forssell , Peter LeFanu Lumsdaine

We review recent work that employs the framework of logical inference to establish a bridge between data gathered through experiments and their objective description in terms of human-made concepts. It is shown that logical inference…

Quantum Physics · Physics 2016-09-28 H. De Raedt , M. I. Katsnelson , K. Michielsen

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

Suszko's problem is the problem of finding the minimal number of truth values needed to semantically characterize a syntactic consequence relation. Suszko proved that every Tarskian consequence relation can be characterized using only two…

Logic · Mathematics 2019-02-12 Emmanuel Chemla , Paul Egré

Bernays introduced a method for proving underivability results in propositional calculi by truth tables. In general, this motivates an investigations of how to find, given a propositional logic, a finite-valued logic which has as few…

Logic · Mathematics 2022-01-31 Matthias Baaz , Richard Zach

This paper will develop a single framework for unifying, simplifying and extending our prior results about axiom systems that retain a partial knowledge of their own consistency, via an axiomatic declaration of self-consistency. Its perhaps…

Logic · Mathematics 2012-01-04 Dan E. Willard

In this paper we consider the class of truth-functional many-valued logics with a finite set of truth-values. The main result of this paper is the development of a new \emph{binary} sequent calculi (each sequent is a pair of formulae) for…

Logic in Computer Science · Computer Science 2011-03-08 Zoran Majkic

Bi-intuitionistic logic is the conservative extension of intuitionistic logic with a connective dual to implication. It is sometimes presented as a symmetric constructive subsystem of classical logic. In this paper, we compare three sequent…

Logic in Computer Science · Computer Science 2011-01-31 Luís Pinto , Tarmo Uustalu

Uniform interpolation is a strengthening of interpolation that holds for certain propositional logics. The starting point of this chapter is a theorem of A. Pitts, which shows that uniform interpolation holds for intuitionistic…

Logic · Mathematics 2026-02-11 Sam van Gool

In this paper, we study logics of dependence on the propositional level. We prove that several interesting propositional logics of dependence, including propositional dependence logic, propositional intuitionistic dependence logic as well…

Logic · Mathematics 2018-12-19 Fan Yang , Jouko Väänänen

Argumentation is a non-monotonic process. This reflects the fact that argumentation involves uncertain information, and so new information can cause a change in the conclusions drawn. However, the base logic does not need to be…

Artificial Intelligence · Computer Science 2018-09-05 Anthony Hunter

The question of how irreversibility can emerge as a generic phenomena when the underlying mechanical theory is reversible has been a long-standing fundamental problem for both classical and quantum mechanics. We describe a mechanism for the…

Quantum Physics · Physics 2013-09-20 Cozmin Ududec , Nathan Wiebe , Joseph Emerson

We investigate an unsuspected connection between logical connectives with non-harmonious deduction rules, such as Prior's tonk, and quantum computing. We argue that these connectives model the information-erasure, the non-reversibility, and…

Logic in Computer Science · Computer Science 2023-09-19 Alejandro Díaz-Caro , Gilles Dowek

This paper introduces Reflective Empiricism, an extension of empirical science that incorporates subjective perception and consciousness processes as equally valid sources of knowledge. It views reality as an interplay of subjective…

Physics and Society · Physics 2025-04-18 Oliver Marc Wittwer

We systematically investigate the complexity of model checking the existential positive fragment of first-order logic. In particular, for a set of existential positive sentences, we consider model checking where the sentence is restricted…

Logic in Computer Science · Computer Science 2015-03-20 Hubie Chen

Defeasible logic is a rule-based nonmonotonic logic, with both strict and defeasible rules, and a priority relation on rules. We show that inference in the propositional form of the logic can be performed in linear time. This contrasts…

Artificial Intelligence · Computer Science 2009-09-29 Michael J. Maher