-
668Anderson And Belnap's Minimal Positive Logic With Minimal NegationReports on Mathematical Logic 36 117-130. 2002.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.
-
768Minimal Negation in the Ternary Relational SemanticsReports on Mathematical Logic 39 47-65. 2005.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 lo…Read more
-
735It 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 …Read more
-
105Intuitionistic propositional logic without 'contraction' but with 'reductio'Studia Logica 66 (3): 409-418. 2000.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
-
111Ticket Entailment plus the mingle axiom has the variable-sharing propertyLogic Journal of the IGPL 20 (1): 355-364. 2012.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
-
34Two Extensions of Lewis’ S3 with Peirce’s LawTheoria: Revista de Teoría, Historia y Fundamentos de la Ciencia 14 (3): 407-411. 1999.We define two extensions of Lewis’ S3 with two versions of Peirce’s Law. We prove that both of them have the Ackermann Property.
-
86Urquhart's C with Intuitionistic Negation: Dummett's LC without the Contraction AxiomNotre Dame Journal of Formal Logic 36 (3): 407-413. 1995.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
-
957A natural negation completion of Urquhart's many-valued logic CJournal of Philosophical Logic 27 (1): 75-84. 1998.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 …Read more
-
67Two extensions of Lewis' s3 with Peirce's lawTheoria 14 (3): 407-411. 1999.We define two extensions of Lewis’ S3 with two versions of Peirce’s Law. We prove that both of them have the Ackermann Property
Francisco Salto
Universidad de León
-
Universidad de LeónProfessor