English
Related papers

Related papers: Gibbardian Collapse and Trivalent Conditionals

200 papers

We detail some ways in which the study of three-valued logics of indicative conditionals can be extended by further adding a new truth-value. Our approach heavily relies on twist constructions, which have been already used in the literature…

Logic · Mathematics 2025-10-28 Miguel Muñoz Pérez

It is well-known that extending the Hilbert axiomatic system for first-order intuitionistic logic with an exclusion operator, that is dual to implication, collapses the domains of models into a constant domain. This makes it an interesting…

Logic in Computer Science · Computer Science 2024-11-20 Tim S. Lyon , Ian Shillito , Alwen Tiu

We introduce the notion of implicative algebra, a simple algebraic structure intended to factorize the model constructions underlying forcing and realizability (both in intuitionistic and classical logic). The salient feature of this…

Logic · Mathematics 2020-07-15 Alexandre Miquel

We take a new look at dilation theory for nonself-adjoint operator algebras. Among the extremal (co)extensions of a representation, there is a special property of being fully extremal. This allows a refinement of some of the classical…

Operator Algebras · Mathematics 2011-09-02 Kenneth R. Davidson , Elias G. Katsoulis

We bring forward a logical system of transition algebras that enhances many-sorted first-order logic using features from dynamic logics. The sentences we consider include compositions, unions, and transitive closures of transition…

Logic in Computer Science · Computer Science 2024-04-26 Hashimoto Go , Daniel Găină , Ionuţ Ţuţu

Principles of cognitive economy would require that concepts about objects, properties and relations should be introduced only if they simplify the conceptualisation of a domain. Unexpectedly, classic logic conditionals, specifying…

Artificial Intelligence · Computer Science 2019-08-13 Giovanni Sileno

In an impressive series of papers, Krivine showed at the edge of the last decade how classical realizability provides a surprising technique to build models for classical theories. In particular, he proved that classical realizability…

Logic in Computer Science · Computer Science 2020-07-16 Étienne Miquey

Our earlier publications showed semantic tableau admits partial exceptions to the Second Incompleteness Theorem where a formalism recognizes its self consistency and views multiplication as a 3-way relation (rather than as a total…

Logic · Mathematics 2020-06-02 Dan E. Willard

This paper explains why internal and external validity cannot be simultaneously maximised. It introduces "evidential states" to represent the information available for causal inference and shows that routine study operations (restriction,…

Applications · Statistics 2025-12-01 Daniel D. Reidpath

One may formulate the dependent product types of Martin-L\"of type theory either in terms of abstraction and application operators like those for the lambda-calculus; or in terms of introduction and elimination rules like those for the…

Logic · Mathematics 2011-10-17 Richard Garner

Bilateral trade is one of the most natural and important forms of economic interaction: A seller has a single, indivisible item for sale, and a buyer is potentially interested. The two parties typically have different, privately known…

Computer Science and Game Theory · Computer Science 2023-12-20 Yixuan Even Xu , Hanrui Zhang , Vincent Conitzer

The bilateralist approach to logical consequence maintains that judgments of different qualities should be taken into account in determining what-follows-from-what. We argue that such an approach may be actualized by a two-dimensional…

Logic in Computer Science · Computer Science 2021-07-20 Vitor Greati , Sérgio Marcelino , João Marcos

This paper argues that, insofar as we doubt the bivalence of the Continuum Hypothesis or the truth of the Axiom of Choice, we should also doubt the consistency of third-order arithmetic, both the classical and intuitionistic versions.…

History and Overview · Mathematics 2022-07-07 Paul Blain Levy

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

We describe a realizability framework for classical first-order logic in which realizers live in (a model of) typed {\lambda}{\mu}-calculus. This allows a direct interpretation of classical proofs, avoiding the usual negative translation to…

Logic in Computer Science · Computer Science 2017-01-11 Valentin Blot

We solve a case of the Abelian Exponential-Algebraic Closedness Conjecture, a conjecture due to Bays and Kirby, building on work of Zilber, which predicts sufficient conditions for systems of equations involving algebraic operations and the…

Logic · Mathematics 2025-02-04 Francesco Gallinaro

Any intermediate propositional logic (i.e., a logic including intuitionistic logic and contained in classical logic) can be extended to a calculus with epsilon- and tau-operators and critical formulas. For classical logic, this results in…

Logic · Mathematics 2021-12-02 Matthias Baaz , Richard Zach

Juba recently proposed a formulation of learning abductive reasoning from examples, in which both the relative plausibility of various explanations, as well as which explanations are valid, are learned directly from data. The main…

Artificial Intelligence · Computer Science 2017-11-28 Brendan Juba , Zongyi Li , Evan Miller

Possibility theory offers a framework where both Lehmann's "preferential inference" and the more productive (but less cautious) "rational closure inference" can be represented. However, there are situations where the second inference does…

Artificial Intelligence · Computer Science 2013-02-18 Salem Benferhat , Didier Dubois , Henri Prade

The purpose of this paper is to clarify the relationship between various conditions implying essential undecidability: our main result is that there exists a theory $T$ in which all partially recursive functions are representable, yet $T$…

Logic · Mathematics 2020-05-13 Emil Jeřábek