English
Related papers

Related papers: Truth and Subjunctive Theories of Knowledge: No Lu…

200 papers

The supervaluationist approach to fixed-point semantics is, arguably, the most celebrated and studied competitor to the Strong Kleene approach within Kripkean truth. In this paper, we show how to obtain supervaluationist fixed-point…

Logic · Mathematics 2025-11-21 Pablo Dopico

In this paper we show how to introduce a conditional to Kripke's theory of truth that respects the deduction theorem for the consequence relation associated with the theory. To this effect we develop a novel supervaluational framework,…

Logic · Mathematics 2024-07-22 Johannes Stern

This paper establishes a dual theory about knowledge and argumentation. Our idea is rooted at both epistemic logic and argumentation theory, and we aim to merge these two fields, not just in a superficial way but to thoroughly disclose the…

Logic in Computer Science · Computer Science 2022-09-28 Xinyu Wang , Momoka Fujieda

It is known that intuitionistic Kripke semantics can be generalized so that it can treat arbitrary propositional connectives characterized by truth functions. We extend this generalized Kripke semantics to first-order logic, and study how…

Logic · Mathematics 2022-05-13 Naosuke Matsuda , Kento Takagi

We consider a simple modal logic whose non-modal part has conjunction and disjunction as connectives and whose modalities come in adjoint pairs, but are not in general closure operators. Despite absence of negation and implication, and of…

Logic in Computer Science · Computer Science 2009-03-23 Mehrnoosh Sadrzadeh , Roy Dyckhoff

I show that the logic $\textsf{TJK}^{d+}$, one of the strongest logics currently known to support the naive theory of truth, is obtained from the Kripke semantics for constant domain intuitionistic logic by (i) dropping the requirement that…

Logic · Mathematics 2020-12-23 Ben Middleton

Many writers have observed that default logics appear to contain the "lottery paradox" of probability theory. This arises when a default "proof by contradiction" lets us conclude that a typical X is not a Y where Y is an unusual subclass of…

Artificial Intelligence · Computer Science 2013-04-08 Eric Neufeld , J. D. Horton

This paper studies axioms for nonmonotonic consequences from a semantics-based point of view, focusing on a class of mathematical structures for reasoning about partial information without a predefined syntax/logic. This structure is called…

Logic in Computer Science · Computer Science 2007-05-23 Guo-Qiang Zhang

Approximation fixpoint theory (AFT) is an abstract and general algebraic framework for studying the semantics of nonmonotonic logics. It provides a unifying study of the semantics of different formalisms for nonmonotonic reasoning, such as…

Artificial Intelligence · Computer Science 2022-12-02 Jesse Heyninck , Ofer Arieli , Bart Bogaerts

We generalize, by a progressive procedure, the notions of conjunction and disjunction of two conditional events to the case of $n$ conditional events. In our coherence-based approach, conjunctions and disjunctions are suitable conditional…

Probability · Mathematics 2019-09-27 Angelo Gilio , Giuseppe Sanfilippo

The usual semantics of multi-agent epistemic logic is based on Kripke models, defined in terms of binary relations on a set of possible worlds. Recently, there has been a growing interest in using simplicial complexes rather than graphs, as…

Logic in Computer Science · Computer Science 2026-02-09 Éric Goubault , Jérémy Ledent , Sergio Rajsbaum

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

This paper presents and discusses several methods for reasoning from inconsistent knowledge bases. A so-called argumentative-consequence relation taking into account the existence of consistent arguments in favor of a conclusion and the…

Artificial Intelligence · Computer Science 2013-03-08 Salem Benferhat , Didier Dubois , Henri Prade

The paper introduces a basic logic of knowledge and abduction by extending Levesque logic of only-knowing with an abduction modal operator defined via the combination of basic epistemic concepts. The upshot is an alternative approach to…

Artificial Intelligence · Computer Science 2026-01-09 Sanderson Molick , Vaishak Belle

We introduce the notions of weakly *-concave and weakly naturally quasi-concave correspondence and prove fixed point theorems and continuous selection theorems for these kind of correspondences. As applications in the game theory, by using…

Optimization and Control · Mathematics 2013-03-29 Monica Patriche

This paper combines two studies: a topological semantics for epistemic notions and abstract argumentation theory. In our combined setting, we use a topological semantics to represent the structure of an agent's collection of evidence, and…

Artificial Intelligence · Computer Science 2017-07-28 Chenwei Shi , Sonja Smets , Fernando R. Velázquez-Quesada

Nonmonotonic reasoning is a pattern of reasoning that allows an agent to make and retract (tentative) conclusions from inconclusive evidence. This paper gives a possible-worlds interpretation of the nonmonotonic reasoning problem based on…

Artificial Intelligence · Computer Science 2013-04-10 Carl Kadie

A non-distributive two-sorted hypersequent calculus \textbf{PDBL} and its modal extension \textbf{MPDBL} are proposed for the classes of pure double Boolean algebras and pure double Boolean algebras with operators respectively. A relational…

Logic · Mathematics 2022-07-25 Prosenjit Howlader , Mohua Banerjee

The paper proposes and studies new classical, type-free theories of truth and determinateness with unprecedented features. The theories are fully compositional, strongly classical (namely, their internal and external logics are both…

Logic · Mathematics 2026-01-14 Luca Castaldo , Carlo Nicolai

These lectures deal with the problem of inductive inference, that is, the problem of reasoning under conditions of incomplete information. Is there a general method for handling uncertainty? Or, at least, are there rules that could in…

Data Analysis, Statistics and Probability · Physics 2016-09-08 Ariel Caticha
‹ Prev 1 2 3 10 Next ›