Semi-intuitionistic Logic with Strong Negation

Studia Logica ◽  
2017 ◽  
Vol 106 (2) ◽  
pp. 281-293 ◽  
Author(s):  
Juan Manuel Cornejo ◽  
Ignacio Viglizzo
2021 ◽  
Vol 27 (1) ◽  
pp. 107-123
Author(s):  
Thiago Nascimento ◽  
Umberto Rivieccio

Quasi-Nelson logic is a recently-introduced generalization of Nelson’s constructive logic with strong negation to a non-involutive setting. In the present paper we axiomatize the negation-implication fragment of quasi-Nelson logic (QNI-logic), which constitutes in a sense the algebraizable core of quasi-Nelson logic. We introduce a finite Hilbert-style calculus for QNI-logic, showing completeness and algebraizability with respect to the variety of QNI-algebras. Members of the latter class, also introduced and investigated in a recent paper, are precisely the negation-implication subreducts of quasi-Nelson algebras. Relying on our completeness result, we also show how the negation-implication fragments of intuitionistic logic and Nelson’s constructive logic may both be obtained as schematic extensions of QNI-logic.


Studia Logica ◽  
1977 ◽  
Vol 36 (1-2) ◽  
pp. 49-59 ◽  
Author(s):  
Yuri Gurevich

Author(s):  
Tim Lyon

Abstract This paper studies the relationship between labelled and nested calculi for propositional intuitionistic logic, first-order intuitionistic logic with non-constant domains and first-order intuitionistic logic with constant domains. It is shown that Fitting’s nested calculi naturally arise from their corresponding labelled calculi—for each of the aforementioned logics—via the elimination of structural rules in labelled derivations. The translational correspondence between the two types of systems is leveraged to show that the nested calculi inherit proof-theoretic properties from their associated labelled calculi, such as completeness, invertibility of rules and cut admissibility. Since labelled calculi are easily obtained via a logic’s semantics, the method presented in this paper can be seen as one whereby refined versions of labelled calculi (containing nested calculi as fragments) with favourable properties are derived directly from a logic’s semantics.


Mathematics ◽  
2021 ◽  
Vol 9 (4) ◽  
pp. 385
Author(s):  
Hyeonseung Im

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.


2018 ◽  
Vol 34 (3) ◽  
pp. 633-645
Author(s):  
Cornel Samoilă ◽  
Doru Ursuţiu ◽  
Vlad Jinga

Abstract MOOC appearance has produced, in a first phase, more discussions than contributions. Despite pessimistic opinions or those catastrophic foreseeing the end of the classic education by accepting MOOC, the authors consider that, as it is happening in all situations when a field is reformed, instead of criticism or catastrophic predictions, an assessment should be simply made. MOOC will not be better or worse if it is discussed and dissected but can be tested in action, perfected by results, or abandoned if it has no prospects. Without testing, no decision is valid. A similarity between the MOOC appearance and the appearance of the idea of flying machines heavier than air can be made. In the flight case, the first reaction was a strong negation (including at Academies level) and only performing the first independent flight with an apparatus heavier than air has shifted orientation from denial to contributions. So, practical tests clarified the battle between ideas. The authors of this article encourage the idea of testing–assessment and, therefore, imagined and proposed one software for quickly assess whether MOOC produces changes in knowledge, by simply transferring courses from ‘face-to-face’ environment into the virtual one. Among the methods of statistical analysis for student behavioral changes was chosen the Keppel method. It underpins the assessment method of this work being approached using both the version with one variable and also with three variables. It is intended that this attempts to pave the way for other series of rapid assessment regarding MOOC effects (using other statistical methods). We believe, that this is the only approach that can lead either to improve the system or to renunciation.


1988 ◽  
Vol 53 (4) ◽  
pp. 1177-1187
Author(s):  
W. A. MacCaull

Using formally intuitionistic logic coupled with infinitary logic and the completeness theorem for coherent logic, we establish the validity, in Grothendieck toposes, of a number of well-known, classically valid theorems about fields and ordered fields. Classically, these theorems have proofs by contradiction and most involve higher order notions. Here, the theorems are each given a first-order formulation, and this form of the theorem is then deduced using coherent or formally intuitionistic logic. This immediately implies their validity in arbitrary Grothendieck toposes. The main idea throughout is to use coherent theories and, whenever possible, find coherent formulations of formulas which then allow us to call upon the completeness theorem of coherent logic. In one place, the positive model-completeness of the relevant theory is used to find the necessary coherent formulas.The theorems here deal with polynomials or rational functions (in s indeterminates) over fields. A polynomial over a field can, of course, be represented by a finite string of field elements, and a rational function can be represented by a pair of strings of field elements. We chose the approach whereby results on polynomial rings are reduced to results about the base field, because the theory of polynomial rings in s indeterminates over fields, although coherent, is less desirable from a model-theoretic point of view. Ultimately we are interested in the models.This research was originally motivated by the works of Saracino and Weispfenning [SW], van den Dries [Dr], and Bunge [Bu], each of whom generalized some theorems from algebraic geometry or ordered fields to (commutative, von Neumann) regular rings (with unity).


Sign in / Sign up

Export Citation Format

Share Document