English
Related papers

Related papers: Peirce's Truth-functiona Analysis and the Origin o…

200 papers

Prior research in computational argumentation has mainly focused on scoring the quality of arguments, with less attention on explicating logical errors. In this work, we introduce four sets of explainable templates for common informal…

Computation and Language · Computer Science 2024-06-19 Irfan Robbani , Paul Reisert , Naoya Inoue , Surawat Pothong , Camélia Guerraoui , Wenzhi Wang , Shoichi Naito , Jungmin Choi , Kentaro Inui

Modern foundational models increasingly reflect not just world knowledge, but patterns of human preference embedded in their training data. We hypothesize that recursive alignment-via human feedback and model-generated corpora-induces a…

Computers and Society · Computer Science 2025-10-22 Riccardo Cadei , Christian Internò

In loving memory of Asher Peres, we discuss a most important and influential paper written in 1935 by his thesis supervisor and mentor Nathan Rosen, together with Albert Einstein and Boris Podolsky. In that paper, the trio known as EPR…

Quantum Physics · Physics 2007-05-23 Gilles Brassard , Andre Allan Methot

The purpose of this paper is to report on the most recent developments in our ongoing investigation of the representation and manipulation of uncertainty in automated reasoning systems. In our earlier studies (Tong and Shapiro, 1985) we…

Artificial Intelligence · Computer Science 2013-04-12 Richard M. Tong , Lee A. Appelbaum , D. G. Shapiro

Causal inference, a critical tool for informing business decisions, traditionally relies heavily on structured data. However, in many real-world scenarios, such data can be incomplete or unavailable. This paper presents a framework that…

Machine Learning · Computer Science 2026-02-17 Boning Zhou , Ziyu Wang , Han Hong , Haoqi Hu

The purpose of this paper is to introduce justification logics based on conditional logics. We introduce a new family of logics, called conditional justification logics, which incorporates a counterfactual conditional in its language. For…

Logic · Mathematics 2025-01-17 Meghdad Ghari

Goedel's explicit thesis was that his undecidable formula GUS is a well-formed, well-defined formal sentence in any formalisation of Intuitive Arithmetic IA in which the axioms and rules of inference are recursively definable. His implicit…

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

The "openness" of a complex polynomial mapping is discussed and applied to the Fundamental Theorem of Algebra. In this category fall proofs of S. Wolfenstein, R.L. Thompson, J. Milnor, and S. Reich-S. Smale. These proofs take into account…

Complex Variables · Mathematics 2015-12-02 Jon A. Sjogren

In this work we investigate the representation of counterfactual conditionals using the vector logic, a matrix-vectors formalism for logical functions and truth values. Inside this formalism, the counterfactuals can be transformed in…

Computation and Language · Computer Science 2020-09-03 Eduardo Mizraji

This paper is a follow-up to "Models of PT${}^-$ with internal induction for total formulae." We give a strenghtening of the main result on the semantical non-conservativity of the theory of PT${}^-$ with internal induction for total…

Logic · Mathematics 2019-03-14 Mateusz Łełyk , Bartosz Wcisło

A paradox associated with the astrophysical Poynting-Robertson effect is presented. The paradox arises when relativity theory and Mie's solution of Maxwell's equations are confronted with the statements on the Poynting-Robertson effect.…

Astrophysics · Physics 2008-07-18 J. Klacka

This paper presents a formal theory of Krivine's classical realisability interpretation for first-order Peano arithmetic ($\mathsf{PA}$). To formulate the theory as an extension of $\mathsf{PA}$, we first modify Krivine's original…

Logic · Mathematics 2025-04-08 Daichi Hayashi , Graham E. Leigh

Ernst Zermelo's axiomatization of set theory (1908) did not exclude `a set that is a member of itself'. We call a set that is a member of itself `an individual'. In this article we prove the elimination of Russell's paradox is equivalent to…

History and Overview · Mathematics 2026-01-29 Doeko Homan

Upon reading Einstein's views on quantum incompleteness in publications or in his correspondence after 1935 (the EPR paradox), one gets a very intense feeling of deja-vu. Einstein presents a quantum hole argument, which somewhat reminds of…

History and Philosophy of Physics · Physics 2013-02-05 Galina Weinstein

Recent probing studies reveal that large language models exhibit linear subspaces that separate true from false statements, yet the mechanism behind their emergence is unclear. We introduce a transparent, one-layer transformer toy model…

Computation and Language · Computer Science 2025-10-20 Shauli Ravfogel , Gilad Yehudai , Tal Linzen , Joan Bruna , Alberto Bietti

In this paper I outline my propensiton version of quantum theory (PQT). PQT is a fully micro-realistic version of quantum theory that provides us with a very natural possible solution to the fundamental wave/particle problem, and is free of…

History and Philosophy of Physics · Physics 2011-03-10 Nicholas Maxwell

This paper (1)shows that the best supported current psychological theory (Cheng, 1997) of how human subjects judge the causal power or influence of variations in presence or absence of one feature on another, given data on their…

Artificial Intelligence · Computer Science 2013-02-01 Clark Glymour

In 1935, Einstein, Podolsky, and Rosen (EPR) claimed the incompleteness of quantum mechanics based on the notions of realism (``{\it If, without in any way disrupting a system, we can predict with certainty - i.e., with a probability of one…

Quantum Physics · Physics 2025-11-27 Diego S. Starke , Jonas Maziero , Renato M. Angelo

There is a growing concern that the recent progress made in AI, especially regarding the predictive competence of deep learning models, will be undermined by a failure to properly explain their operation and outputs. In response to this…

Machine Learning · Computer Science 2020-09-15 Eoin M. Kenny , Mark T. Keane

Pre-trained Language Models (PLMs) encode various facts about the world at their pre-training phase as they are trained to predict the next or missing word in a sentence. There has a been an interest in quantifying and improving the amount…

Computation and Language · Computer Science 2024-10-18 Paul Youssef , Jörg Schlötterer , Christin Seifert
‹ Prev 1 8 9 10 Next ›