Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArnon Avron
- > Home > Persons > Arnon Avron
Publications
- 2020
[j78]Arnon Avron, Anna Zamansky:
Paraconsistency, self-extensionality, modality. Log. J. IGPL 28(5): 851-880 (2020)- 2016
- [c42]Arnon Avron, Anna Zamansky:
A paraconsistent view on B and S5. Advances in Modal Logic 2016: 21-37 - 2015
- [j63]Arnon Avron, Beata Konikowska
, Anna Zamansky:
Efficient reasoning with inconsistent information using C-systems. Inf. Sci. 296: 219-236 (2015) - 2013
- [j58]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
- [j56]Anna Zamansky, Arnon Avron:
Canonical signed calculi with multi-ary quantifiers. Ann. Pure Appl. Log. 163(7): 951-960 (2012) - [c38]Arnon Avron, Beata Konikowska, Anna Zamansky:
Modular Construction of Cut-free Sequent Calculi for Paraconsistent Logics. LICS 2012: 85-94 - 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) - [c35]Ofer Arieli, Arnon Avron, Anna Zamansky:
What Is an Ideal Logic for Reasoning with Inconsistency?. IJCAI 2011: 706-711 - 2010
- [c31]Arnon Avron, Anna Zamansky:
Non-deterministic Multi-valued Logics--A Tutorial. ISMVL 2010: 53-60 - [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 - 2009
- [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 - 2008
- [j47]Arnon Avron, Anna Zamansky:
Canonical Calculi with (n, k)-ary Quantifiers. Log. Methods Comput. Sci. 4(3) (2008) - [c22]Arnon Avron, Anna Zamansky:
A Triple Correspondence in Canonical Calculi: Strong Cut-Elimination, Coherence, and Non-deterministic Semantics. CSR 2008: 52-63 - [i1]Arnon Avron, Anna Zamansky:
Canonical calculi with (n,k)-ary quantifiers. CoRR abs/0806.0081 (2008) - 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 - [c16]Anna Zamansky, Arnon Avron:
Non-Deterministic Semantics for First-Order Paraconsistent Logics. KR 2006: 431-439 - 2005
- [c13]Arnon Avron, Anna Zamansky:
Quantification in Non-Deterministic Multi-Valued Structures. ISMVL 2005: 296-301
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-04-25 01:37 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:
