default search action
Arnon Avron
Person information
- affiliation: Tel Aviv University, Blavatnik School of Computer Science, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j83]Arnon Avron:
Poincaré-Weyl's Predicativity: going beyond. Bull. Symb. Log. 30(1): 41-91 (2024) - 2022
- [j82]Arnon Avron, Nachum Dershowitz, Alexander Rabinovich:
Preface. Fundam. Informaticae 186(1-4) (2022) - [j81]Arnon Avron:
Proof Systems for 3-valued Logics Based on Gödel's Implication. Log. J. IGPL 30(3): 437-453 (2022) - 2021
- [j80]Arnon Avron
:
Quasi-canonical systems and their semantics. Synth. 198(22-S): 5353-5371 (2021) - [c51]Arnon Avron:
Proof Systems for Gödel Logics with an Involution. ISMVL 2021: 68-73 - [c50]Arnon Avron
Basing Sequent Systems on Exclusive-Or. TABLEAUX 2021: 112-128 - [c49]Nissan Levi
Analysis in a Formal Predicative Set Theory. WoLLIC 2021: 167-183 - 2020
- [j79]Arnon Avron:
Weyl Reexamined: "das Kontinuum" 100 Years Later. Bull. Symb. Log. 26(1): 26-79 (2020) - [j78]Arnon Avron, Anna Zamansky:
Paraconsistency, self-extensionality, modality. Log. J. IGPL 28(5): 851-880 (2020) - [j77]Arnon Avron:
The Normal and Self-extensional Extension of Dunn-Belnap Logic. Logica Universalis 14(3): 281-296 (2020) - [c48]Arnon Avron:
Why Predicative Sets? Fields of Logic and Computation III 2020: 30-45
2010 – 2019
- 2019
- [j76]Beata Konikowska, Arnon Avron:
Reasoning about Covering-based Rough Sets Using Three Truth Values. FLAP 6(2): 361-382 (2019) - [j75]Arnon Avron, Yoni Zohar:
Rexpansions of Nondeterministic matrices and their Applications in nonclassical Logics. Rev. Symb. Log. 12(1): 173-200 (2019) - [j74]Arnon Avron
Paraconsistency and the need for infinite semantics. Soft Comput. 23(7): 2167-2175 (2019) - [j73]Liron Cohen
The middle ground-ancestral logic. Synth. 196(7): 2671-2693 (2019) - [c47]Yotam Dvir, Arnon Avron:
First-Order Quasi-canonical Proof Systems. TABLEAUX 2019: 77-93 - 2018
- [j72]Arnon Avron, Liron Cohen
Applicable Mathematics in a Minimal Computational Theory of Sets. Log. Methods Comput. Sci. 14(4) (2018) - [c46]Arnon Avron, Ori Lahav:
A Simple Cut-Free System for a Paraconsistent Logic Equivalent to S5. Advances in Modal Logic 2018: 29-42 - [c45]Arnon Avron, Shahar Lev, Nissan Levi:
Safety, Absoluteness, and Computability. CSL 2018: 8:1-8:17 - [c44]Arnon Avron, Liron Cohen
A Minimal Computational Theory of a Minimal Computational Universe. LFCS 2018: 37-54 - [i2]Arnon Avron, Liron Cohen:
Applicable Mathematics in a Minimal Computational Theory of Sets. CoRR abs/1801.02387 (2018) - 2017
- [j71]Arnon Avron:
Cut-elimination in RM Proved Semantically. FLAP 4(3) (2017) - [j70]Arnon Avron, Jean-Yves Béziau:
Self-extensional three-valued paraconsistent logics have no implication. Log. J. IGPL 25(2): 183-194 (2017) - [j69]Arnon Avron:
Self-Extensional Three-Valued Paraconsistent Logics. Logica Universalis 11(3): 297-315 (2017) - [j68]Ofer Arieli, Arnon Avron:
Four-Valued Paradefinite Logics. Stud Logica 105(6): 1087-1122 (2017) - [c43]Arnon Avron, Yoni Zohar:
Non-Deterministic Matrices in Action: Expansions, Refinements, and Rexpansions. ISMVL 2017: 118-123 - 2016
- [j67]Arnon Avron
Paraconsistent fuzzy logic preserving non-falsity. Fuzzy Sets Syst. 292: 75-84 (2016) - [j66]Arnon Avron, Liron Cohen:
Formalizing Scientifically Applicable Mathematics in a Definitional Framework. J. Formaliz. Reason. 9(1): 53-70 (2016) - [j65]Arnon Avron, Nachum Dershowitz:
Cayley's Formula: A Page From The Book. Am. Math. Mon. 123(7): 699-700 (2016) - [c42]Arnon Avron, Anna Zamansky:
A paraconsistent view on B and S5. Advances in Modal Logic 2016: 21-37 - [c41]Arnon Avron:
A Logical Framework for Developing and Mechanizing Set Theories. IJCAR 2016: 3-8 - [c40]Ofer Arieli, Arnon Avron:
Minimal Paradefinite Logics for Reasoning with Incompleteness and Inconsistency. FSCD 2016: 7:1-7:15 - 2015
- [j64]Ori Lahav
A cut-free calculus for second-order Gödel logic. Fuzzy Sets Syst. 276: 1-30 (2015) - [j63]Arnon Avron, Beata Konikowska
Efficient reasoning with inconsistent information using C-systems. Inf. Sci. 296: 219-236 (2015) - 2014
- [j62]Arnon Avron:
What is relevance logic? Ann. Pure Appl. Log. 165(1): 26-48 (2014) - [j61]Arnon Avron:
Paraconsistency, paracompleteness, Gentzen systems, and trivalent semantics. J. Appl. Non Class. Logics 24(1-2): 12-34 (2014) - [j60]Arnon Avron:
The Classical Constraint on Relevance. Logica Universalis 8(1): 1-15 (2014) - [c39]Liron Cohen
Ancestral Logic: A Proof Theoretical Study. WoLLIC 2014: 137-151 - 2013
- [j59]Ori Lahav
A semantic proof of strong cut-admissibility for first-order Gödel logic. J. Log. Comput. 23(1): 59-86 (2013) - [j58]Arnon Avron, Beata Konikowska
Cut-free sequent calculi for C-systems with generalized finite-valued semantics. J. Log. Comput. 23(3): 517-540 (2013) - [j57]Ori Lahav
A unified semantic framework for fully structural propositional sequent systems. ACM Trans. Comput. Log. 14(4): 27:1-27:33 (2013) - 2012
- [j56]Anna Zamansky, Arnon Avron:
Canonical signed calculi with multi-ary quantifiers. Ann. Pure Appl. Log. 163(7): 951-960 (2012) - [j55]Arnon Avron, Beata Konikowska
Finite-valued Logics for Information Processing. Fundam. Informaticae 114(1): 1-30 (2012) - [c38]Arnon Avron, Beata Konikowska
Modular Construction of Cut-free Sequent Calculi for Paraconsistent Logics. LICS 2012: 85-94 - 2011
- [j54]Arnon Avron:
A Simple Proof of Completeness and Cut-admissibility for Propositional Gödel Logic. J. Log. Comput. 21(5): 813-821 (2011) - [j53]Ofer Arieli, Arnon Avron, Anna Zamansky:
Maximal and Premaximal Paraconsistency in the Framework of Three-Valued Semantics. Stud Logica 97(1): 31-60 (2011) - [j52]Ofer Arieli, Arnon Avron, Anna Zamansky:
Ideal Paraconsistent Logics. Stud Logica 99(1-3): 31-60 (2011) - [c37]Arnon Avron, Ori Lahav
A Multiple-Conclusion Calculus for First-Order Gödel Logic. CSR 2011: 456-469 - [c36]Ori Lahav
Non-deterministic Connectives in Propositional Godel Logic. EUSFLAT Conf. 2011: 175-182 - [c35]Ofer Arieli, Arnon Avron, Anna Zamansky:
What Is an Ideal Logic for Reasoning with Inconsistency?. IJCAI 2011: 706-711 - [c34]Arnon Avron, Ori Lahav
Kripke Semantics for Basic Sequent Systems. TABLEAUX 2011: 43-57 - [c33]Arnon Avron:
A Logical Framework for Set Theories. LSFA 2011: 3-15 - 2010
- [j51]Arnon Avron, Ori Lahav
On Constructive Connectives and Systems. Log. Methods Comput. Sci. 6(4) (2010) - [c32]Arnon Avron, Ori Lahav
Strict Canonical Constructive Systems. Fields of Logic and Computation 2010: 75-94 - [c31]Arnon Avron, Anna Zamansky:
Non-deterministic Multi-valued Logics--A Tutorial. ISMVL 2010: 53-60 - [c30]Arnon Avron, Jonathan Ben-Naim, Beata Konikowska
Logics of Reasonable Information Sources. ISMVL 2010: 61-66 - [c29]Ofer Arieli, Arnon Avron, Anna Zamansky:
Maximally Paraconsistent Three-Valued Logics. KR 2010 - [c28]Arnon Avron, Ofer Arieli, Anna Zamansky:
On Strong Maximality of Paraconsistent Finite-Valued Logics. LICS 2010: 304-313
2000 – 2009
- 2009
- [j50]Arnon Avron:
Editorial: Proof Theory Corner. J. Log. Comput. 19(6): 969 (2009) - [j49]Arnon Avron, Beata Konikowska
Proof Systems for Reasoning about Computation Errors. Stud Logica 91(2): 273-293 (2009) - [j48]Arnon Avron:
Multi-valued Semantics: Why and How. Stud Logica 92(2): 163-182 (2009) - [c27]Arnon Avron, Agata Ciabattoni
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]Arnon Avron, Ori Lahav
Canonical Constructive Systems. TABLEAUX 2009: 62-76 - [p1]Arnon Avron, Jonathan Ben-Naim, Beata Konikowska:
Processing Information from a Set of Sources. Towards Mathematical Philosophy 2009: 165-186 - 2008
- [j47]Arnon Avron, Anna Zamansky:
Canonical Calculi with (n, k)-ary Quantifiers. Log. Methods Comput. Sci. 4(3) (2008) - [j46]Arnon Avron, Beata Konikowska
Rough Sets and 3-Valued Logics. Stud Logica 90(1): 69-92 (2008) - [j45]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:
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 [contents] - [i1]Arnon Avron, Anna Zamansky:
Canonical calculi with (n,k)-ary quantifiers. CoRR abs/0806.0081 (2008) - 2007
- [j44]Arnon Avron:
Non-deterministic semantics for logics with a consistency operator. Int. J. Approx. Reason. 45(2): 271-287 (2007) - [j43]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) - [j42]Anna Zamansky, Arnon Avron:
Effective Non-deterministic Semantics for First-order LFIs. J. Multiple Valued Log. Soft Comput. 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
- [j41]Anna Zamansky, Arnon Avron:
Cut-Elimination and Quantification in Canonical Systems. Stud 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
- [j40]Arnon Avron, Beata Konikowska
Multi-valued Calculi for Logics Based on Non-determinism. Log. J. IGPL 13(4): 365-387 (2005) - [j39]Arnon Avron:
Combining classical logic, paraconsistency and relevance. J. Appl. Log. 3(1): 133-160 (2005) - [j38]Arnon Avron, Iddo Lev:
Non-deterministic Multiple-valued Structures. J. Log. Comput. 15(3): 241-261 (2005) - [j37]Arnon Avron:
A Non-deterministic View on Non-classical Negations. Stud 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]Arnon Avron:
Non-deterministic Semantics for Paraconsistent C-Systems. ECSQARU 2005: 625-637 - [c13]Arnon Avron, Anna Zamansky:
Quantification in Non-Deterministic Multi-Valued Structures. ISMVL 2005: 296-301 - 2004
- [c12]Arnon Avron, Iddo Lev:
Non-Deterministic Matrices. ISMVL 2004: 282-287 - [c11]Arnon Avron:
Formalizing Set Theory as it Is Actually Used. MKM 2004: 32-43 - 2003
- [c10]Arnon Avron:
Tableaux with Four Signs as a Unified Framework. TABLEAUX 2003: 4-16 - 2001
- [j36]Arnon Avron, Beata Konikowska
Decomposition Proof Systems for Gödel-Dummett Logics. Stud Logica 69(2): 197-219 (2001) - [c9]Arnon Avron, Iddo Lev:
Canonical Propositional Gentzen-Type Systems. IJCAR 2001: 529-544 - [c8]Arnon Avron:
Classical Gentzen-Type Methods in Propositional Many-Valued Logics. ISMVL 2001: 287-298 - 2000
- [j35]Ofer Arieli, Arnon Avron:
General Patterns for Nonmonotonic Reasoning: From Basic Entailments to Plausible Relations. Log. J. IGPL 8(2): 119-148 (2000) - [j34]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
- [j33]Ofer Arieli, Arnon Avron:
A Model-Theoretic Approach for Recovering Consistent Data from Inconsistent Knowledge Bases. J. Autom. Reason. 22(2): 263-309 (1999) - [j32]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
- [j31]Ofer Arieli, Arnon Avron:
The Value of the Four Values. Artif. Intell. 102(1): 97-141 (1998) - [j30]Arnon Avron:
Formulas for which Contraction is Admissible. Log. J. IGPL 6(1): 43-48 (1998) - [j29]Arnon Avron:
Two Types of Multiple-Conclusion Systems. Log. J. IGPL 6(5): 695-717 (1998) - [j28]Arnon Avron:
Multiplicative Conjunction and an Algebraic Meaning of Contraction and Weakening. J. Symb. Log. 63(3): 831-859 (1998) - [j27]Arnon Avron, Furio Honsell, Marino Miculan
Encoding Modal Logics in Logical Frameworks. Stud Logica 60(1): 161-208 (1998) - [c5]Ofer Arieli, Arnon Avron:
The Logical Role of the Four-Valued Bilattice. LICS 1998: 118-126 - 1997
- [j26]Arnon Avron:
Multiplicative Conjunction as an Extensional Conjunction. Log. J. IGPL 5(2): 181-208 (1997) - 1996
- [j25]Ofer Arieli, Arnon Avron:
Reasoning with Logical Bilattices. J. Log. Lang. Inf. 5(1): 25-63 (1996) - [j24]Arnon Avron:
The Structure of Interlaced Bilattices. Math. Struct. Comput. Sci. 6(3): 287-299 (1996) - [c4]Ofer Arieli, Arnon Avron:
Four-Valued Diagnoses for Stratified Knowledge-Bases. CSL 1996: 1-17 - [c3]Ofer Arieli, Arnon Avron:
Automatic Diagnoses for Properly Stratified Knowledge-Bases. ICTAI 1996: 392-399 - 1995
- [j23]Arnon Avron:
A Note on the Structure of Bilattices. Math. Struct. Comput. Sci. 5(3): 431-438 (1995) - 1994
- [j22]Arnon Avron, Nada Sasson:
Stability, Sequentiality and Demand Driven Evaluation in Dataflow. Formal Aspects Comput. 6(6): 620-642 (1994) - [j21]Arnon Avron:
Some Properties of Linear Logic Proved by Semantic Methods. J. Log. Comput. 4(6): 929-938 (1994) - [j20]Arnon Avron, Yoram Hirshfeld:
Queries evaluation, relative safety, and domain independence in first-order database languages with functions. Methods Log. Comput. Sci. 1(3): 261-277 (1994) - [c2]Ofer Arieli, Arnon Avron:
Logical Bilattices and Inconsistent Data. LICS 1994: 468-476 - 1993
- [j19]Arnon Avron:
An Exercise in an Interactive Geometrical Research. Ann. Math. Artif. Intell. 9(3-4): 239-252 (1993) - [j18]Arnon Avron:
Gentzen-Type Systems, Resolution and Tableaux. J. Autom. Reason. 10(2): 265-281 (1993) - 1992
- [j17]Arnon Avron, Furio Honsell, Ian A. Mason, Robert Pollack:
Using Typed Lambda Calculus to Implement Formal Systems on a Machine. J. Autom. Reason. 9(3): 309-354 (1992) - [j16]Arnon Avron:
Whither relevance logic? J. Philos. Log. 21(3): 243-281 (1992) - [j15]Arnon Avron:
Axiomatic Systems, Deduction and Implication. J. Log. Comput. 2(1): 51-98 (1992) - 1991
- [j14]Arnon Avron:
Hypersequents, logical consequence and intermediate logics for concurrency. Ann. Math. Artif. Intell. 4: 225-248 (1991) - [j13]Arnon Avron:
Simple Consequence Relations. Inf. Comput. 92(1): 105-140 (1991) - [j12]Arnon Avron:
A note of provability, truth and existence. J. Philos. Log. 20(4): 403-409 (1991) - [j11]Arnon Avron:
Natural 3-Valued Logics - Characterization and Proof Theory. J. Symb. Log. 56(1): 276-294 (1991) - [j10]Arnon Avron:
Relevance and Paraconsistency - A New Approach, Part III: Cut-Free Gentzen-Type Systems. Notre Dame J. Formal Log. 32(1): 147-160 (1991) - [c1]Arnon Avron, Yoram Hirshfeld:
On First Order Database Query Languages. LICS 1991: 226-231 - 1990
- [j9]Arnon Avron:
Relevance and Paraconsistency - A New Approach. J. Symb. Log. 55(2): 707-732 (1990) - [j8]Arnon Avron:
Gentzenizing Schroeder-Heister's Natural Extension of Natural Deduction. Notre Dame J. Formal Log. 31(1): 127-135 (1990) - [j7]Arnon Avron:
Relevance and Paraconsistency - A New Approach, Part II: The Formal Systems. Notre Dame J. Formal Log. 31(2): 169-202 (1990)
1980 – 1989
- 1988
- [j6]Arnon Avron:
The Semantics and Proof Theory of Linear Logic. Theor. Comput. Sci. 57: 161-184 (1988) - 1987
- [j5]Arnon Avron:
A Constructive Analysis of RM. J. Symb. Log. 52(4): 939-951 (1987) - 1986
- [j4]Arnon Avron:
On purely relevant logics. Notre Dame J. Formal Log. 27(2): 180-194 (1986) - [j3]Arnon Avron:
On an implication connective of RM. Notre Dame J. Formal Log. 27(2): 201-209 (1986) - 1984
- [j2]Arnon Avron:
Relevant Entailment-Semantics and Formal Systems. J. Symb. Log. 49(2): 334-342 (1984) - [j1]Arnon Avron:
On Modal Systems Having Arithmetical Interpretations. J. Symb. Log. 49(3): 935-942 (1984)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: