Relevant Entailment-Semantics and Formal Systems. - Arnon Avron (J. Symb. Log., 1984)

On Modal Systems Having Arithmetical Interpretations. - Arnon Avron (J. Symb. Log., 1984)

On purely relevant logics. - Arnon Avron (Notre Dame J. Formal Log., 1986)

On an implication connective of RM. - Arnon Avron (Notre Dame J. Formal Log., 1986)

A Constructive Analysis of RM. - Arnon Avron (J. Symb. Log., 1987)

The Semantics and Proof Theory of Linear Logic. - Arnon Avron (Theor. Comput. Sci., 1988)

Relevance and Paraconsistency - A New Approach. - Arnon Avron (J. Symb. Log., 1990)

Gentzenizing Schroeder-Heister's Natural Extension of Natural Deduction. - Arnon Avron (Notre Dame J. Formal Log., 1990)

Relevance and Paraconsistency - A New Approach, Part II: The Formal Systems. - Arnon Avron (Notre Dame J. Formal Log., 1990)

On First Order Database Query Languages - Arnon Avron; Yoram Hirshfeld (LICS, 1991)

Hypersequents, logical consequence and intermediate logics for concurrency. - Arnon Avron (Ann. Math. Artif. Intell., 1991)

A note of provability, truth and existence. - Arnon Avron (J. Philos. Log., 1991)

Natural 3-Valued Logics - Characterization and Proof Theory. - Arnon Avron (J. Symb. Log., 1991)

Relevance and Paraconsistency - A New Approach, Part III: Cut-Free Gentzen-Type Systems. - Arnon Avron (Notre Dame J. Formal Log., 1991)

Simple Consequence Relations - Arnon Avron (Inf. Comput., 1991)

Using Typed Lambda Calculus to Implement Formal Systems on a Machine. - Arnon Avron; Furio Honsell; Ian A. Mason; Robert Pollack (J. Autom. Reason., 1992)

Whither relevance logic? - Arnon Avron (J. Philos. Log., 1992)

Axiomatic Systems, Deduction and Implication. - Arnon Avron (J. Log. Comput., 1992)

An Exercise in an Interactive Geometrical Research. - Arnon Avron (Ann. Math. Artif. Intell., 1993)

Gentzen-Type Systems, Resolution and Tableaux. - Arnon Avron (J. Autom. Reason., 1993)

Logical Bilattices and Inconsistent Data - Ofer Arieli; Arnon Avron (LICS, 1994)

Stability, Sequentiality and Demand Driven Evaluation in Dataflow. - Arnon Avron; Nada Sasson (Formal Aspects Comput., 1994)

Some Properties of Linear Logic Proved by Semantic Methods. - Arnon Avron (J. Log. Comput., 1994)

Queries evaluation, relative safety, and domain independence in first-order database languages with functions. - Arnon Avron; Yoram Hirshfeld (Methods Log. Comput. Sci., 1994)

A Note on the Structure of Bilattices. - Arnon Avron (Math. Struct. Comput. Sci., 1995)

Four-Valued Diagnoses for Stratified Knowledge-Bases. - Ofer Arieli; Arnon Avron (CSL, 1996)

Automatic Diagnoses for Properly Stratified Knowledge-Bases. - Ofer Arieli; Arnon Avron (ICTAI, 1996)

Reasoning with Logical Bilattices. - Ofer Arieli; Arnon Avron (J. Log. Lang. Inf., 1996)

The Structure of Interlaced Bilattices. - Arnon Avron (Math. Struct. Comput. Sci., 1996)

Multiplicative Conjunction as an Extensional Conjunction. - Arnon Avron (Log. J. IGPL, 1997)

The Logical Role of the Four-Valued Bilattice. - Ofer Arieli; Arnon Avron (LICS, 1998)

The Value of the Four Values. - Ofer Arieli; Arnon Avron (Artif. Intell., 1998)

Formulas for which Contraction is Admissible. - Arnon Avron (Log. J. IGPL, 1998)

Two Types of Multiple-Conclusion Systems. - Arnon Avron (Log. J. IGPL, 1998)

Multiplicative Conjunction and an Algebraic Meaning of Contraction and Weakening. - Arnon Avron (J. Symb. Log., 1998)

Encoding Modal Logics in Logical Frameworks. - Arnon Avron; Furio Honsell; Marino Miculan; Cristian Paravano (Stud Logica, 1998)

Nonmonotonic and Paraconsistent Reasoning: From Basic Entailments to Plausible Relations. - Ofer Arieli; Arnon Avron (ESCQARU, 1999)

A Model-Theoretic Approach for Recovering Consistent Data from Inconsistent Knowledge Bases. - Ofer Arieli; Arnon Avron (J. Autom. Reason., 1999)

On the Expressive Power of Three-Valued and Four-Valued Languages. - Arnon Avron (J. Log. Comput., 1999)

A Tableau System for Gödel-Dummett Logic Based on a Hypersequent Calculus. - Arnon Avron (TABLEAUX, 2000)

General Patterns for Nonmonotonic Reasoning: From Basic Entailments to Plausible Relations. - Ofer Arieli; Arnon Avron (Log. J. IGPL, 2000)

Implicational F-Structures and Implicational Relevance Logics. - Arnon Avron (J. Symb. Log., 2000)

Canonical Propositional Gentzen-Type Systems. - Arnon Avron; Iddo Lev (IJCAR, 2001)

Classical Gentzen-Type Methods in Propositional Many-Valued Logics. - Arnon Avron (ISMVL, 2001)

Decomposition Proof Systems for Gödel-Dummett Logics. - Arnon Avron; Beata Konikowska (Stud Logica, 2001)

Tableaux with Four Signs as a Unified Framework. - Arnon Avron (TABLEAUX, 2003)

Non-Deterministic Matrices. - Arnon Avron; Iddo Lev (ISMVL, 2004)

Formalizing Set Theory as it Is Actually Used. - Arnon Avron (MKM, 2004)

Logical Non-determinism as a Tool for Logical Modularity: An Introduction. - Arnon Avron (We Will Show Them! (1), 2005)

Non-deterministic Semantics for Paraconsistent C-Systems. - Arnon Avron (ECSQARU, 2005)

Quantification in Non-Deterministic Multi-Valued Structures. - Arnon Avron; Anna Zamansky (ISMVL, 2005)

Multi-valued Calculi for Logics Based on Non-determinism. - Arnon Avron; Beata Konikowska (Log. J. IGPL, 2005)

Combining classical logic, paraconsistency and relevance. - Arnon Avron (J. Appl. Log., 2005)

Non-deterministic Multiple-valued Structures. - Arnon Avron; Iddo Lev (J. Log. Comput., 2005)

A Non-deterministic View on Non-classical Negations. - Arnon Avron (Stud Logica, 2005)

Many-Valued Non-deterministic Semantics for First-Order Logics of Formal (In)consistency. - Arnon Avron; Anna Zamansky (Algebraic and Proof-theoretic Aspects of Non-classical Logics, 2006)

Canonical Gentzen-Type Calculi with (n, k)-ary Quantifiers. - Anna Zamansky; Arnon Avron (IJCAR, 2006)

From Constructibility and Absoluteness to Computability and Domain Independence. - Arnon Avron (CiE, 2006)

Non-Deterministic Semantics for First-Order Paraconsistent Logics. - Anna Zamansky; Arnon Avron (KR, 2006)

Cut-Elimination and Quantification in Canonical Systems. - Anna Zamansky; Arnon Avron (Stud Logica, 2006)

Non-deterministic Multi-valued Matrices for First-Order Logics of Formal Inconsistency. - Arnon Avron; Anna Zamansky (ISMVL, 2007)

Generalized Non-deterministic Matrices and (n, k)-ary Quantifiers. - Arnon Avron; Anna Zamansky (LFCS, 2007)

Non-deterministic semantics for logics with a consistency operator. - Arnon Avron (Int. J. Approx. Reason., 2007)

Cut-Free Ordinary Sequent Calculi for Logics Having Generalized Finite-Valued Semantics. - Arnon Avron; Jonathan Ben-Naim; Beata Konikowska (Logica Universalis, 2007)

Effective Non-deterministic Semantics for First-order LFIs. - Anna Zamansky; Arnon Avron (J. Multiple Valued Log. Soft Comput., 2007)

A Framework for Formalizing Set Theories Based on the Use of Static Set Terms. - Arnon Avron (Pillars of Computer Science, 2008)

Boris A. Trakhtenbrot: Academic Genealogy and Publications. - Arnon Avron; Nachum Dershowitz; Alexander Rabinovich (Pillars of Computer Science, 2008)

A Triple Correspondence in Canonical Calculi: Strong Cut-Elimination, Coherence, and Non-deterministic Semantics. - Arnon Avron; Anna Zamansky (CSR, 2008)

Canonical Calculi with (n, k)-ary Quantifiers. - Arnon Avron; Anna Zamansky (Log. Methods Comput. Sci., 2008)

Rough Sets and 3-Valued Logics. - Arnon Avron; Beata Konikowska (Stud Logica, 2008)

Constructibility and decidability versus domain independence and absoluteness. - Arnon Avron (Theor. Comput. Sci., 2008)

Processing Information from a Set of Sources. - Arnon Avron; Jonathan Ben-Naim; Beata Konikowska (Towards Mathematical Philosophy, 2009)

Canonical Calculi: Invertibility, Axiom Expansion and (Non)-determinism. - Arnon Avron; Agata Ciabattoni; Anna Zamansky (CSR, 2009)

Canonical Signed Calculi, Non-deterministic Matrices and Cut-Elimination. - Arnon Avron; Anna Zamansky (LFCS, 2009)

Canonical Constructive Systems. - Arnon Avron; Ori Lahav 001 (TABLEAUX, 2009)

Editorial: Proof Theory Corner. - Arnon Avron (J. Log. Comput., 2009)

Multi-valued Semantics: Why and How. - Arnon Avron (Stud Logica, 2009)

Proof Systems for Reasoning about Computation Errors. - Arnon Avron; Beata Konikowska (Stud Logica, 2009)

Strict Canonical Constructive Systems. - Arnon Avron; Ori Lahav 001 (Fields of Logic and Computation, 2010)

Logics of Reasonable Information Sources. - Arnon Avron; Jonathan Ben-Naim; Beata Konikowska (ISMVL, 2010)

Non-deterministic Multi-valued Logics–A Tutorial. - Arnon Avron; Anna Zamansky (ISMVL, 2010)

Maximally Paraconsistent Three-Valued Logics. - Ofer Arieli; Arnon Avron; Anna Zamansky (KR, 2010)

On Strong Maximality of Paraconsistent Finite-Valued Logics. - Arnon Avron; Ofer Arieli; Anna Zamansky (LICS, 2010)

On Constructive Connectives and Systems - Arnon Avron; Ori Lahav 001 (Log. Methods Comput. Sci., 2010)

A Multiple-Conclusion Calculus for First-Order Gödel Logic. - Arnon Avron; Ori Lahav 001 (CSR, 2011)

Non-deterministic Connectives in Propositional Godel Logic. - Ori Lahav 001; Arnon Avron (EUSFLAT Conf., 2011)

What Is an Ideal Logic for Reasoning with Inconsistency?. - Ofer Arieli; Arnon Avron; Anna Zamansky (IJCAI, 2011)

Kripke Semantics for Basic Sequent Systems. - Arnon Avron; Ori Lahav 001 (TABLEAUX, 2011)

A Logical Framework for Set Theories - Arnon Avron (LSFA, 2011)

A Simple Proof of Completeness and Cut-admissibility for Propositional Gödel Logic. - Arnon Avron (J. Log. Comput., 2011)

Maximal and Premaximal Paraconsistency in the Framework of Three-Valued Semantics. - Ofer Arieli; Arnon Avron; Anna Zamansky (Stud Logica, 2011)

Ideal Paraconsistent Logics. - Ofer Arieli; Arnon Avron; Anna Zamansky (Stud Logica, 2011)

Modular Construction of Cut-free Sequent Calculi for Paraconsistent Logics. - Arnon Avron; Beata Konikowska; Anna Zamansky (LICS, 2012)

Canonical signed calculi with multi-ary quantifiers. - Anna Zamansky; Arnon Avron (Ann. Pure Appl. Log., 2012)

Finite-valued Logics for Information Processing. - Arnon Avron; Beata Konikowska (Fundam. Informaticae, 2012)

Cut-free sequent calculi for C-systems with generalized finite-valued semantics. - Arnon Avron; Beata Konikowska; Anna Zamansky (J. Log. Comput., 2013)

A semantic proof of strong cut-admissibility for first-order Gödel logic. - Ori Lahav 001; Arnon Avron (J. Log. Comput., 2013)

A unified semantic framework for fully structural propositional sequent systems. - Ori Lahav 001; Arnon Avron (ACM Trans. Comput. Log., 2013)

Ancestral Logic: A Proof Theoretical Study. - Liron Cohen 001; Arnon Avron (WoLLIC, 2014)

What is relevance logic? - Arnon Avron (Ann. Pure Appl. Log., 2014)

Paraconsistency, paracompleteness, Gentzen systems, and trivalent semantics. - Arnon Avron (J. Appl. Non Class. Logics, 2014)

The Classical Constraint on Relevance. - Arnon Avron (Logica Universalis, 2014)

A cut-free calculus for second-order Gödel logic. - Ori Lahav 001; Arnon Avron (Fuzzy Sets Syst., 2015)

Efficient reasoning with inconsistent information using C-systems. - Arnon Avron; Beata Konikowska; Anna Zamansky (Inf. Sci., 2015)

A paraconsistent view on B and S5. - Arnon Avron; Anna Zamansky (Advances in Modal Logic, 2016)

A Logical Framework for Developing and Mechanizing Set Theories. - Arnon Avron (IJCAR, 2016)

Minimal Paradefinite Logics for Reasoning with Incompleteness and Inconsistency. - Ofer Arieli; Arnon Avron (FSCD, 2016)

Paraconsistent fuzzy logic preserving non-falsity. - Arnon Avron (Fuzzy Sets Syst., 2016)

Formalizing Scientifically Applicable Mathematics in a Definitional Framework. - Arnon Avron; Liron Cohen 001 (J. Formaliz. Reason., 2016)

Cayley's Formula: A Page From The Book. - Arnon Avron; Nachum Dershowitz (Am. Math. Mon., 2016)

Non-Deterministic Matrices in Action: Expansions, Refinements, and Rexpansions. - Arnon Avron; Yoni Zohar (ISMVL, 2017)

Cut-elimination in RM Proved Semantically. - Arnon Avron (FLAP, 2017)

Self-extensional three-valued paraconsistent logics have no implication. - Arnon Avron; Jean-Yves Béziau (Log. J. IGPL, 2017)

Self-Extensional Three-Valued Paraconsistent Logics. - Arnon Avron (Logica Universalis, 2017)

Four-Valued Paradefinite Logics. - Ofer Arieli; Arnon Avron (Stud Logica, 2017)

A Simple Cut-Free System for a Paraconsistent Logic Equivalent to S5. - Arnon Avron; Ori Lahav 001 (Advances in Modal Logic, 2018)

Safety, Absoluteness, and Computability. - Arnon Avron; Shahar Lev; Nissan Levi (CSL, 2018)

A Minimal Computational Theory of a Minimal Computational Universe. - Arnon Avron; Liron Cohen 001 (LFCS, 2018)

Applicable Mathematics in a Minimal Computational Theory of Sets. - Arnon Avron; Liron Cohen 001 (Log. Methods Comput. Sci., 2018)

First-Order Quasi-canonical Proof Systems. - Yotam Dvir; Arnon Avron (TABLEAUX, 2019)

Reasoning about Covering-based Rough Sets Using Three Truth Values. - Beata Konikowska; Arnon Avron (FLAP, 2019)

Rexpansions of Nondeterministic matrices and their Applications in nonclassical Logics. - Arnon Avron; Yoni Zohar (Rev. Symb. Log., 2019)

Paraconsistency and the need for infinite semantics. - Arnon Avron (Soft Comput., 2019)

The middle ground-ancestral logic. - Liron Cohen 001; Arnon Avron (Synth., 2019)

Why Predicative Sets? - Arnon Avron (Fields of Logic and Computation III, 2020)

Weyl Reexamined: "das Kontinuum" 100 Years Later. - Arnon Avron (Bull. Symb. Log., 2020)

Paraconsistency, self-extensionality, modality. - Arnon Avron; Anna Zamansky (Log. J. IGPL, 2020)

The Normal and Self-extensional Extension of Dunn-Belnap Logic. - Arnon Avron (Logica Universalis, 2020)

Proof Systems for Gödel Logics with an Involution. - Arnon Avron (ISMVL, 2021)

Basing Sequent Systems on Exclusive-Or. - Arnon Avron (TABLEAUX, 2021)

Analysis in a Formal Predicative Set Theory. - Nissan Levi; Arnon Avron (WoLLIC, 2021)

Quasi-canonical systems and their semantics. - Arnon Avron (Synth., 2021)

Preface. - Arnon Avron; Nachum Dershowitz; Alexander Rabinovich (Fundam. Informaticae, 2022)

Proof Systems for 3-valued Logics Based on Gödel's Implication. - Arnon Avron (Log. J. IGPL, 2022)

Poincaré-Weyl's Predicativity: going beyond. - Arnon Avron (Bull. Symb. Log., 2024)