English
Related papers

Related papers: Validity of contextual formulas (extended version)

200 papers

Contextuality is a necessary resource for universal quantum computation and non-contextual quantum mechanics can be simulated efficiently by classical computers in many cases. Orders of Planck's constant, $\hbar$, can also be used to…

Quantum Physics · Physics 2018-08-01 Lucas Kocia , Peter Love

We introduce a sequent calculus for the temporal-over-topological fragment $\textbf{DTL}_{0}^{\circ * \slash \Box}$ of dynamic topological logic $\textbf{DTL}$, prove soundness semantically, and prove completeness syntactically using the…

Logic · Mathematics 2014-08-05 Samuel Reid

In this work we present a generalization of the recently developed Hardy-like logical proof of contextuality and of the so-called KCBS contextuality inequality for any qudit of dimension greater than three. Our approach uses compatibility…

Quantum Physics · Physics 2016-09-16 Adel Sohbi , Isabelle Zaquine , Eleni Diamanti , Damian Markham

Large Language Models (LLMs) have demonstrated significant promise in formal theorem proving. In this study, we investigate the ability of LLMs to discover novel theorems and produce verified proofs. We propose a pipeline called…

Machine Learning · Computer Science 2026-05-07 Kazumi Kasaura , Naoto Onda , Yuta Oriike , Masaya Taniguchi , Akiyoshi Sannai , Sho Sonoda

LTL3 is a multi-valued variant of Linear-time Temporal Logic for runtime verification applications. The semantic descriptions of LTL3 in previous work are given only in terms of the relationship to conventional LTL. Our approach, by…

Logic in Computer Science · Computer Science 2024-11-25 Rayhana Amjad , Rob van Glabbeek , Liam O'Connor

Proof equivalence in a logic is the problem of deciding whether two proofs are equivalent modulo a set of permutation of rules that reflects the commutative conversions of its cut-elimination procedure. As such, it is related to the…

Logic in Computer Science · Computer Science 2015-04-20 Marc Bagnol

The univalence axiom expresses the principle of extensionality for dependent type theory. However, if we simply add the univalence axiom to type theory, then we lose the property of canonicity - that every closed term computes to a…

Logic in Computer Science · Computer Science 2017-03-14 Robin Adams , Marc Bezem , Thierry Coquand

In this paper, we study an extension of the CPE conjecture to manifolds $M$ which support a structure relating curvature to the geometry of a smooth map $\varphi : M \to N$. The resulting system, denoted by $(\varphi-\mathrm{CPE})$, is…

Differential Geometry · Mathematics 2024-01-17 Giulio Colombo , Luciano Mari , Marco Rigoli

Contextual equivalence equate terms that have the same observable behaviour in any context. A standard contextual equivalence for CCS is the strong barbed congruence. Configuration structures are a denotational semantics for processes in…

Logic in Computer Science · Computer Science 2015-11-19 Clément Aubert , Ioana Cristescu

Operational semantics have been enormously successful, in large part due to its flexibility and simplicity, but they are not compositional. Denotational semantics, on the other hand, are compositional but the lattice-theoretic models are…

Programming Languages · Computer Science 2017-10-24 Jeremy G. Siek

A class of interval-based temporal languages for uniformly representing and reasoning about actions and plans is presented. Actions are represented by describing what is true while the action itself is occurring, and plans are constructed…

Artificial Intelligence · Computer Science 2011-05-30 A. Artale , E. Franconi

We present some hypersequent calculi for all systems of the classical cube and their extensions with axioms $T$, $P$, $D$, and, for every $n\geq 1$, rule $RD^+_n$. The calculi are internal as they only employ the language of the logic, plus…

Logic in Computer Science · Computer Science 2020-06-11 Tiziano Dalmonte , Björn Lellmann , Nicola Olivetti , Elaine Pimentel

The task of reading comprehension (RC), often implemented as context-based question answering (QA), provides a primary means to assess language models' natural language understanding (NLU) capabilities. Yet, when applied to large language…

Computation and Language · Computer Science 2025-07-08 Victoria Basmov , Yoav Goldberg , Reut Tsarfaty

Contextuality and nonlocality are two fundamental properties of nature. Hardy's proof is considered the simplest proof of nonlocality and can also be seen as a particular violation of the simplest Bell inequality. A fundamental question is:…

Quantum Physics · Physics 2013-11-01 Adan Cabello , Piotr Badziag , Marcelo Terra Cunha , Mohamed Bourennane

In this work, we deal with Delone sets and their rectifiability under different classes of regularity. By pursuing techniques developed by Rivi\`ere and Ye, and Aliste-Prieto, Coronel and Gambaudo, we give sufficient conditions for a…

Metric Geometry · Mathematics 2025-09-01 Irene Inoquio-Renteria , Rodolfo Viera

In-context learning (ICL) has emerged as a successful paradigm for leveraging large language models (LLMs). However, it often struggles to generalize beyond the distribution of the provided demonstrations. A recent advancement in enhancing…

Computation and Language · Computer Science 2025-06-04 Ukyo Honda , Tatsushi Oka

Various frameworks that generalise the notion of contextuality in theories of physics have been proposed; one is the sheaf-theoretic approach by Abramsky and Brandenburger; an other is the equivalence-based approach by Spekkens. We show…

Quantum Physics · Physics 2018-03-05 Linde Wester

The higher-order pi-calculus is an extension of the pi-calculus to allow communication of abstractions of processes rather than names alone. It has been studied intensively by Sangiorgi in his thesis where a characterisation of a contextual…

Programming Languages · Computer Science 2017-01-11 Alan Jeffrey , Julian Rathke

Contextuality in quantum physics provides a key resource for quantum information and computation. The topological approach in [Abramsky and Brandenburger, New J. Phys., 2011, Abramsky et al., CSL 2015, 2015] characterizes contextuality as…

Logic in Computer Science · Computer Science 2017-03-07 Kohei Kishida

Proof nets provide abstract counterparts to sequent proofs modulo rule permutations; the idea being that if two proofs have the same underlying proof-net, they are in essence the same proof. Providing a convincing proof-net counterpart to…

Logic · Mathematics 2012-03-20 Richard McKinley