English
Related papers

Related papers: Truth and the liar paradox

200 papers

The central focus is on clarifying the distinction between sets and proper classes. To this end we identify several categories of concepts (surveyable, definite, indefinite), and we attribute the classical set theoretic paradoxes to a…

History and Overview · Mathematics 2011-12-30 Nik Weaver

Among the various forms of reasoning studied in the context of artificial intelligence, qualitative reasoning makes it possible to infer new knowledge in the context of imprecise, incomplete information without numerical values. In this…

Artificial Intelligence · Computer Science 2026-02-10 Quentin Cohen-Solal , Alexandre Niveau , Maroua Bouzid

Perhaps one of the most intriguing questions in philosophy concerns the true nature of external reality. In this paper, we discuss some of the theories that have been put forth regarding the nature of reality and of our perceived universe.…

General Mathematics · Mathematics 2007-05-23 Ashwin Vaidya , Bong-Jae Chung

Construal of observable facts or events, that is, the manner in which we understand reality, is based not only on mathematical formulas of a theory suggested as a reasonable explanation for physical phenomena (like general relativity or…

Quantum Physics · Physics 2021-07-19 Arkady Bolotin

I think we can agree that dealing with uncertainty is not easy. Probability is the main tool for dealing with uncertainty, and we know there are many probability-related puzzles and paradoxes. Here I describe a rather idiosyncratic…

Other Statistics · Statistics 2022-01-19 Yudi Pawitan

As transformers have gained prominence in natural language processing, some researchers have investigated theoretically what problems they can and cannot solve, by treating problems as formal languages. Exploring such questions can help…

Machine Learning · Computer Science 2024-09-05 Lena Strobl , William Merrill , Gail Weiss , David Chiang , Dana Angluin

The process of doing Science in condition of uncertainty is illustrated with a toy experiment in which the inferential and the forecasting aspects are both present. The fundamental aspects of probabilistic reasoning, also relevant in real…

History and Overview · Mathematics 2018-02-07 Giulio D'Agostini

Reliability has long been treated as an engineering practice supported by testing, statistics and standards, yet its status as a scientific discipline remains unsettled. From a philosophical perspective, scientific truth is characterized by…

Physics and Society · Physics 2026-01-13 Xiao-Yang Li , Shi-Shun Chen , Waichon Lio , Rui Kang

The provability logic of a theory $T$ captures the structural behavior of formalized provability in $T$ as provable in $T$ itself. Like provability, one can formalize the notion of relative interpretability giving rise to interpretability…

Logic · Mathematics 2015-04-01 Evan Goris , Joost J. Joosten

We regard explanations as a blending of the input sample and the model's output and offer a few definitions that capture various desired properties of the function that generates these explanations. We study the links between these…

Machine Learning · Computer Science 2020-01-16 Lior Wolf , Tomer Galanti , Tamir Hazan

A knowledge system S describing a part of real world does in general not contain complete information. Reasoning with incomplete information is prone to errors since any belief derived from S may be false in the present state of the world.…

Artificial Intelligence · Computer Science 2011-05-20 Eliezer L. Lozinskii

We first partly develop a mathematical notion of stable consistency intended to reflect the actual consistency property of human beings. Then we give a generalization of the first and second G\"odel incompleteness theorem to stably…

Logic in Computer Science · Computer Science 2022-08-16 Yasha Savelyev

In this short paper, I present a few theorems on sentences of arithmetic which are related to Yablo's Paradox as G\"odel's first undecidable sentence was related to the Liar paradox. In particular, I consider two different arithemetizations…

Logic · Mathematics 2011-12-20 Graham Leach-Krouse

Propositional term modal logic is interpreted over Kripke structures with unboundedly many accessibility relations and hence the syntax admits variables indexing modalities and quantification over them. This logic is undecidable, and we…

Logic in Computer Science · Computer Science 2019-01-01 Anantha Padmanabha , R Ramanujam

The effectiveness of binary analysis tools and techniques is often measured with respect to how well they map to a ground truth. We have found that not all ground truths are created equal. This paper challenges the binary analysis community…

Cryptography and Security · Computer Science 2022-10-28 Jim Alves-Foss , Varsah Venugopal

Recently, it has been emphasized that the possibility theory framework allows us to distinguish between i) what is possible because it is not ruled out by the available knowledge, and ii) what is possible for sure. This distinction may be…

Artificial Intelligence · Computer Science 2013-01-07 Salem Benferhat , Didier Dubois , Souhila Kaci , Henri Prade

We propose a new definition of actual causes, using structural equations to model counterfactuals.We show that the definitions yield a plausible and elegant account ofcausation that handles well examples which have caused problems forother…

Artificial Intelligence · Computer Science 2013-01-14 Joseph Y. Halpern , Judea Pearl

After pointing out the historical avatar at the origin of a would be twin or clock paradox, we argue that, at least on a local scale, the (re-qualified) paradox is but a necessary consequence of the sole principle of causality.

General Relativity and Quantum Cosmology · Physics 2008-11-26 T. Grandou , J. L. Rubin

There are many examples in the literature that suggest that indistinguishability is intransitive, despite the fact that the indistinguishability relation is typically taken to be an equivalence relation (and thus transitive). It is shown…

Artificial Intelligence · Computer Science 2007-05-23 Joseph Y. Halpern

This paper investigates how global decision problems over arithmetically represented domains acquire reflective structure through class-quantification. Arithmetization forces diagonal fixed points whose verification requires reflection…

Computational Complexity · Computer Science 2025-11-19 Milan Rosko