Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Arnon Avron
2010 – today
- 2013
[j54]Ori Lahav, Arnon Avron: A semantic proof of strong cut-admissibility for first-order Gödel logic. J. Log. Comput. 23(1): 59-86 (2013)- [j53]Arnon Avron, Beata Konikowska, Anna Zamansky: Cut-free sequent calculi for C-systems with generalized finite-valued semantics. J. Log. Comput. 23(3): 517-540 (2013)
- 2012
- [j52]Anna Zamansky, Arnon Avron: Canonical signed calculi with multi-ary quantifiers. Ann. Pure Appl. Logic 163(7): 951-960 (2012)
- [j51]Arnon Avron, Beata Konikowska: Finite-valued Logics for Information Processing. Fundam. Inform. 114(1): 1-30 (2012)
- [c37]Arnon Avron, Beata Konikowska, Anna Zamansky: Modular Construction of Cut-free Sequent Calculi for Paraconsistent Logics. LICS 2012: 85-94
- 2011
- [j50]Arnon Avron: A Simple Proof of Completeness and Cut-admissibility for Propositional Gödel Logic. J. Log. Comput. 21(5): 813-821 (2011)
- [j49]Ofer Arieli, Arnon Avron, Anna Zamansky: Maximal and Premaximal Paraconsistency in the Framework of Three-Valued Semantics. Studia Logica 97(1): 31-60 (2011)
- [j48]Ofer Arieli, Arnon Avron, Anna Zamansky: Ideal Paraconsistent Logics. Studia Logica 99(1-3): 31-60 (2011)
- [c36]
- [c35]Ofer Arieli, Arnon Avron, Anna Zamansky: What Is an Ideal Logic for Reasoning with Inconsistency?. IJCAI 2011: 706-711
- [c34]
- [c33]
- 2010
- [j47]Arnon Avron, Ori Lahav: On Constructive Connectives and Systems. Logical Methods in Computer Science 6(4) (2010)
- [c32]Arnon Avron, Ori Lahav: Strict Canonical Constructive Systems. Fields of Logic and Computation 2010: 75-94
- [c31]
- [c30]Arnon Avron, Jonathan Ben-Naim, Beata Konikowska: Logics of Reasonable Information Sources. ISMVL 2010: 61-66
- [c29]
- [c28]Arnon Avron, Ofer Arieli, Anna Zamansky: On Strong Maximality of Paraconsistent Finite-Valued Logics. LICS 2010: 304-313
2000 – 2009
- 2009
- [j46]
- [j45]Arnon Avron, Beata Konikowska: Proof Systems for Reasoning about Computation Errors. Studia Logica 91(2): 273-293 (2009)
- [j44]
- [c27]Arnon Avron, Agata Ciabattoni, Anna Zamansky: Canonical Calculi: Invertibility, Axiom Expansion and (Non)-determinism. CSR 2009: 26-37
- [c26]Arnon Avron, Anna Zamansky: Canonical Signed Calculi, Non-deterministic Matrices and Cut-Elimination. LFCS 2009: 31-45
- [c25]
- 2008
- [j43]Arnon Avron, Anna Zamansky: Canonical Calculi with (n, k)-ary Quantifiers. Logical Methods in Computer Science 4(3) (2008)
- [j42]
- [j41]Arnon Avron: Constructibility and decidability versus domain independence and absoluteness. Theor. Comput. Sci. 394(3): 144-158 (2008)
- [c24]Arnon Avron, Nachum Dershowitz, Alexander Rabinovich: Boris A. Trakhtenbrot: Academic Genealogy and Publications. Pillars of Computer Science 2008: 46-57
- [c23]Arnon Avron: A Framework for Formalizing Set Theories Based on the Use of Static Set Terms. Pillars of Computer Science 2008: 87-106
- [c22]Arnon Avron, Anna Zamansky: A Triple Correspondence in Canonical Calculi: Strong Cut-Elimination, Coherence, and Non-deterministic Semantics. CSR 2008: 52-63
- [e1]Arnon Avron, Nachum Dershowitz, Alexander Rabinovich (Eds.): Pillars of Computer Science, Essays Dedicated to Boris (Boaz) Trakhtenbrot on the Occasion of His 85th Birthday. Lecture Notes in Computer Science 4800, Springer 2008, ISBN 978-3-540-78126-4
- [i1]
- 2007
- [j40]Arnon Avron: Non-deterministic semantics for logics with a consistency operator. Int. J. Approx. Reasoning 45(2): 271-287 (2007)
- [j39]Arnon Avron, Jonathan Ben-Naim, Beata Konikowska: Cut-Free Ordinary Sequent Calculi for Logics Having Generalized Finite-Valued Semantics. Logica Universalis 1(1): 41-70 (2007)
- [j38]Anna Zamansky, Arnon Avron: Effective Non-deterministic Semantics for First-order LFIs. Multiple-Valued Logic and Soft Computing 13(4-6): 335-352 (2007)
- [c21]Arnon Avron, Anna Zamansky: Non-deterministic Multi-valued Matrices for First-Order Logics of Formal Inconsistency. ISMVL 2007: 14
- [c20]Arnon Avron, Anna Zamansky: Generalized Non-deterministic Matrices and (n, k)-ary Quantifiers. LFCS 2007: 26-40
- 2006
- [j37]Anna Zamansky, Arnon Avron: Cut-Elimination and Quantification in Canonical Systems. Studia Logica 82(1): 157-176 (2006)
- [c19]Arnon Avron, Anna Zamansky: Many-Valued Non-deterministic Semantics for First-Order Logics of Formal (In)consistency. Algebraic and Proof-theoretic Aspects of Non-classical Logics 2006: 1-24
- [c18]Anna Zamansky, Arnon Avron: Canonical Gentzen-Type Calculi with (n, k)-ary Quantifiers. IJCAR 2006: 251-265
- [c17]Arnon Avron: From Constructibility and Absoluteness to Computability and Domain Independence. CiE 2006: 11-20
- [c16]Anna Zamansky, Arnon Avron: Non-Deterministic Semantics for First-Order Paraconsistent Logics. KR 2006: 431-439
- 2005
- [j36]Arnon Avron, Beata Konikowska: Multi-valued Calculi for Logics Based on Non-determinism. Logic Journal of the IGPL 13(4): 365-387 (2005)
- [j35]Arnon Avron: Combining classical logic, paraconsistency and relevance. J. Applied Logic 3(1): 133-160 (2005)
- [j34]Arnon Avron, Iddo Lev: Non-deterministic Multiple-valued Structures. J. Log. Comput. 15(3): 241-261 (2005)
- [j33]Arnon Avron: A Non-deterministic View on Non-classical Negations. Studia Logica 80(2-3): 159-194 (2005)
- [c15]Arnon Avron: Logical Non-determinism as a Tool for Logical Modularity: An Introduction. We Will Show Them! (1) 2005: 105-124
- [c14]
- [c13]Arnon Avron, Anna Zamansky: Quantification in Non-Deterministic Multi-Valued Structures. ISMVL 2005: 296-301
- 2004
- [c12]
- [c11]
- 2003
- [c10]
- 2001
- [j32]Arnon Avron, Beata Konikowska: Decomposition Proof Systems for Gödel-Dummett Logics. Studia Logica 69(2): 197-219 (2001)
- [c9]
- [c8]
- 2000
- [j31]Ofer Arieli, Arnon Avron: General Patterns for Nonmonotonic Reasoning: From Basic Entailments to Plausible Relations. Logic Journal of the IGPL 8(2): 119-148 (2000)
- [j30]Arnon Avron: Implicational F-Structures and Implicational Relevance Logics. J. Symb. Log. 65(2): 788-802 (2000)
- [c7]Arnon Avron: A Tableau System for Gödel-Dummett Logic Based on a Hypersequent Calculus. TABLEAUX 2000: 98-111
1990 – 1999
- 1999
- [j29]Ofer Arieli, Arnon Avron: A Model-Theoretic Approach for Recovering Consistent Data from Inconsistent Knowledge Bases. J. Autom. Reasoning 22(2): 263-309 (1999)
- [j28]Arnon Avron: On the Expressive Power of Three-Valued and Four-Valued Languages. J. Log. Comput. 9(6): 977-994 (1999)
- [c6]Ofer Arieli, Arnon Avron: Nonmonotonic and Paraconsistent Reasoning: From Basic Entailments to Plausible Relations. ESCQARU 1999: 11-21
- 1998
- [j27]
- [j26]Arnon Avron: Formulas for which Contraction is Admissible. Logic Journal of the IGPL 6(1): 43-48 (1998)
- [j25]Arnon Avron: Two Types of Multiple-Conclusion Systems. Logic Journal of the IGPL 6(5): 695-717 (1998)
- [j24]Arnon Avron: Multiplicative Conjunction and an Algebraic Meaning of Contraction and Weakening. J. Symb. Log. 63(3): 831-859 (1998)
- [j23]Arnon Avron, Furio Honsell, Marino Miculan, Cristian Paravano: Encoding Modal Logics in Logical Frameworks. Studia Logica 60(1): 161-208 (1998)
- [c5]
- 1997
- [j22]Arnon Avron: Multiplicative Conjunction as an Extensional Conjunction. Logic Journal of the IGPL 5(2): 181-208 (1997)
- 1996
- [j21]Ofer Arieli, Arnon Avron: Reasoning with Logical Bilattices. Journal of Logic, Language and Information 5(1): 25-63 (1996)
- [j20]Arnon Avron: The Structure of Interlaced Bilattices. Mathematical Structures in Computer Science 6(3): 287-299 (1996)
- [c4]
- [c3]Ofer Arieli, Arnon Avron: Automatic Diagnoses for Properly Stratified Knowledge-Bases. ICTAI 1996: 392-399
- 1995
- [j19]Arnon Avron: A Note on the Structure of Bilattices. Mathematical Structures in Computer Science 5(3): 431-438 (1995)
- 1994
- [j18]Arnon Avron, Nada Sasson: Stability, Sequentiality and Demand Driven Evaluation in Dataflow. Formal Asp. Comput. 6(6): 620-642 (1994)
- [j17]Arnon Avron: Some Properties of Linear Logic Proved by Semantic Methods. J. Log. Comput. 4(6): 929-938 (1994)
- [j16]Arnon Avron, Yoram Hirshfeld: Queries evaluation, relative safety, and domain independence in first-order database languages with functions. Meth. of Logic in CS 1(3): 261-277 (1994)
- [c2]
- 1993
- [j15]Arnon Avron: An Exercise in an Interactive Geometrical Research. Ann. Math. Artif. Intell. 9(3-4): 239-252 (1993)
- [j14]Arnon Avron: Gentzen-Type Systems, Resolution and Tableaux. J. Autom. Reasoning 10(2): 265-281 (1993)
- 1992
- [j13]Arnon Avron, Furio Honsell, Ian A. Mason, Robert Pollack: Using Typed Lambda Calculus to Implement Formal Systems on a Machine. J. Autom. Reasoning 9(3): 309-354 (1992)
- [j12]
- 1991
- [j11]Arnon Avron: Hypersequents, logical consequence and intermediate logics for concurrency. Ann. Math. Artif. Intell. 4: 225-248 (1991)
- [j10]
- [j9]Arnon Avron: Natural 3-Valued Logics - Characterization and Proof Theory. J. Symb. Log. 56(1): 276-294 (1991)
- [j8]Arnon Avron: Relevance and Paraconsistency - A New Approach, Part III: Cut-Free Gentzen-Type Systems. Notre Dame Journal of Formal Logic 32(1): 147-160 (1991)
- [c1]
- 1990
- [j7]
- [j6]Arnon Avron: Gentzenizing Schroeder-Heister's Natural Extension of Natural Deduction. Notre Dame Journal of Formal Logic 31(1): 127-135 (1990)
- [j5]Arnon Avron: Relevance and Paraconsistency - A New Approach, Part II: The Formal Systems. Notre Dame Journal of Formal Logic 31(2): 169-202 (1990)
1980 – 1989
- 1988
- [j4]
- 1987
- [j3]
- 1984
- [j2]
- [j1]Arnon Avron: On Modal Systems Having Arithmetical Interpretations. J. Symb. Log. 49(3): 935-942 (1984)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-28 21:40 CEST by the dblp team