English
Related papers

Related papers: Combining fragments of classical logic: When are i…

200 papers

The unification of gravity and quantum mechanics remains one of the most profound open questions in science. With recent advances in quantum technology, an experimental idea first proposed by Richard Feynman is now regarded as a promising…

Quantum Physics · Physics 2025-10-28 Joseph Aziz , Richard Howl

Entanglement is often regarded as an inherently quantum feature. We show that this does not have to be the case: under restricted operational access, classical correlations can appear nonseparable when expressed in the formalism of quantum…

Quantum Physics · Physics 2025-12-18 Samuel Schlegel , Borivoje Dakić , Flavio Del Santo

This paper contains results related to synthesis and presentation of abstract automata by fragments of behaviour and investigates the structure of the classes of finite connected initial output-less automata specified by systems of defining…

Formal Languages and Automata Theory · Computer Science 2017-12-15 Oleksiy Kurganskyy , Alexandra Maximova

A quantitative model of concurrent interaction is introduced. The basic objects are linear combinations of partial order relations, acted upon by a group of permutations that represents potential non-determinism in synchronisation. This…

Logic in Computer Science · Computer Science 2011-07-08 Emmanuel Beffara

This paper studies a first-order expansion of a combination C+J of intuitionistic and classical propositional logic, which was studied by Humberstone (1979) and del Cerro and Herzig (1996), from a proof-theoretic viewpoint. While C+J has…

Logic in Computer Science · Computer Science 2022-04-15 Masanobu Toyooka , Katsuhiko Sano

Quantum logic gates can perform calculations much more efficiently than their classical counterparts. However, the level of control needed to obtain a reliable quantum operation is correspondingly higher. In order to evaluate the…

Quantum Physics · Physics 2009-11-13 Holger F. Hofmann , Ryo Okamoto , Shigeki Takeuchi

Graphs can represent relational information among entities and graph structures are widely used in many intelligent tasks such as search, recommendation, and question answering. However, most of the graph-structured data in practice suffers…

Information Retrieval · Computer Science 2021-12-30 Hanxiong Chen , Yunqi Li , Shaoyun Shi , Shuchang Liu , He Zhu , Yongfeng Zhang

Standard approaches to probabilistic reasoning require that one possesses an explicit model of the distribution in question. But, the empirical learning of models of probability distributions from partial observations is a problem for which…

Artificial Intelligence · Computer Science 2018-07-02 Brendan Juba

Traditional clustering identifies groups of objects that share certain qualities. Tangles do the converse: they identify groups of qualities that often occur together. They can thereby discover, relate, and structure types: of behaviour,…

Artificial Intelligence · Computer Science 2024-05-15 Reinhard Diestel

The foundational character of certain algebraic structures as Boolean algebras and Heyting algebras is rooted in their potential to model classical and constructive logic, respectively. In this paper we discuss the contributions of…

Rings and Algebras · Mathematics 2014-09-16 João Pita Costa , Primož Škraba , Mikael Vejdemo-Johansson

The purpose is to study systems of interacting particles in the Generl Relativity context, by the principle of least action using purely classical concepts. The particles are described by a state tensor using a Clifford algebra for the…

Mathematical Physics · Physics 2011-09-20 Jean Claude Dutailly

The principle of correspondence (or classical limit) is essential in quantum mechanics. Yet, how and why quantum phenomena vanish at the macroscopic scale are issues still open to debate. Here, quantum mechanical predictions for…

Quantum Physics · Physics 2018-10-03 Alejandro A. Hnilo

This paper presents two unconventional links between quantum and classical physics. The first link appears in the study of quantum cryptography. In the presence of a spy, the quantum correlations shared by Alice and Bob are imperfect. One…

Quantum Physics · Physics 2007-05-23 Valerio Scarani

Complex reasoning over text requires understanding and chaining together free-form predicates and logical connectives. Prior work has largely tried to do this either symbolically or with black-box transformers. We present a middle ground…

Computation and Language · Computer Science 2021-06-08 Jiangming Liu , Matt Gardner , Shay B. Cohen , Mirella Lapata

We introduce a new variant of dependence logic called Boolean dependence logic. In Boolean dependence logic dependence atoms are of the type =(x_1,...,x_n,\alpha), where \alpha is a Boolean variable. Intuitively, with Boolean dependence…

Logic · Mathematics 2014-06-30 Johannes Ebbing , Lauri Hella , Peter Lohmann , Jonni Virtema

Bohmian mechanics, a hydrodynamic formulation of quantum mechanics, relies on the concept of trajectory, which evolves in time in compliance with dynamical information conveyed by the wave function. Here this appealing idea is considered to…

Quantum Physics · Physics 2015-10-06 M. Davidovic , A. S. Sanz , M. Bozic

Since quantum feedback is based on classically accessible measurement results, it can provide fundamental insights into the dynamics of quantum systems by making available classical information on the evolution of system properties and on…

Quantum Physics · Physics 2009-11-11 Holger F. Hofmann

Within classical propositional logic, assigning probabilities to formulas is shown to be equivalent to assigning probabilities to valuations. A novel notion of probabilistic entailment enjoying desirable properties of logical consequence is…

Logic · Mathematics 2016-01-13 Joao Rasga , Cristina Sernadas , Amilcar Sernadas

Simple type theory is suited as framework for combining classical and non-classical logics. This claim is based on the observation that various prominent logics, including (quantified) multimodal logics and intuitionistic logics, can be…

Logic in Computer Science · Computer Science 2015-03-17 Christoph Benzmueller

We show that it is possible to define a realizability interpretation for the $\Sigma_2$-fragment of classical Analysis using G\"odel's System T only. This supplements a previous result of Schwichtenberg regarding bar recursion at types 0…

Logic · Mathematics 2015-01-30 Danko Ilik