English
Related papers

Related papers: Three Dogmas, a Puzzle and its Solution

200 papers

F-systems are digraphs that enable to model sentences that predicate the falsity of other sentences. Paradoxes like the Liar and Yablo's can be analyzed with that tool to find graph-theoretic patterns. In this paper we present the F-systems…

Logic · Mathematics 2020-05-15 Gustavo A. Bodanza

I outline a new theory of truth that resolves the classical and constructive versions of the liar paradox. The theory features a provably consistent axiomatization of a global self-applicative truth predicate. Truth is defined using…

Logic · Mathematics 2025-07-14 Nik Weaver

We present a comprehensive evaluation of the ability of large language models (LLMs) to process culturally grounded language, specifically to understand and pragmatically use figurative expressions that encode local knowledge and cultural…

Computation and Language · Computer Science 2026-02-24 Mena Attia , Aashiq Muhamed , Mai Alkhamissi , Thamar Solorio , Mona Diab

Treebanks are valuable linguistic resources that include the syntactic structure of a language sentence in addition to POS-tags and morphological features. They are mainly utilized in modeling statistical parsers. Although the statistical…

Computation and Language · Computer Science 2020-07-14 Dana Halabi , Ebaa Fayyoumi , Arafat Awajan

An apparent paradox proposed by Aharonov and Vaidman in which a single particle can be found with certainty in two (or more) boxes is analyzed by way of a simple thought experiment. It is found that the apparent paradox arises from an…

Quantum Physics · Physics 2016-09-08 R. E. Kastner

Real-valued logics underlie an increasing number of neuro-symbolic approaches, though typically their logical inference capabilities are characterized only qualitatively. We provide foundations for establishing the correctness and power of…

Logic in Computer Science · Computer Science 2022-09-01 Ronald Fagin , Ryan Riegel , Alexander Gray

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

Rule-based reasoning over natural language input arises in domains where decisions must be auditable and justifiable: clinical protocols specify eligibility criteria in prose, evidence rules define admissibility through textual conditions,…

Artificial Intelligence · Computer Science 2026-01-06 Albert Sadowski , Jarosław A. Chudziak

Large Language Models (LLMs) have demonstrated impressive capabilities in structured reasoning and symbolic tasks, with coding emerging as a particularly successful application. This progress has naturally motivated efforts to extend these…

Artificial Intelligence · Computer Science 2026-02-02 Andrea Asperti , Alberto Naibo , Claudio Sacerdoti Coen

A formal context consists of objects, properties, and the incidence relation between them. Various notions of concepts defined with respect to formal contexts and their associated algebraic structures have been studied extensively,…

Logic · Mathematics 2025-01-14 Prosenjit Howlader , Churn-Jung Liau

Large language models (LLMs) are a promising venue for natural language understanding and generation. However, current LLMs are far from reliable: they are prone to generating non-factual information and, more crucially, to contradicting…

Computation and Language · Computer Science 2024-09-24 Diego Calanzone , Stefano Teso , Antonio Vergari

This paper focuses on resolution in linguistic first order logic with truth value taken from linear symmetrical hedge algebra. We build the basic components of linguistic first order logic, including syntax and semantics. We present a…

Logic in Computer Science · Computer Science 2014-04-01 Thi-Minh-Tam Nguyen , Viet-Trung Vu , The-Vinh Doan , Duc-Khanh Tran

Investigating the reasoning abilities of transformer models, and discovering new challenging tasks for them, has been a topic of much interest. Recent studies have found these models to be surprisingly strong at performing deductive…

Computation and Language · Computer Science 2021-12-17 Kyle Richardson , Ashish Sabharwal

State-of-the-art deep-learning-based approaches to Natural Language Processing (NLP) are credited with various capabilities that involve reasoning with natural language texts. In this paper we carry out a large-scale empirical study…

Computation and Language · Computer Science 2022-11-11 Viktor Schlegel , Kamen V. Pavlov , Ian Pratt-Hartmann

We investigate the possibility of modelling the syntax and semantics of natural language by constraints, or rules, imposed by the multi-dimensional type theory Nabla. The only multiplicity we explicitly consider is two, namely one dimension…

Computation and Language · Computer Science 2007-05-23 Jørgen Villadsen

This article fits in the area of research that investigates the application of topological duality methods to problems that appear in theoretical computer science. One of the eventual goals of this approach is to derive results in…

Logic in Computer Science · Computer Science 2022-01-05 Mehdi Zaïdi

Fact verification on tabular evidence incentivises the use of symbolic reasoning models where a logical form is constructed (e.g. a LISP-style program), providing greater verifiability than fully neural approaches. However, these systems…

Computation and Language · Computer Science 2024-11-05 Rami Aly , Andreas Vlachos

\textbf{T-BAT} logic is a formal system designed to express the notion of informal provability. This type of provability is closely related to mathematical practice and is quite often contrasted with formal provability, understood as a…

Logic in Computer Science · Computer Science 2025-10-17 Pawel Pawlowski

Lawvere showed that generalised metric spaces are categories enriched over $[0, \infty]$, the quantale of the positive extended reals. The statement of enrichment is a quantitative analogue of being a preorder. Towards seeking a logic for…

Logic in Computer Science · Computer Science 2024-02-14 Giorgio Bacci , Radu Mardare , Prakash Panangaden , Gordon Plotkin

When reasoning in description, modal or temporal logics it is often useful to consider axioms representing universal truths in the domain of discourse. Reasoning with respect to an arbitrary set of axioms is hard, even for relatively…

Logic in Computer Science · Computer Science 2007-05-23 Ian Horrocks , Stephan Tobies