13 found
Anna Zamansky [13]A. Zamansky [2]
  1. Ideal Paraconsistent Logics.O. Arieli, A. Avron & A. Zamansky - 2011 - 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 (...)
    Direct download (6 more)  
    Export citation  
    Bookmark   19 citations  
  2.  41
    Maximal and Premaximal Paraconsistency in the Framework of Three-Valued Semantics.Ofer Arieli, Arnon Avron & Anna Zamansky - 2011 - 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 (4 more)  
    Export citation  
    Bookmark   14 citations  
  3.  9
    A paraconsistent view on B and S5.Arnon Avron & Anna Zamansky - 2016 - In Lev Beklemishev, Stéphane Demri & András Máté (eds.), Advances in Modal Logic, Volume 11. CSLI Publications. pp. 21-37.
    No categories
    Direct download  
    Export citation  
    Bookmark   4 citations  
  4.  75
    A 'natural logic' inference system using the Lambek calculus.Anna Zamansky, Nissim Francez & Yoad Winter - 2006 - 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, Sánchez 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., which is based on the Ajdukiewicz/Bar-Hillel calculus Bar Hillel,. This enables the system to deal with (...)
    Direct download (4 more)  
    Export citation  
    Bookmark   5 citations  
  5.  15
    Paraconsistency, self-extensionality, modality.Arnon Avron & Anna Zamansky - 2020 - Logic Journal of the IGPL 28 (5):851-880.
    Paraconsistent logics are logics that, in contrast to classical and intuitionistic logic, do not trivialize inconsistent theories. In this paper we take a paraconsistent view on two famous modal logics: B and S5. We use for this a well-known general method for turning modal logics to paraconsistent logics by defining a new negation as $\neg \varphi =_{Def} \sim \Box \varphi$. We show that while that makes both B and S5 members of the well-studied family of paraconsistent C-systems, they differ from (...)
    Direct download (3 more)  
    Export citation  
    Bookmark   1 citation  
  6. Cut-Elimination and Quantification in Canonical Systems.Anna Zamansky & Arnon Avron - 2006 - 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 (4 more)  
    Export citation  
    Bookmark   1 citation  
  7.  10
    Arnon Avron on Semantics and Proof Theory of Non-Classical Logics.Ofer Arieli & Anna Zamansky (eds.) - 2021 - Springer Verlag.
    This book is a collection of contributions honouring Arnon Avron’s seminal work on the semantics and proof theory of non-classical logics. It includes presentations of advanced work by some of the most esteemed scholars working on semantic and proof-theoretical aspects of computer science logic. Topics in this book include frameworks for paraconsistent reasoning, foundations of relevance logics, analysis and characterizations of modal logics and fuzzy logics, hypersequent calculi and their properties, non-deterministic semantics, algebraic structures for many-valued logics, and representations of (...)
    Direct download (2 more)  
    Export citation  
  8.  21
    Preface.Ofer Arieli & Anna Zamansky - 2016 - Logic Journal of the IGPL 24 (3):221-223.
  9.  11
    Simplified forms of computerized reasoning with distance semantics.Ofer Arieli & Anna Zamansky - 2011 - Journal of Applied Logic 9 (1):1-22.
  10. A Triple Correspondence in Canonical Calculi: Strong Cut-Elimination, Coherence, and Non-deterministic Semantics.Arnon Avron & Anna Zamansky - unknown
    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 (...)
    Export citation  
  11.  6
    A preferential framework for trivialization-resistant reasoning with inconsistent information.Anna Zamansky - 2012 - In Luis Farinas del Cerro, Andreas Herzig & Jerome Mengin (eds.), Logics in Artificial Intelligence. Springer. pp. 463--475.
  12.  9
    Canonical signed calculi with multi-ary quantifiers.Anna Zamansky & Arnon Avron - 2012 - Annals of Pure and Applied Logic 163 (7):951-960.
  13.  26
    On recent applications of paraconsistent logic: an exploratory literature review.A. Zamansky - 2019 - Journal of Applied Non-Classical Logics 29 (4):382-391.
    This paper aims to empirically explore the state of practical applications of paraconsistent logics. To this end, we performed an exploratory literature review, analysing papers published between the years 2015 and 2018. Paraconsistent formalisms based on annotated logics are practically the sole type of approach we found to be applied in engineering applications. The engineering problems solved by paraconsistent approaches were mainly in the fields of signal and image processing and decision support. The results of our exploratory review indicate that (...)
    Direct download (4 more)  
    Export citation