11 found
Order:
  1.  40
    Some characterization theorems for infinitary universal horn logic without equality.Pilar Dellunde & Ramon Jansana - 1996 - Journal of Symbolic Logic 61 (4):1242-1260.
    In this paper we mainly study preservation theorems for two fragments of the infinitary languagesLκκ, withκregular, without the equality symbol: the universal Horn fragment and the universal strict Horn fragment. In particular, whenκisω, we obtain the corresponding theorems for the first-order case.The universal Horn fragment of first-order logic (with equality) has been extensively studied; for references see [10], [7] and [8]. But the universal Horn fragment without equality, used frequently in logic programming, has received much less attention from the model (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   15 citations  
  2.  26
    Löwenheim–Skolem theorems for non-classical first-order algebraizable logics: Table 1.Pilar Dellunde, Àngel García-Cerdaña & Carles Noguera - 2016 - Logic Journal of the IGPL 24 (3):321-345.
  3.  20
    The logical style painting classifier based on Horn clauses and explanations.Vicent Costa, Pilar Dellunde & Zoe Falomir - 2021 - Logic Journal of the IGPL 29 (1):96-119.
    This paper presents a logical Style painting classifier based on evaluated Horn clauses, qualitative colour descriptors and Explanations. Three versions of $\ell $-SHE are defined, using rational Pavelka logic, and expansions of Gödel logic and product logic with rational constants: RPL, $G$ and $\sqcap $, respectively. We introduce a fuzzy representation of the more representative colour traits for the Baroque, the Impressionism and the Post-Impressionism art styles. The $\ell $-SHE algorithm has been implemented in Swi-Prolog and tested on 90 paintings (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  4. A finitary 1-equivalential logic not finitely equivalential.Pilar Dellunde - 1995 - Bulletin of the Section of Logic 24 (3):120-122.
     
    Export citation  
     
    Bookmark   6 citations  
  5.  40
    On the existence of free models in fuzzy universal Horn classes.Vicent Costa & Pilar Dellunde - 2017 - Journal of Applied Logic 23:3-15.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  6.  59
    On elementary equivalence in fuzzy predicate logics.Pilar Dellunde & Francesc Esteva - 2013 - Archive for Mathematical Logic 52 (1-2):1-17.
    Our work is a contribution to the model theory of fuzzy predicate logics. In this paper we characterize elementary equivalence between models of fuzzy predicate logic using elementary mappings. Refining the method of diagrams we give a solution to an open problem of Hájek and Cintula (J Symb Log 71(3):863–880, 2006, Conjectures 1 and 2). We investigate also the properties of elementary extensions in witnessed and quasi-witnessed theories, generalizing some results of Section 7 of Hájek and Cintula (J Symb Log (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  7.  13
    The theory of modules of separably closed fields 2.Pilar Dellunde, Françoise Delon & Françoise Point - 2004 - Annals of Pure and Applied Logic 129 (1-3):181-210.
    In Dellunde et al. 997–1015), we determined the complete theory Te of modules of separably closed fields of characteristic p and imperfection degree e, eω{∞}. Here, for 0≠eω, we describe the closed set of the Ziegler spectrum corresponding to Te. Further, we establish a correspondence between certain submodules and n-types and we investigate several notions of dimensions and their relationships with the Lascar rank. Finally, we show that Te has uniform p.p. elimination of imaginaries and deduce uniform weak elimination of (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  8. Syntactic characterizations of first-order structures in mathematical fuzzy logic.Guillermo Badia, Pilar Dellunde, Vicent Costa & Carles Noguera - forthcoming - Soft Computing.
    This paper is a contribution to graded model theory, in the context of mathematical fuzzy logic. We study characterizations of classes of graded structures in terms of the syntactic form of their first-order axiomatization. We focus on classes given by universal and universal-existential sentences. In particular, we prove two amalgamation results using the technique of diagrams in the setting of structures valued on a finite MTL-algebra, from which analogues of the Łoś–Tarski and the Chang–Łoś–Suszko preservation theorems follow.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  9.  10
    Cerrando una brecha: una reflexión multidisciplinar sobre la discriminación algorítmica.Pilar Dellunde, Oriol Pujol & Jordi Vitrià - 2023 - Daimon: Revista Internacional de Filosofía 90:63-80.
    Este artículo aborda el concepto de discriminación algorítmica desde una perspectiva conjunta de la filosofía y la ciencia de la computación, con el propósito de establecer un marco de discusión común para avanzar en el despliegue de las inteligencias artificiales en las sociedades democráticas. Se presenta una definición no normativa de discriminación y se analiza y contextualiza el concepto de algoritmo usando un enfoque intencional, enmarcándolo en el proceso de toma de decisiones e identificando las fuentes de discriminación, así como (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  10.  3
    A defeasible reasoning model of inductive concept learning from examples and communication.Santiago Ontañón, Pilar Dellunde, Lluís Godo & Enric Plaza - 2012 - Artificial Intelligence 193 (C):129-148.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  11.  47
    A Preservation Theorem for Equality-Free Horn Sentences.Pilar Dellunde - 2000 - Theoria: Revista de Teoría, Historia y Fundamentos de la Ciencia 15 (3):517-530.
    We prove the following preservation theorem for the Horn fragment of Equality-free Logic:Theorem 0.1. For any sentence σ ϵ L, the following are equivalent:i ) σ is preserved under Hs, Hs -1 and PR.i i ) σ is logically equivalent to an equality-free Horn sentence.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark