English
Related papers

Related papers: Intuitionism and the liar paradox

200 papers

The handling of probabilities in the form of uncertainty or partial information is an essential task for LLMs in many settings and applications. A common approach to evaluate an LLM's probabilistic reasoning capabilities is to assess its…

Artificial Intelligence · Computer Science 2026-02-12 Manuel Mondal , Ljiljana Dolamic , Gérôme Bovet , Philippe Cudré-Mauroux , Julien Audiffren

Every philosophy has holes, and it is the responsibility of proponents of a philosophy to point out these problems. Here are a few holes in Bayesian data analysis: (1) the usual rules of conditional probability fail in the quantum realm,…

Statistics Theory · Mathematics 2020-11-12 Andrew Gelman , Yuling Yao

An indeterministic interpretation of classical physics has been proposed recently, in which the argument relies on attacking an alleged unwarranted metaphysical hidden assumption of the standard deterministic interpretation. This short…

History and Philosophy of Physics · Physics 2020-12-22 Wyman Kwok

Real-life conjectures do not come with instructions saying whether they they should be proven or, instead, refuted. Yet, as we now know, in either case the final argument produced had better be not just convincing but actually verifiable in…

Computers and Society · Computer Science 2015-07-21 João Marcos

We develop a logical framework for reasoning about knowledge and evidence in which the agent may be uncertain about how to interpret their evidence. Rather than representing an evidential state as a fixed subset of the state space, our…

Logic in Computer Science · Computer Science 2019-07-23 Adam Bjorndahl , Aybüke Özgün

We investigate properties of monadic purely negational fragment of Intuitionistic Control Logic (ICL). This logic arises from Intuitionistic Propositional Logic (IPL) by extending language of IPL by additional new constant for falsum.…

Logic · Mathematics 2014-08-12 Anna Glenszczyk

We present a reading of the traditional syllogistics in a fragment of the propositional intuitionistic multiplicative linear logic and prove that with respect to a diagrammatic logical calculus that we introduced in a previous paper, a…

Logic in Computer Science · Computer Science 2013-03-01 Ruggero Pagnan

Classical interpretations of Goedel's formal reasoning imply that the truth of some arithmetical propositions of any formal mathematical language, under any interpretation, is essentially unverifiable. However, a language of general,…

General Mathematics · Mathematics 2007-05-23 Bhupinder Singh Anand

We investigate the reasons of having confidence in mathematical theorems. The formalist point of view maintains that formal derivations underlying proofs, although usually not carried out in practice, contribute to this confidence. Opposing…

Logic · Mathematics 2014-11-19 Andrzej Pelc

Edgar Allan Poe noted, "Truth often lurks in the shadow of error," highlighting the deep complexity intrinsic to the interplay between truth and falsehood, notably under conditions of cognitive and informational asymmetry. This dynamic is…

Computation and Language · Computer Science 2025-07-08 Chaozhuo Li , Pengbo Wang , Chenxu Wang , Litian Zhang , Zheng Liu , Qiwei Ye , Yuanbo Xu , Feiran Huang , Xi Zhang , Philip S. Yu

Linear logic was conceived in 1987 by Girard and, in contrast to classical logic, restricts the usage of the structural inference rules of weakening and contraction. With this, atoms of the logic are no longer interpreted as truth, but as…

Logic in Computer Science · Computer Science 2021-10-04 Florian Chudigiewitsch

This paper provides a critical overview of Georg Kreisel's method of informal rigour, most famously presented in his 1967 paper `Informal rigour and completeness proofs'. After first considering Kreisel's own characterization in historical…

Logic · Mathematics 2021-05-03 Walter Dean , Hidenori Kurokawa

Mathematical proofs are often said to justify their conclusions by indicating the existence of a corresponding formal derivation. We argue that this widespread view relies on an under-examined notion of correspondence, or what it means for…

History and Overview · Mathematics 2026-03-20 Simon DeDeo , Eamon Duede

Circular (or cyclic) proofs have received increasing attention in recent years, and have been proposed as an alternative setting for studying (co)inductive reasoning. In particular, now several type systems based on circular reasoning have…

Logic in Computer Science · Computer Science 2025-09-01 Gianluca Curzi , Anupam Das

If a quantum system is prepared and later post-selected in certain states, "paradoxical" predictions for intermediate measurements can be obtained. This is the case both when the intermediate measurement is strong, i.e. a projective…

Quantum Physics · Physics 2015-11-06 Matthew F. Pusey , Matthew S. Leifer

The Doomsday argument and anthropic reasoning are two puzzling examples of probabilistic confirmation. In both cases, a lack of knowledge apparently yields surprising conclusions. Since they are formulated within a Bayesian framework, they…

Data Analysis, Statistics and Probability · Physics 2023-06-22 Yann Benétreau-Dupin

We posit that large language models (LLMs) should be capable of expressing their intrinsic uncertainty in natural language. For example, if the LLM is equally likely to output two contradicting answers to the same question, then its…

Computation and Language · Computer Science 2024-09-27 Gal Yona , Roee Aharoni , Mor Geva

In this paper, we show how game-theoretic work on conversation combined with a theory of discourse structure provides a framework for studying interpretive bias. Interpretive bias is an essential feature of learning and understanding but…

Computation and Language · Computer Science 2018-07-02 Nicholas Asher , Soumya Paul

Analogy has received attention as a form of inductive reasoning in the empirical sciences. However, its role in pure mathematics has received less consideration. This paper provides an account of how an analogy with a more familiar…

History and Overview · Mathematics 2022-06-16 Francesco Nappo , Nicolò Cangiotti , Caterina Sisti

In this paper, we consider the complexity of propositional proofs of classical and intuitionistic tautologies. In fact, we describe a nondeterministic polynomial-time decision procedure for intuitionistic implicational tautologies. For this…

Logic · Mathematics 2017-01-19 Grigoriy V. Bokov