This paper is a sequel to ‘Belnap-Dunn semantics for natural implicative expansions of Kleene's strong three-valued matrix with two designated values’, where a ‘bivalent’ Belnap-Dunn semantics is provided for all the expansions referred to in its title. The aim of the present paper is to carry out a parallel investigation for all natural implicative expansions of Kleene's strong 3-valued matrix now with only one designated value.

A simple, bivalent semantics is defined for Łukasiewicz’s 4-valued modal logic Łm4. It is shown that according to this semantics, the essential presupposition underlying Łm4 is the following: A is a theorem iff A is true conforming to both the reductionist and possibilist theses defined as follows: rt: the value of modal formulas is equivalent to the value of their respective argument iff A is true, etc.); pt: everything is possible. This presupposition highlights and explains all oddities arising in Łm4.

Łukasiewicz three-valued logic Ł3 is often understood as the set of all 3-valued valid formulas according to Łukasiewicz’s 3-valued matrices. Following Wojcicki, in addition, we shall consider two alternative interpretations of Ł3: “well-determined” Ł3a and “truth-preserving” Ł3b defined by two different consequence relations on the 3-valued matrices. The aim of this paper is to provide (by using Dunn semantics) dual equivalent two-valued under-determined and over-determined interpretations for Ł3, Ł3a and Ł3b. The logic Ł3 is axiomatized as an extension of Routley (...) and Meyer’s basic positive logic following Brady’s strategy for axiomatizing many-valued logics by employing two-valued under-determined or over-determined interpretations. Finally, it is proved that “well determined” Łukasiewicz logics are paraconsistent. (shrink)

The logic TM is the result of adding the mingle axiom, M to Ticket Entailment logic, T. In the present study, it is proved that TM has the variable-sharing property . Ternary relational semantics for TM is provided. Finally, an interesting extension of TM with the vsp is briefly discussed.

Łukasiewicz three-valued logic Ł3 is often understood as the set of all 3-valued valid formulas according to Łukasiewicz’s 3-valued matrices. Following Wojcicki, in addition, we shall consider two alternative interpretations of Ł3: “well-determined” Ł3a and “truth-preserving” Ł3b defined by two different consequence relations on the 3-valued matrices. The aim of this paper is to provide dual equivalent two-valued under-determined and over-determined interpretations for Ł3, Ł3a and Ł3b. The logic Ł3 is axiomatized as an extension of Routley and Meyer’s basic positive (...) logic following Brady’s strategy for axiomatizing many-valued logics by employing two-valued under-determined or over-determined interpretations. Finally, it is proved that “well determined” Łukasiewicz logics are paraconsistent. (shrink)

Our question is: can we embed minimal negation in implicative logics weaker than I→? Previous results show how to define minimal negation in the positive fragment of the logic of relevance R and in contractionless intuitionistic logic. Is it possible to endow weaker positive logics with minimal negation? This paper prooves that minimal negation can be embedded in even such a weak system as Anderson and Belnap’s minimal positive logic.

A restriction of R-Mingle with the variable-sharing property and the Ackermann properties is defined. From an intuitive semantical point of view, this restriction is an alternative to Anderson and Belnap’s logic of entailment E.

Minimal Negation is defined within the basic positive relevance logic in the relational ternary semantics: B+. Thus, by defining a number of subminimal negations in the B+ context, principles of weak negation are shown to be isolable. Complete ternary semantics are offered for minimal negation in B+. Certain forms of reductio are conjectured to be undefinable (in ternary frames) without extending the positive logic. Complete semantics for such kinds of reductio in a properly extended positive logic are offered.

As it is well known, in the forties of the past century, Curry proved that in any logic S closed under Modus Ponens, uniform substitution of propositional variables and the Contraction Law, the naïve Comprehension axiom trivializes S in the sense that all propositions are derivable in S plus CA. Not less known is the fact that, ever since Curry published his proof, theses and rules weaker than W have been shown to cause the same effect as W causes. Among (...) these, the Contraction rule or the Modus Ponens axiom, for example, are to be noted. But, moreover, as Brady has proved, even the Generalized Modus Ponens axiom or the Generalized Contraction rule give rise to “Curry’s Paradox” under the same circumstances as W does. In some previous work by us, “weak relevant model structures” are defined on “weak relevant matrices” by generalizing Brady’s model structure MCL built upon Meyer’s Crystal matrix CL. We have proved that wr-ms only verify logics with the “depth relevance condition”. The aim of this paper is to show how to falsify gMPa and gRW in certain wr-ms. In particular, it will be shown that gMPa is falisfied in any wr-ms and gRW in any wr-ms verifying Routley and Meyer’s basic positive logic B+. (shrink)

Neuroscience has studied deductive reasoning over the last 20 years under the assumption that deductive inferences are not only de jure but also de facto distinct from other forms of inference. The objective of this research is to verify if logically valid deductions leave any cerebral electrical trait that is distinct from the trait left by non-valid deductions. 23 subjects with an average age of 20.35 years were registered with MEG and placed into a two conditions paradigm (100 trials for (...) each condition) which each presented the exact same relational complexity (same variables and content) but had distinct logical complexity. Both conditions show the same electromagnetic components (P3, N4) in the early temporal window (250–525 ms) and P6 in the late temporal window (500–775 ms). The significant activity in both valid and invalid conditions is found in sensors from medial prefrontal regions, probably corresponding to the ACC or to the medial prefrontal cortex. The amplitude and intensity of valid deductions is significantly lower in both temporal windows (p = 0.0003). The reaction time was 54.37% slower in the valid condition. Validity leaves a minimal but measurable hypoactive electrical trait in brain processing. The minor electrical demand is attributable to the recursive and automatable character of valid deductions, suggesting a physical indicator of computational deductive properties. It is hypothesized that all valid deductions are recursive and hypoactive. (shrink)

Hay doble pulsión en el centro de la discusión del razonamiento deductivo. Una conduce aparentemente a la abstracción y dominios arbitrarios, mientras que la otra conduce a la concreción y la dependencia del contenido. El objetivo de esta investigación es diseñar, aplicar y validar un instrumento de evaluación que nos permita corroborar si el razonamiento deductivo maneja reglas lógicas o contenidos. La muestra de estudio se compuso de 80 participantes (edad 18-77 años). El test consta de 60 ítems categorizados en: (...) formalidad, integrabilidad, complejidad y modalidad. Los resultados ponen de manifiesto la fiabilidad del test de razonamiento deductivo con un alpha de Cronbach. 775 y con un índice de validación. 850 para el índice de inteligencia no verbal (INV) del RIAS. Cómo conclusión inferimos que el razonador deductivo no dispone de un cuerpo preciso de reglas generales deductivas, sino que usa colecciones de reglas heurísticas cada vez menos abstractas. (shrink)

LCo with the Converse Ackermann Property is defined as the result of restricting Contraction in LC. Intuitionistic and Superintuitionistic Negation is shown to be compatible with the CAP.

Electrical brain activity modulation in terms of changes in its intensity and spatial distribution is a function of age and task demand. However, the dynamics of brain modulation is unknown when it depends on external factors such as training. The aim of this research is to verify the effect of deductive reasoning training on the modulation in the brain activity of healthy younger and older adults ( (mean age of 21 ± 3.39) and (mean age of 68.92 ± 5.72)). The (...) analysis reveals the benefits of training, showing that it lowers cerebral activation while increasing the number of correct responses in the trained reasoning task (). The brain source generators were identified by time-averaging low-resolution brain electromagnetic tomography (sLORETA) current density images. In both groups, a bilateral overactivation associated with the task and not with age was identified. However, while the profile of bilateral activation in younger adults was symmetrical in anterior areas, in the older ones, the profile was located asymmetrically in anterior and posterior areas. Consequently, bilaterality may be a marker of how the brain adapts to maintain cognitive function in demanding tasks in both age groups. However, the differential bilateral locations across age groups indicate that the tendency to brain modulation is determined by age. (shrink)

It is an intimate experience for us to think, to understand and to perceive things as being identical to themselves, and to suppose, consequently, that things are truly “what” they are. Something is always conceived as itself. The given is given full of itself in all its modifications. For instance, I can think or perceive partially some lips, I can see them almost in their whole or in some of their aspects, or just see them disappear. But it does not (...) seem to be possible to think or to perceive a given as almost itself, as an aspect or as part of itself. It is the aim of this work to study the assumptions and conditions for the original position of sameness in experience, just as it occurs in the synthesis of the datum singular and distinct. The polarization of single tone (einstimmig) intentional rays in an αvτó already contains the aporiae peculiar to the experience of the identical, whose revelation shall lead us, on the one hand, to one of the nuclei of the analysis of passive synthesis, and, on the other hand, to point up how critical revision of the numerical or extensional model of self-identity is for the unity of meaning. Then, it will be a question of pointing out the reasons why in a phenomenology of identity, the renunciation of the phenomenological legitimacy of the αvτó as a guarantee for the different positions of identity must be observed. DOI: 10.1007/978-94-011-3464-4_13 . (shrink)

This paper offers a particular intuitionistic negation completion of Urquhart's system C resulting in a super-intuitionistic contractionless propositional logic equivalent to Dummett's LC without contraction.

Routley- Meyer type relational complete semantics are constructed for intuitionistic contractionless logic with reductio. Different negation completions of positive intuitionistic logic without contraction are treated in a systematical, unified and semantically complete setting.

The BITrum glossary, planned as one of the first activities in the development of the BITrum project, essentially aims at serving as a tool for the clarification of concepts, theories and problems concerning information. Intending to embrace the most relevant points of view with respect to information, it is interdisciplinarily developed by a board of experts coming from a wide variety of scientific fields. The glossarium BITri kindly invites the scientific community to make contributions of any kind aimed at clarifying (...) in the field of information studies. (shrink)

Objetivo. Verificar si el procesamiento semántico de estímulos visuales complejos, como la repetición, la identidad, el orden y la doble incongruencia, es recursivo o computable. Sujetos y métodos. Veintisiete universitarios respondieron a un paradigma adaptado N400 con cinco condiciones, cada una con 80 tareas, mientras se registraba su actividad cerebral con un gorro de 64 electrodos. Resultados. Dos ventanas temporales de 400 a 550 ms y de 550 a 800 ms se analizaron mediante un contraste ANOVA del factor condición por (...) regiones de interés. Además, se calculó la solución inversa de las ventanas mediante tomografía electromagnética de baja resolución para identificar las fuentes corticales subyacentes a los potenciales eléctricos. Se corroboran diferencias significativas (p< 0, 05) en los potenciales N400 y P600 en áreas frontales y centroparietales asociadas a los operadores lógicos estudiados. Conclusión. Se confirma que el procesamiento cerebral de imágenes complejas (congruentes/incongruentes) es modulado por la repetición, la identidad y el orden, pero no por la negación. Por consiguiente, se puede decir que el procesamiento semántico de imágenes complejas es semicomputable. (shrink)

S3o and S4o are the restrictions with the Converse Ackermann Property of the implicative fragments of Lewis' S3 and S4 respectively. The aim of this paper is to provide all possible axiomatizations with independent axioms of S3o and S40 that can be formulated with a modification of Anderson and Belnap's list of valid entailments.

We define two extensions of Lewis’ S3 with two versions of Peirce’s Law. We prove that both of them have the Ackermann Property.

Entendemos el concepto de “negación mínima” en el sentido clásico definido por Johansson. El propósito de este artículo es definir la lógica positiva mínima Bp+, y probar que la negación mínima puede introducirse en ella. Además, comentaremos algunas de las múltiples extensiones negativas de Bp+.“Minimal negation” is classically understood in a Johansson sense. The aim of this paper is to define the minimal positive logic Bp+ and prove that a minimal negation can be inroduced in it. In addition, some of (...) the many possible negation extensions of Bp+ are commented. (shrink)

Etude de l'extension par la negation semi-intuitionniste de la logique positive des propositions appelee logique C, developpee par A. Urquhart afin de definir une semantique relationnelle valable pour la logique des valeurs infinies de Lukasiewicz (Lw). Evitant les axiomes de contraction et de reduction propres a la logique classique de Dummett, l'A. propose une semantique de type Routley-Meyer pour le systeme d'Urquhart (CI) en tant que celle-la ne fournit que des theories consistantes pour la completude de celui-ci.

As it is well known, Relevance Logic R plus the axiom mingle (R-Mingle) does not have the variable-sharing property (vsp). The aim of this paper is to improve this result by defining a weak logic with the axiom mingle and not included in minimal logic BM lacking the vsp.

S3o and S4o are the restrictions with the Converse Ackermann Property of the implicative fragments of Lewis' S3 and S4 respectively. The aim of this paper is to provide all possible axiomatizations with independent axioms of S3o and S4o that can be formulated with a modification of Anderson and Belnap's list of valid entailments.

Entendemos el concepto de “negación mínima” en el sentido clásico definido por Johansson. El propósito de este artículo es definir la lógica positiva mínima Bp+, y probar que la negación mínima puede introducirse en ella. Además, comentaremos algunas de las múltiples extensiones negativas de Bp+.“Minimal negation” is classically understood in a Johansson sense. The aim of this paper is to define the minimal positive logic Bp+ and prove that a minimal negation can be inroduced in it. In addition, some of (...) the many possible negation extensions of Bp+ are commented. (shrink)

The concept of constructive negation we refer to in this paper is (minimally) intuitionistic in character (see [1]). The idea is to understand the negation of a proposition A as equivalent to A implying a falsity constant of some sort. Then, negation is introduced either by means of this falsity constant or, as in this paper, by means of a propositional connective defined with the constant. But, unlike intuitionisitc logic, the type of negation we develop here is, of course, devoid (...) of paradoxes of relevance. (shrink)

We define two extensions of Lewis’ S3 with two versions of Peirce’s Law. We prove that both of them have the Ackermann Property.