7 found
Sort by:
Disambiguations:
Anna Zamansky [6]A. Zamansky [1]
  1. Arnon Avron & Anna Zamansky, A Triple Correspondence in Canonical Calculi: Strong Cut-Elimination, Coherence, and Non-Deterministic Semantics.
    An (n, k)-ary quantifier is a generalized logical connective, binding k variables and connecting n formulas. Canonical systems with (n, k)-ary quantifiers form a natural class of Gentzen-type systems which in addition to the standard axioms and structural rules have only logical rules in which exactly one occurrence of a quantifier is introduced. The semantics for these systems is provided using two-valued non-deterministic matrices, a generalization of the classical matrix. In this paper we use a constructive syntactic criterion of coherence (...)
    No categories
     
    My bibliography  
     
    Export citation  
  2. Anna Zamansky (2012). A Preferential Framework for Trivialization-Resistant Reasoning with Inconsistent Information. In Luis Farinas del Cerro, Andreas Herzig & Jerome Mengin (eds.), Logics in Artificial Intelligence. Springer. 463--475.
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  3. Anna Zamansky & Arnon Avron (2012). Canonical Signed Calculi with Multi-Ary Quantifiers. Annals of Pure and Applied Logic 163 (7):951-960.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  4. O. Arieli, A. Avron & A. Zamansky (2011). Ideal Paraconsistent Logics. Studia Logica 99 (1-3):31-60.
    We define in precise terms the basic properties that an ‘ideal propositional paraconsistent logic’ is expected to have, and investigate the relations between them. This leads to a precise characterization of ideal propositional paraconsistent logics. We show that every three-valued paraconsistent logic which is contained in classical logic, and has a proper implication connective, is ideal. Then we show that for every n > 2 there exists an extensive family of ideal n -valued logics, each one of which is not (...)
    Translate to English
    | Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  5. Ofer Arieli, Arnon Avron & Anna Zamansky (2011). Maximal and Premaximal Paraconsistency in the Framework of Three-Valued Semantics. Studia Logica 97 (1):31 - 60.
    Maximality is a desirable property of paraconsistent logics, motivated by the aspiration to tolerate inconsistencies, but at the same time retain from classical logic as much as possible. In this paper we introduce the strongest possible notion of maximal paraconsistency, and investigate it in the context of logics that are based on deterministic or non-deterministic three-valued matrices. We show that all reasonable paraconsistent logics based on three-valued deterministic matrices are maximal in our strong sense. This applies to practically all three-valued (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  6. Anna Zamansky & Arnon Avron (2006). Cut-Elimination and Quantification in Canonical Systems. Studia Logica 82 (1):157 - 176.
    Canonical Propositional Gentzen-type systems are systems which in addition to the standard axioms and structural rules have only pure logical rules with the sub-formula property, in which exactly one occurrence of a connective is introduced in the conclusion, and no other occurrence of any connective is mentioned anywhere else. In this paper we considerably generalize the notion of a “canonical system” to first-order languages and beyond. We extend the Propositional coherence criterion for the non-triviality of such systems to rules with (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  7. Anna Zamansky, Nissim Francez & Yoad Winter (2006). A 'Natural Logic' Inference System Using the Lambek Calculus. Journal of Logic, Language and Information 15 (3):273-295.
    This paper develops an inference system for natural language within the ‘Natural Logic’ paradigm as advocated by van Benthem (1997), Sánchez (1991) and others. The system that we propose is based on the Lambek calculus and works directly on the Curry-Howard counterparts for syntactic representations of natural language, with no intermediate translation to logical formulae. The Lambek-based system we propose extends the system by Fyodorov et~al. (2003), which is based on the Ajdukiewicz/Bar-Hillel (AB) calculus Bar Hillel, (1964). This enables the (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation