English
Related papers

Related papers: Gibbardian Collapse and Trivalent Conditionals

200 papers

In this paper we investigate the complexity of abduction, a fundamental and important form of non-monotonic reasoning. Given a knowledge base explaining the world's behavior it aims at finding an explanation for some observed manifestation.…

Computational Complexity · Computer Science 2010-06-28 Nadia Creignou , Johannes Schmidt , Michael Thomas

A theorem of alternatives provides a reduction of validity in a substructural logic to validity in its multiplicative fragment. Notable examples include a theorem of Arnon Avron that reduces the validity of a disjunction of multiplicative…

Logic · Mathematics 2020-02-27 Almudena Colacito , Nikolaos Galatos , George Metcalfe

In this short note, we find an equivalent combinatorial condition only involving finite sums under which a centered Gaussian random vector with multinomial covariance matrix satisfies the Gaussian product inequality (GPI) conjecture. These…

Probability · Mathematics 2023-08-24 Frédéric Ouimet

The union-closed sets conjecture (sometimes referred to as Frankl's conjecture) states that every finite, nontrivial union-closed family of sets has an element that is in at least half of its members. Although the conjecture is known to be…

Combinatorics · Mathematics 2025-12-03 Cory H. Colbert

Conditional logics play an important role in recent attempts to formulate theories of default reasoning. This paper investigates first-order conditional logic. We show that, as for first-order probabilistic logic, it is important not to…

Artificial Intelligence · Computer Science 2009-09-25 Nir Friedman , Joseph Y. Halpern , Daphne Koller

The goal of this paper is to construct a multivariate generalisation of the Grunwald-Letnikov derivative, a classical fractional derivative operator. To do so, we first produce a formalism of fractional derivatives in terms of infinitesimal…

General Mathematics · Mathematics 2019-04-08 Abhimanyu Pallavi Sudhir

We present variants of Goodstein's theorem that are equivalent to arithmetical comprehension and to arithmetical transfinite recursion, respectively, over a weak base theory. These variants differ from the usual Goodstein theorem in that…

Logic · Mathematics 2021-10-13 Juan P. Aguilera , Anton Freund , Michael Rathjen , Andreas Weiermann

A standard assumption for causal inference from observational data is that one has measured a sufficiently rich set of covariates to ensure that within covariate strata, subjects are exchangeable across observed treatment values. Skepticism…

Methodology · Statistics 2020-09-24 Eric J Tchetgen Tchetgen , Andrew Ying , Yifan Cui , Xu Shi , Wang Miao

This work considers reasons for and implications of discarding the assumption of transitivity, which (transitivity) is the fundamental postulate in the utility theory of Von Neumann and Morgenstern, the adiabatic accessibility principle of…

Economics · Quantitative Finance 2015-07-14 A. Y. Klimenko

In a recent paper, the author introduced an operational description of physical theories where probabilities are replaced by counterfactual statements belonging to a three-valued (i.e. possibilistic) semantic domain. The complete axiomatic…

Quantum Physics · Physics 2023-03-21 Eric Buffenoir

Automated decision support systems that are able to infer second opinions from experts can potentially facilitate a more efficient allocation of resources; they can help decide when and from whom to seek a second opinion. In this paper, we…

Machine Learning · Computer Science 2022-07-01 Nina L. Corvelo Benz , Manuel Gomez Rodriguez

We construct an internal language for cartesian closed bicategories. Precisely, we introduce a type theory modelling the structure of a cartesian closed bicategory and show that its syntactic model satisfies an appropriate universal…

Logic in Computer Science · Computer Science 2019-04-16 Marcelo Fiore , Philip Saville

We investigate relationships between versions of derivability conditions for provability predicates. We show several implications and non-implications between the conditions, and we discuss unprovability of consistency statements induced by…

Logic · Mathematics 2021-07-01 Taishi Kurahashi

An equational condition is a set of equations in an algebraic language, and an algebraic structure satisfies such a condition if it possesses terms that meet the required equations. We find a single nontrivial equational condition which is…

Logic · Mathematics 2017-10-18 Miroslav Olšák

Generic absoluteness is the phenomenon that certain truths in the set-theoretic universe remain stable under forcing expansions. A classical result by Kripke asserts that every complete Boolean algebra completely embeds into a countably…

Logic · Mathematics 2026-05-08 Cesare Straffelini

It is well-known that a Hilbert-style deduction system for first-order classical logic is sound and complete for a model theory built using all Boolean algebras as truth-value algebras if and only if it is sound and complete for a model…

Logic · Mathematics 2016-06-21 Richard DeJonghe , Kimberly Frey , Tom Imbo

In this paper we discuss contrastive explanations for formal argumentation - the question why a certain argument (the fact) can be accepted, whilst another argument (the foil) cannot be accepted under various extension-based semantics. The…

Artificial Intelligence · Computer Science 2022-01-26 AnneMarie Borg , Floris Bex

It is standard to regard the intuitionistic restriction of a classical logic as increasing the expressivity of the logic because the classical logic can be adequately represented in the intuitionistic logic by double-negation, while the…

Logic in Computer Science · Computer Science 2010-06-17 Kaustuv Chaudhuri

We present a cut elimination argument that witnesses the conservativity of the compositional axioms for truth (without the extended induction axiom) over any theory interpreting a weak subsystem of arithmetic. In doing so we also fix a…

Logic · Mathematics 2013-08-02 Graham E. Leigh

This article presents the concept of material interpretation as a method to transform classical proofs into constructive ones. Using the case study of maximal ideals in $\mathbb{Z}[X]$, it demonstrates how a classical implication $A \to B$…

Logic · Mathematics 2025-04-11 Franziskus Wiesnet