Arnon Avron

Bull. Symb. Log., 2024

2022

Proof Systems for 3-valued Logics Based on Gödel's Implication.

[BibT_eX]

[DOI]

Log. J. IGPL, 2022

Preface.

[BibT_eX]

[DOI]

Nachum Dershowitz

Alexander Rabinovich

Fundam. Informaticae, 2022

2021

Quasi-canonical systems and their semantics.

[BibT_eX]

[DOI]

Synth., 2021

Analysis in a Formal Predicative Set Theory.

[BibT_eX]

[DOI]

Nissan Levi

Proceedings of the Logic, Language, Information, and Computation, 2021

Basing Sequent Systems on Exclusive-Or.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2021

Proof Systems for Gödel Logics with an Involution.

[BibT_eX]

[DOI]

Proceedings of the 51st IEEE International Symposium on Multiple-Valued Logic, 2021

2020

The Normal and Self-extensional Extension of Dunn-Belnap Logic.

[BibT_eX]

[DOI]

Logica Universalis, 2020

Paraconsistency, self-extensionality, modality.

[BibT_eX]

[DOI]

Log. J. IGPL, 2020

Weyl Reexamined: "das Kontinuum" 100 Years Later.

[BibT_eX]

[DOI]

Bull. Symb. Log., 2020

Why Predicative Sets?

[BibT_eX]

[DOI]

Proceedings of the Fields of Logic and Computation III, 2020

2019

The middle ground-ancestral logic.

[BibT_eX]

[DOI]

Synth., 2019

Paraconsistency and the need for infinite semantics.

[BibT_eX]

[DOI]

Soft Comput., 2019

Rexpansions of Nondeterministic matrices and their Applications in nonclassical Logics.

[BibT_eX]

[DOI]

Yoni Zohar

Rev. Symb. Log., 2019

Reasoning about Covering-based Rough Sets Using Three Truth Values.

[BibT_eX]

[DOI]

FLAP, 2019

First-Order Quasi-canonical Proof Systems.

[BibT_eX]

[DOI]

Yotam Dvir

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2019

2018

Applicable Mathematics in a Minimal Computational Theory of Sets.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2018

A Minimal Computational Theory of a Minimal Computational Universe.

[BibT_eX]

[DOI]

Proceedings of the Logical Foundations of Computer Science - International Symposium, 2018

Safety, Absoluteness, and Computability.

[BibT_eX]

[DOI]

Shahar Lev

Nissan Levi

Proceedings of the 27th EACSL Annual Conference on Computer Science Logic, 2018

A Simple Cut-Free System for a Paraconsistent Logic Equivalent to S5.

[BibT_eX]

[DOI]

Proceedings of the Advances in Modal Logic 12, 2018

2017

Four-Valued Paradefinite Logics.

[BibT_eX]

[DOI]

Stud Logica, 2017

Self-Extensional Three-Valued Paraconsistent Logics.

[BibT_eX]

[DOI]

Logica Universalis, 2017

Self-extensional three-valued paraconsistent logics have no implication.

[BibT_eX]

[DOI]

Jean-Yves Béziau

Log. J. IGPL, 2017

Cut-elimination in RM Proved Semantically.

[BibT_eX]

[DOI]

FLAP, 2017

Non-Deterministic Matrices in Action: Expansions, Refinements, and Rexpansions.

[BibT_eX]

[DOI]

Yoni Zohar

Proceedings of the 47th IEEE International Symposium on Multiple-Valued Logic, 2017

2016

Cayley's Formula: A Page From The Book.

[BibT_eX]

[DOI]

Nachum Dershowitz

Am. Math. Mon., 2016

Formalizing Scientifically Applicable Mathematics in a Definitional Framework.

[BibT_eX]

[DOI]

J. Formaliz. Reason., 2016

Paraconsistent fuzzy logic preserving non-falsity.

[BibT_eX]

[DOI]

Fuzzy Sets Syst., 2016

Minimal Paradefinite Logics for Reasoning with Incompleteness and Inconsistency.

[BibT_eX]

[DOI]

Proceedings of the 1st International Conference on Formal Structures for Computation and Deduction, 2016

A Logical Framework for Developing and Mechanizing Set Theories.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning - 8th International Joint Conference, 2016

A paraconsistent view on B and S5.

[BibT_eX]

[DOI]

Proceedings of the Advances in Modal Logic 11, 2016

2015

Efficient reasoning with inconsistent information using C-systems.

[BibT_eX]

[DOI]

Inf. Sci., 2015

A cut-free calculus for second-order Gödel logic.

[BibT_eX]

[DOI]

Fuzzy Sets Syst., 2015

2014

The Classical Constraint on Relevance.

[BibT_eX]

[DOI]

Logica Universalis, 2014

Paraconsistency, paracompleteness, Gentzen systems, and trivalent semantics.

[BibT_eX]

[DOI]

J. Appl. Non Class. Logics, 2014

What is relevance logic?

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2014

Ancestral Logic: A Proof Theoretical Study.

[BibT_eX]

[DOI]

Proceedings of the Logic, Language, Information, and Computation, 2014

2013

A unified semantic framework for fully structural propositional sequent systems.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2013

A semantic proof of strong cut-admissibility for first-order Gödel logic.

[BibT_eX]

[DOI]

J. Log. Comput., 2013

Cut-free sequent calculi for C-systems with generalized finite-valued semantics.

[BibT_eX]

[DOI]

J. Log. Comput., 2013

2012

Finite-valued Logics for Information Processing.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2012

Canonical signed calculi with multi-ary quantifiers.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2012

Modular Construction of Cut-free Sequent Calculi for Paraconsistent Logics.

[BibT_eX]

[DOI]

Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

2011

Ideal Paraconsistent Logics.

[BibT_eX]

[DOI]

Stud Logica, 2011

Maximal and Premaximal Paraconsistency in the Framework of Three-Valued Semantics.

[BibT_eX]

[DOI]

Stud Logica, 2011

A Simple Proof of Completeness and Cut-admissibility for Propositional Gödel Logic.

[BibT_eX]

[DOI]

J. Log. Comput., 2011

A Logical Framework for Set Theories

[BibT_eX]

[DOI]

Proceedings of the Proceedings 6th Workshop on Logical and Semantic Frameworks with Applications, 2011

Kripke Semantics for Basic Sequent Systems.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2011

What Is an Ideal Logic for Reasoning with Inconsistency?.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2011, 2011

Non-deterministic Connectives in Propositional Godel Logic.

[BibT_eX]

[DOI]

Proceedings of the 7th conference of the European Society for Fuzzy Logic and Technology, 2011

A Multiple-Conclusion Calculus for First-Order Gödel Logic.

[BibT_eX]

[DOI]

Proceedings of the Computer Science - Theory and Applications, 2011

2010

On Constructive Connectives and Systems

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2010

On Strong Maximality of Paraconsistent Finite-Valued Logics.

[BibT_eX]

[DOI]

Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, 2010

Maximally Paraconsistent Three-Valued Logics.

[BibT_eX]

[DOI]

Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Twelfth International Conference, 2010

Non-deterministic Multi-valued Logics--A Tutorial.

[BibT_eX]

[DOI]

Proceedings of the 40th IEEE International Symposium on Multiple-Valued Logic, 2010

Logics of Reasonable Information Sources.

[BibT_eX]

[DOI]

Jonathan Ben-Naim

Proceedings of the 40th IEEE International Symposium on Multiple-Valued Logic, 2010

Strict Canonical Constructive Systems.

[BibT_eX]

[DOI]

Proceedings of the Fields of Logic and Computation, 2010

2009

Proof Systems for Reasoning about Computation Errors.

[BibT_eX]

[DOI]

Stud Logica, 2009

Multi-valued Semantics: Why and How.

[BibT_eX]

[DOI]

Stud Logica, 2009

Editorial: Proof Theory Corner.

[BibT_eX]

[DOI]

J. Log. Comput., 2009

Canonical Constructive Systems.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2009

Canonical Signed Calculi, Non-deterministic Matrices and Cut-Elimination.

[BibT_eX]

[DOI]

Proceedings of the Logical Foundations of Computer Science, International Symposium, 2009

Canonical Calculi: Invertibility, Axiom Expansion and (Non)-determinism.

[BibT_eX]

[DOI]

Agata Ciabattoni

Proceedings of the Computer Science, 2009

Processing Information from a Set of Sources.

[BibT_eX]

[DOI]

Jonathan Ben-Naim

Proceedings of the Towards Mathematical Philosophy, 2009

2008

Constructibility and decidability versus domain independence and absoluteness.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

Rough Sets and 3-Valued Logics.

[BibT_eX]

[DOI]

Stud Logica, 2008

Canonical Calculi with (n, k)-ary Quantifiers.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2008

A Triple Correspondence in Canonical Calculi: Strong Cut-Elimination, Coherence, and Non-deterministic Semantics.

[BibT_eX]

[DOI]

Proceedings of the Computer Science, 2008

Boris A. Trakhtenbrot: Academic Genealogy and Publications.

[BibT_eX]

[DOI]

Nachum Dershowitz

Alexander Rabinovich

Proceedings of the Pillars of Computer Science, 2008

A Framework for Formalizing Set Theories Based on the Use of Static Set Terms.

[BibT_eX]

[DOI]

Proceedings of the Pillars of Computer Science, 2008

2007

Effective Non-deterministic Semantics for First-order LFIs.

[BibT_eX]

[DOI]

J. Multiple Valued Log. Soft Comput., 2007

Cut-Free Ordinary Sequent Calculi for Logics Having Generalized Finite-Valued Semantics.

[BibT_eX]

[DOI]

Jonathan Ben-Naim

Logica Universalis, 2007

Non-deterministic semantics for logics with a consistency operator.

[BibT_eX]

[DOI]

Int. J. Approx. Reason., 2007

Generalized Non-deterministic Matrices and (n, k)-ary Quantifiers.

[BibT_eX]

[DOI]

Proceedings of the Logical Foundations of Computer Science, International Symposium, 2007

Non-deterministic Multi-valued Matrices for First-Order Logics of Formal Inconsistency.

[BibT_eX]

[DOI]

Proceedings of the 37th International Symposium on Multiple-Valued Logic, 2007

2006

Cut-Elimination and Quantification in Canonical Systems.

[BibT_eX]

[DOI]

Stud Logica, 2006

Non-Deterministic Semantics for First-Order Paraconsistent Logics.

[BibT_eX]

[DOI]

Proceedings of the Proceedings, 2006

From Constructibility and Absoluteness to Computability and Domain Independence.

[BibT_eX]

[DOI]

Proceedings of the Logical Approaches to Computational Barriers, 2006

Canonical Gentzen-Type Calculi with (n, k)-ary Quantifiers.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning, Third International Joint Conference, 2006

Many-Valued Non-deterministic Semantics for First-Order Logics of Formal (In)consistency.

[BibT_eX]

[DOI]

Proceedings of the Algebraic and Proof-theoretic Aspects of Non-classical Logics, 2006

2005

A Non-deterministic View on Non-classical Negations.

[BibT_eX]

[DOI]

Stud Logica, 2005

Non-deterministic Multiple-valued Structures.

[BibT_eX]

[DOI]

Iddo Lev

J. Log. Comput., 2005

Combining classical logic, paraconsistency and relevance.

[BibT_eX]

[DOI]

J. Appl. Log., 2005

Multi-valued Calculi for Logics Based on Non-determinism.

[BibT_eX]

[DOI]

Log. J. IGPL, 2005

Quantification in Non-Deterministic Multi-Valued Structures.

[BibT_eX]

[DOI]

Proceedings of the 35th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2005), 2005

Non-deterministic Semantics for Paraconsistent C-Systems.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2005

Logical Non-determinism as a Tool for Logical Modularity: An Introduction.

[BibT_eX]

Proceedings of the We Will Show Them! Essays in Honour of Dov Gabbay, Volume One, 2005

2004

Formalizing Set Theory as it Is Actually Used.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Knowledge Management, Third International Conference, 2004

Non-Deterministic Matrices.

[BibT_eX]

[DOI]

Iddo Lev

Proceedings of the 34th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2004), 2004

2003

Tableaux with Four Signs as a Unified Framework.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2003

2001

Decomposition Proof Systems for Gödel-Dummett Logics.

[BibT_eX]

[DOI]

Stud Logica, 2001

Classical Gentzen-Type Methods in Propositional Many-Valued Logics.

[BibT_eX]

[DOI]

Proceedings of the 31st IEEE International Symposium on Multiple-Valued Logic, 2001

Canonical Propositional Gentzen-Type Systems.

[BibT_eX]

[DOI]

Iddo Lev

Proceedings of the Automated Reasoning, First International Joint Conference, 2001

2000

Implicational F-Structures and Implicational Relevance Logics.

[BibT_eX]

[DOI]

J. Symb. Log., 2000

General Patterns for Nonmonotonic Reasoning: From Basic Entailments to Plausible Relations.

[BibT_eX]

[DOI]

Log. J. IGPL, 2000

A Tableau System for Gödel-Dummett Logic Based on a Hypersequent Calculus.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2000

1999

On the Expressive Power of Three-Valued and Four-Valued Languages.

[BibT_eX]

[DOI]

J. Log. Comput., 1999

A Model-Theoretic Approach for Recovering Consistent Data from Inconsistent Knowledge Bases.

[BibT_eX]

[DOI]

J. Autom. Reason., 1999

Nonmonotonic and Paraconsistent Reasoning: From Basic Entailments to Plausible Relations.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Quantitative Approaches to Reasoning and Uncertainty, 1999

1998

Encoding Modal Logics in Logical Frameworks.

[BibT_eX]

[DOI]

Stud Logica, 1998

Multiplicative Conjunction and an Algebraic Meaning of Contraction and Weakening.

[BibT_eX]

[DOI]

J. Symb. Log., 1998

Two Types of Multiple-Conclusion Systems.

[BibT_eX]

[DOI]

Log. J. IGPL, 1998

Formulas for which Contraction is Admissible.

[BibT_eX]

[DOI]

Log. J. IGPL, 1998

The Value of the Four Values.

[BibT_eX]

[DOI]

Artif. Intell., 1998

The Logical Role of the Four-Valued Bilattice.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science, 1998

1997

Multiplicative Conjunction as an Extensional Conjunction.

[BibT_eX]

[DOI]

Log. J. IGPL, 1997

1996

The Structure of Interlaced Bilattices.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 1996

Reasoning with Logical Bilattices.

[BibT_eX]

[DOI]

J. Log. Lang. Inf., 1996

Automatic Diagnoses for Properly Stratified Knowledge-Bases.

[BibT_eX]

[DOI]

Proceedings of the Eigth International Conference on Tools with Artificial Intelligence, 1996

Four-Valued Diagnoses for Stratified Knowledge-Bases.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 10th International Workshop, 1996

1995

A Note on the Structure of Bilattices.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 1995

1994

Queries evaluation, relative safety, and domain independence in first-order database languages with functions.

[BibT_eX]

[DOI]

Yoram Hirshfeld

Methods Log. Comput. Sci., 1994

Some Properties of Linear Logic Proved by Semantic Methods.

[BibT_eX]

[DOI]

J. Log. Comput., 1994

Stability, Sequentiality and Demand Driven Evaluation in Dataflow.

[BibT_eX]

[DOI]

Nada Sasson

Formal Aspects Comput., 1994

Logical Bilattices and Inconsistent Data

[BibT_eX]

[DOI]

Proceedings of the Ninth Annual Symposium on Logic in Computer Science (LICS '94), 1994

1993

Gentzen-Type Systems, Resolution and Tableaux.

[BibT_eX]

[DOI]

J. Autom. Reason., 1993

An Exercise in an Interactive Geometrical Research.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 1993

1992

Axiomatic Systems, Deduction and Implication.

[BibT_eX]

[DOI]

J. Log. Comput., 1992

Whither relevance logic?

[BibT_eX]

[DOI]

J. Philos. Log., 1992

Using Typed Lambda Calculus to Implement Formal Systems on a Machine.

[BibT_eX]

[DOI]

J. Autom. Reason., 1992

1991

Simple Consequence Relations

[BibT_eX]

[DOI]

Inf. Comput., May, 1991

Relevance and Paraconsistency - A New Approach, Part III: Cut-Free Gentzen-Type Systems.

[BibT_eX]

[DOI]

Notre Dame J. Formal Log., 1991

Natural 3-Valued Logics - Characterization and Proof Theory.

[BibT_eX]

[DOI]

J. Symb. Log., 1991

A note of provability, truth and existence.

[BibT_eX]

[DOI]

J. Philos. Log., 1991

Hypersequents, logical consequence and intermediate logics for concurrency.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 1991

On First Order Database Query Languages

[BibT_eX]

[DOI]

Yoram Hirshfeld

Proceedings of the Sixth Annual Symposium on Logic in Computer Science (LICS '91), 1991

1990

Relevance and Paraconsistency - A New Approach, Part II: The Formal Systems.

[BibT_eX]

[DOI]

Notre Dame J. Formal Log., 1990

Gentzenizing Schroeder-Heister's Natural Extension of Natural Deduction.

[BibT_eX]

[DOI]

Notre Dame J. Formal Log., 1990

Relevance and Paraconsistency - A New Approach.

[BibT_eX]

[DOI]

J. Symb. Log., 1990

1988

The Semantics and Proof Theory of Linear Logic.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1988

1987

A Constructive Analysis of RM.

[BibT_eX]

[DOI]

J. Symb. Log., 1987

1986

On an implication connective of RM.

[BibT_eX]

[DOI]

Notre Dame J. Formal Log., 1986

On purely relevant logics.

[BibT_eX]

[DOI]

Notre Dame J. Formal Log., 1986

1984

On Modal Systems Having Arithmetical Interpretations.

[BibT_eX]

[DOI]

J. Symb. Log., 1984

Relevant Entailment-Semantics and Formal Systems.

[BibT_eX]

[DOI]