English
Related papers

Related papers: Copies of classical logic in intuitionistic logic

200 papers

For the classical mind, quantum mechanics is boggling enough; nevertheless more bizarre behavior could be imagined, thereby concentrating on propositional structures (empirical logics) that transcend the quantum domain. One can also…

Quantum Physics · Physics 2017-01-09 Karl Svozil

Combinatory logic shows that bound variables can be eliminated without loss of expressiveness. It has applications both in the foundations of mathematics and in the implementation of functional programming languages. The original…

Logic · Mathematics 2009-05-08 Karim Nour

We present a procedure which allows us to recover classical and nonclassical logical structures as \emph{concrete logics} associated with physical theories expressed by means of classical languages. This procedure consists in choosing, for…

Quantum Physics · Physics 2014-11-13 Claudio Garola , Sandro Sozzo

This paper extends the literature on the strict-tolerant logical approach by applying its methods to intuitionistic and minimal logic. In short, the strict-tolerant approach modifies the usual notion of logical consequence by stipulating…

Logic in Computer Science · Computer Science 2025-09-15 Victor Barroso-Nascimento , German Mejia

This article is a short review on the concept of information. We show the strong relation between Information Theory and Physics, and the differences between classical and quantum information, with emphasis in their manipulation through…

Physics Education · Physics 2007-05-23 F. L. Marquezino , R. R. Mello Junior

If we define classical foundational concepts constructively, and introduce non-algorithmic effective methods into classical mathematics, then we can bridge the chasm between truth and provability, and define computational methods that are…

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

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

The classical propositional logic is known to be sound and complete with respect to the set semantics that interprets connectives as set operations. The paper extends propositional language by a new binary modality that corresponds to…

Logic in Computer Science · Computer Science 2007-05-23 Pavel Naumov

Using recent results in topos theory, two systems of higher-order logic are shown to be complete with respect to sheaf models over topological spaces---so-called ``topological semantics''. The first is classical higher-order logic, with…

Logic · Mathematics 2023-03-31 Steve Awodey , Carsten Butz

Mathematics and its relation to the physical universe have been the topic of speculation since the days of Pythagoras. Several different views of the nature of mathematics have been considered: Realism - mathematics exists and is…

History and Philosophy of Physics · Physics 2012-12-27 Alex Harvey

We extend the language of the classical syllogisms with the sentence-forms "At most 1 p is a q" and "More than 1 p is a q". We show that the resulting logic does not admit a finite set of syllogism-like rules whose associated derivation…

Logic in Computer Science · Computer Science 2024-04-24 Ian Pratt-Hartmann

This chapter surveys some of the main results on interpolation in several of the most prominent families of non-classical logics. Special attention is given to the distinction between the two most commonly studied variants of…

Logic · Mathematics 2025-12-02 Wesley Fussner

An age-old controversy in mathematics concerns the necessity and the possibility of constructive proofs. The controversy has been rekindled by recent advances which demonstrate the feasibility of a fully constructive mathematics. This…

History and Overview · Mathematics 2024-04-10 Mark Mandelkern

Every countable language which conforms to classical logic is shown to have an extension which conforms to classical logic, and has a definitional theory of truth. That extension has a semantical theory of truth, if every sentence of the…

Logic · Mathematics 2020-02-04 Seppo Heikkilä

We present two deductively equivalent calculi for non-deterministic many-valued logics. One is defined by axioms and the other - by rules of inference. The two calculi are obtained from the truth tables of the logic under consideration in a…

Logic in Computer Science · Computer Science 2023-06-22 Michael Kaminski

We investigate cut-elimination and cut-simulation in impredicative (higher-order) logics. We illustrate that adding simple axioms such as Leibniz equations to a calculus for an impredicative logic -- in our case a sequent calculus for…

Logic in Computer Science · Computer Science 2019-03-14 Christoph Benzmueller , Chad E. Brown , Michael Kohlhase

Prawitz suggested expanding a natural deduction system for intuitionistic logic to include rules for classical logic constructors, allowing both intuitionistic and classical elements to coexist without losing their inherent characteristics.…

Logic · Mathematics 2025-04-15 João Rasga , Cristina Sernadas

Most physics theories are deterministic, with the notable exception of quantum mechanics which, however, comes plagued by the so-called measurement problem. This state of affairs might well be due to the inability of standard mathematics to…

History and Philosophy of Physics · Physics 2021-11-04 Nicolas Gisin

Double-negation translations are used to encode and decode classical proofs in intuitionistic logic. We show that, in the cut-free fragment, we can simplify the translations and introduce fewer negations. To achieve this, we consider the…

Logic in Computer Science · Computer Science 2013-12-20 Mélanie Boudard , Olivier Hermant

We improve the answer to the question: what set of excluded middles for propositional variables in a formula suffices to prove the formula in intuitionistic propositional logic whenever it is provable in classical propositional logic.

Logic · Mathematics 2015-07-01 Hajime Ishihara