Zobrazeno 1 - 10
of 11
pro vyhledávání: '"José R. Arrazola Ramírez"'
Autor:
Mauricio Osorio Galindo, José R. Arrazola Ramírez, Miguel Pérez-Gaspar, Alejandro Hernández-Tello
Publikováno v:
Logic Journal of the IGPL. 28:1218-1232
In memoriam José Arrazola Ramírez (1962–2018) The logic $\textbf{G}^{\prime}_3$ was introduced by Osorio et al. in 2008; it is a three-valued logic, closely related to the paraconsistent logic $\textbf{CG}^{\prime}_3$ introduced by Osorio et al.
Publikováno v:
Logica Universalis. 11:507-524
The authors of Beziau and Franceschetto (New directions in paraconsistent logic, vol 152, Springer, New Delhi, 2015) work with logics that have the property of not satisfying any of the formulations of the principle of non contradiction, Beziau and F
Publikováno v:
Journal of Applied Logic. 16:111-127
In [25] Priest developed the da Costa logic (daC); this is a paraconsistent logic which is also a co-intuitionistic logic that contains the logic C ω . Due to its interesting properties it has been studied by Castiglioni, Ertola and Ferguson, and so
Autor:
José R. Arrazola Ramírez, Claudia Zepeda Cortés, Jouko Väänänen, Ruy J. G. B. de Queiroz, Mauricio Osorio Galindo
Publikováno v:
Logic Journal of IGPL.
Publikováno v:
Research in Computing Science. 56:45-52
In any learning process, the learners arrive with a great deal of variables, such as their different learning styles, their affective states and their previous knowledge, among many others. In most cases, their previous knowledge is incomplete or it
Publikováno v:
Journal of Logic and Computation. 18:913-940
Let P be an arbitrary theory and let X be any given logic. Let M be a set of atoms. We say that M is a X-stable model of P if M is a classical model of P and P∪¬M~ proves in logic X all atoms in M, this is denoted by P∪¬M~ ⊩xM. We prove that
Autor:
Juan Antonio Navarro Pérez, Verónica Borja Macías, Mauricio Osorio Galindo, José R. Arrazola Ramírez
Publikováno v:
Journal of Logic and Computation. 16:867-890
We introduce the notion of X-stable models parametrized by a given logic X. Such notion is based on a construction that we call weak completions: a set of atoms M is an X-stable model of a theory T if M is a model of T, in the sense of classical logi
Autor:
José R. Arrazola Ramírez, Mauricio Osorio Galindo, Verónica Borja Macías, Juan Antonio Navarro Pérez
Publikováno v:
Journal of Logic and Computation. 15:787-813
We study logic programs under Gelfond's translation in the context of modal logic S5. We show that for arbitrary logic programs (propositional theories where logic negation is associated with default negation) ground nonmonotonic modal logics between
Publikováno v:
MICAI (Special Sessions)
In this paper, we describe the development of a series of automatic theorem provers for a variety of logics. Provers are developed from a functional approach. The first prover is for Classical Propositional Calculus (CPC), which is based on a constru
Publikováno v:
Monatshefte f�r Mathematik. 129:25-30
Denote by \(\) the family of all real valued functions on a metric space \(\) which satisfy a Lipschitz condition on the compact (bounded) subsets of X. We prove that every homomorphism on \(\) is the evaluation at some point of X if and only if X is