scholarly journals Control effects as a modality

2009 ◽  
Vol 19 (1) ◽  
pp. 17-26 ◽  
Author(s):  
HAYO THIELECKE
Keyword(s):  
Intuitionistic Logic ◽  
Classical Logic ◽  
Propositional Logic ◽  
The Other ◽  
Classical Propositional Logic ◽  
Double Negation ◽  
Other Hand

AbstractWe combine ideas from types for continuations, effect systems and monads in a very simple setting by defining a version of classical propositional logic in which double-negation elimination is combined with a modality. The modality corresponds to control effects, and it includes a form of effect masking. Erasing the modality from formulas gives classical logic. On the other hand, the logic is conservative over intuitionistic logic.

Implication with possible exceptions

2001 ◽  
Vol 66 (2) ◽  
pp. 517-535
Author(s):  
Herman Jurjus ◽  
Harrie de Swart
Keyword(s):  
Propositional Logic ◽  
Modus Ponens ◽  
The Other ◽  
Classical Propositional Logic ◽  
Consequence Relation ◽  
Other Hand

AbstractWe introduce an implication-with-possible-exceptions and define validity of rules-with-possible-exceptions by means of the topological notion of a full subset. Our implication-with-possible-exceptions characterises the preferential consequence relation as axiomatized by Kraus, Lehmann and Magidor [Kraus, Lehmann, and Magidor, 1990]. The resulting inference relation is non-monotonic. On the other hand, modus ponens and the rule of monotony, as well as all other laws of classical propositional logic, are valid-up-to-possible exceptions. As a consequence, the rules of classical propositional logic do not determine the meaning of deducibility and inference as implication-without-exceptions.

scholarly journals On Correspondence between Selective CPS Transformation and Selective Double Negation Translation

Mathematics ◽  
2021 ◽  
Vol 9 (4) ◽  
pp. 385
Author(s):  
Hyeonseung Im
Keyword(s):  
Programming Languages ◽  
Intuitionistic Logic ◽  
Reference Point ◽  
Classical Logic ◽  
Proof System ◽  
Double Negation

A double negation translation (DNT) embeds classical logic into intuitionistic logic. Such translations correspond to continuation passing style (CPS) transformations in programming languages via the Curry-Howard isomorphism. A selective CPS transformation uses a type and effect system to selectively translate only nontrivial expressions possibly with computational effects into CPS functions. In this paper, we review the conventional call-by-value (CBV) CPS transformation and its corresponding DNT, and provide a logical account of a CBV selective CPS transformation by defining a selective DNT via the Curry-Howard isomorphism. By using an annotated proof system derived from the corresponding type and effect system, our selective DNT translates classical proofs into equivalent intuitionistic proofs, which are smaller than those obtained by the usual DNTs. We believe that our work can serve as a reference point for further study on the Curry-Howard isomorphism between CPS transformations and DNTs.

scholarly journals On density of truth of the intuitionistic logic in one variable

2008 ◽  
Vol DMTCS Proceedings vol. AI,... (Proceedings) ◽  
Author(s):  
Zofia Kostrzycka
Keyword(s):  
Intuitionistic Logic ◽  
Classical Logic ◽  
Propositional Logic ◽  
Propositional Variable ◽  
Intuitionistic Propositional Logic ◽  
International Audience

International audience In this paper we focus on the intuitionistic propositional logic with one propositional variable. More precisely we consider the standard fragment $\{ \to ,\vee ,\bot \}$ of this logic and compute the proportion of tautologies among all formulas. It turns out that this proportion is different from the analog one in the classical logic case.

scholarly journals Forward and Backward Chaining with P Systems

2014 ◽  
pp. 149-158
Author(s):  
Sergiu Ivanov ◽  
Artiom Alhazov ◽  
Vladimir Rogojin ◽  
Miguel A. Gutiérrez-Naranjo
Keyword(s):  
Computer Science ◽  
Propositional Logic ◽  
Membrane Computing ◽  
Modus Ponens ◽  
The Other ◽  
P Systems ◽  
Backward Chaining ◽  
Other Hand

One of the concepts that lie at the basis of membrane computing is the multiset rewriting rule. On the other hand, the paradigm of rules is profusely used in computer science for representing and dealing with knowledge. Therefore, establishing a “bridge” between these domains is important, for instance, by designing P systems reproducing the modus ponens-based forward and backward chaining that can be used as tools for reasoning in propositional logic. In this paper, the authors show how powerful and intuitive the formalism of membrane computing is and how it can be used to represent concepts and notions from unrelated areas.

scholarly journals An Holistic Extension for Classical Logic via Quantum Fredkin Gate

Entropy ◽  
2021 ◽  
Vol 23 (9) ◽  
pp. 1178
Author(s):  
Hector Freytes ◽  
Giuseppe Sergioli
Keyword(s):  
Quantum Computation ◽  
Classical Logic ◽  
Propositional Logic ◽  
Classical Propositional Logic ◽  
Mixed States ◽  
Fredkin Gate ◽  
Bipartite States ◽  
Extended Notion

An holistic extension for classical propositional logic is introduced in the framework of quantum computation with mixed states. The mentioned extension is obtained by applying the quantum Fredkin gate to non-factorizable bipartite states. In particular, an extended notion of classical contradiction is studied in this holistic framework.

scholarly journals Glivenko theorems for substructural logics over FL

2006 ◽  
Vol 71 (4) ◽  
pp. 1353-1384 ◽  
Author(s):  
Nikolaos Galatos ◽  
Hiroakira Ono
Keyword(s):  
Propositional Logic ◽  
Substructural Logics ◽  
Residuated Lattices ◽  
Substructural Logic ◽  
Classical Propositional Logic ◽  
Double Negation ◽  
Glivenko’S Theorem

AbstractIt is well known that classical propositional logic can be interpreted in intuitionistic prepositional logic. In particular Glivenko's theorem states that a formula is provable in the former iff its double negation is provable in the latter. We extend Glivenko's theorem and show that for every involutive substructural logic there exists a minimum substructural logic that contains the first via a double negation interpretation. Our presentation is algebraic and is formulated in the context of residuated lattices. In the last part of the paper, we also discuss some extended forms of the Koltnogorov translation and we compare it to the Glivenko translation.

scholarly journals Из наблюдений над способами выражения отрицания в церковнославянском тексте русского извода

2021 ◽  
Vol 46 (2) ◽  
pp. 293-303
Author(s):  
Zofia Szwed
Keyword(s):  
Russian Language ◽  
The Other ◽  
State Archive ◽  
Double Negation ◽  
Slavic Languages ◽  
Other Hand ◽  
Russian State

The article describes the specificity of the changes that took place in the process of dissemination of double negation, typical for Slavic languages, visible in the Ruthenian recension of Church Slavonic texts. The reflections on the achievements in the field are enriched with the results of research on the text of Gospel No. 7 from the collection of the Russian State Archive of Ancient Acts (RGADA F. 381. Op. 1 Unit hr 7), which has not been analyzed so far in terms of the issues raised. Nearly three hundred negative structures were subjected to observations. In order to determine the number of single negation cases in relation to double negation the main focus was on structures such as: (1) ni Pron + V, (2) ni Pron + ne V oraz (3) ne V + ni Pron. It was determined, among other things, that their use was influenced by both the literature tradition and live language with elements of the northern dialect of the East Slavonic. On the other hand, the analysis of the negative structures preceding homogeneous parts of the sentence revealed the tendency, manifested onthe leaves of the monument, to transform towards the norm of the contemporary Russian language.

scholarly journals Why classical logic is privileged: justification of logics based on translatability

Synthese ◽  
2021 ◽  
Author(s):  
Gerhard Schurz
Keyword(s):  
Classical Logic ◽  
A Priori ◽  
The Other ◽  
Ceteris Paribus ◽  
Quantum Logics ◽  
Other Hand

AbstractIn Sect. 1 it is argued that systems of logic are exceptional, but not a priori necessary. Logics are exceptional because they can neither be demonstrated as valid nor be confirmed by observation without entering a circle, and their motivation based on intuition is unreliable. On the other hand, logics do not express a priori necessities of thinking because alternative non-classical logics have been developed. Section 2 reflects the controversies about four major kinds of non-classical logics—multi-valued, intuitionistic, paraconsistent and quantum logics. Its purpose is to show that there is no particular domain or reason that demands the use of a non-classical logic; the particular reasons given for the non-classical logic can also be handled within classical logic. The result of Sect. 2 is substantiated in Sect. 3, where it is shown (referring to other work) that all four kinds of non-classical logics can be translated into classical logic in a meaning-preserving way. Based on this fact a justification of classical logic is developed in Sect. 4 that is based on its representational optimality. It is pointed out that not many but a few non-classical logics can be likewise representationally optimal. However, the situation is not symmetric: classical logic has ceteris paribus advantages as a unifying metalogic, while non-classical logics can have local simplicity advantages.

scholarly journals qbf2epr: A Tool for Generating EPR Formulas from QBF

10.29007/2b5d ◽  
2018 ◽  
Author(s):  
Martina Seidl ◽  
Florian Lonsing ◽  
Armin Biere
Keyword(s):  
Propositional Logic ◽  
Decision Problem ◽  
The Other ◽  
Quantified Boolean Formulas ◽  
Other Hand ◽  
Boolean Formulas ◽  
The One

We present the tool qbf2epr which translates quantified Boolean formulas (QBF) toformulas in effectively propositional logic (EPR). The decision problem of QBF is theprototypical problem for PSPACE, whereas EPR is NEXPTIME-complete. Thus QBF isembedded in a formalism, which is potentially more succinct. The motivation for this workis twofold. On the one hand, our tool generates challenging benchmarks for EPR solvers.On the other hand, we are interested in how EPR solvers perform compared to QBF solvers and if there are techniques implemented in EPR solvers which would also be valuable in QBF solvers and vice versa.

On Being in a Quandary

2021 ◽  
pp. 209-260
Author(s):  
Crispin Wright
Keyword(s):  
Intuitionistic Logic ◽  
Subject Matter ◽  
Classical Logic ◽  
The Other ◽  
Sorites Paradox ◽  
Metaphysical Realism ◽  
Specific Kind ◽  
Epistemic Conception ◽  
Broad Form

This chapter addresses three problems: the problem of formulating a coherent relativism, the Sorites paradox, and a seldom noticed difficulty in the best intuitionistic case for the revision of classical logic. A response to the latter is proposed which, generalized, contributes towards the solution of the other two. The key to this response is a generalized conception of indeterminacy as a specific kind of intellectual bafflement—Quandary. Intuitionistic revisions of classical logic are merited wherever a subject matter is conceived both as liable to generate Quandary and as subject to a broad form of evidential constraint. So motivated, the distinctions enshrined in intuitionistic logic provide both for a satisfying resolution of the Sorites paradox and a coherent outlet for relativistic views about, for example, matters of taste and morals. An important corollary of the discussion is that an epistemic conception of vagueness can be prised apart from the strong metaphysical realism with which its principal supporters have associated it, and acknowledged to harbour an independent insight.

Sign in / Sign up

Export Citation Format

Share Document