| Proof Systems for 3-valued Logics Based on Godel's Implication | 0 | 0.34 | 2022 |
| Quasi-canonical systems and their semantics | 0 | 0.34 | 2021 |
| Analysis in a Formal Predicative Set Theory. | 0 | 0.34 | 2021 |
| Paraconsistency, Self-Extensionality, Modality | 0 | 0.34 | 2020 |
| The Normal and Self-extensional Extension of Dunn–Belnap Logic | 0 | 0.34 | 2020 |
| The middle ground-ancestral logic | 2 | 0.44 | 2019 |
| First-Order Quasi-canonical Proof Systems. | 0 | 0.34 | 2019 |
| Reasoning about Covering-based Rough Sets Using Three Truth Values. | 0 | 0.34 | 2019 |
| REXPANSIONS OF NONDETERMINISTIC MATRICES AND THEIR APPLICATIONS IN NONCLASSICAL LOGICS | 0 | 0.34 | 2019 |
| A Simple Cut-Free System for a Paraconsistent Logic Equivalent to S5. | 1 | 0.34 | 2018 |
| A Minimal Computational Theory of a Minimal Computational Universe. | 0 | 0.34 | 2018 |
| Applicable Mathematics in a Minimal Computational Theory of Sets. | 0 | 0.34 | 2018 |
| Safety, Absoluteness, and Computability. | 0 | 0.34 | 2018 |
| Four-Valued Paradefinite Logics. | 0 | 0.34 | 2017 |
| Self-extensional three-valued paraconsistent logics have no implication. | 3 | 0.41 | 2017 |
| Cut-elimination in RM Proved Semantically. | 0 | 0.34 | 2017 |
| Self-Extensional Three-Valued Paraconsistent Logics. | 1 | 0.35 | 2017 |
| Non-Deterministic Matrices in Action: Expansions, Refinements, and Rexpansions | 2 | 0.40 | 2017 |
| A paraconsistent view on B and S5. | 0 | 0.34 | 2016 |
| Cayley′s Formula: A Page From The Book | 1 | 0.40 | 2016 |
| Formalizing Scientifically Applicable Mathematics in a Definitional Framework. | 2 | 0.47 | 2016 |
| A Logical Framework for Developing and Mechanizing Set Theories. | 0 | 0.34 | 2016 |
| Paraconsistent fuzzy logic preserving non-falsity | 1 | 0.43 | 2016 |
| Efficient reasoning with inconsistent information using C-systems. | 5 | 0.42 | 2015 |
| A cut-free calculus for second-order Gödel logic | 1 | 0.35 | 2015 |
| The Classical Constraint on Relevance. | 0 | 0.34 | 2014 |
| Cut-free sequent calculi for C-systems with generalized finite-valued semantics | 8 | 0.59 | 2013 |
| Finite-valued Logics for Information Processing | 3 | 1.42 | 2012 |
| Modular Construction of Cut-free Sequent Calculi for Paraconsistent Logics | 9 | 0.68 | 2012 |
| Canonical signed calculi with multi-ary quantifiers. | 0 | 0.34 | 2012 |
| Non-deterministic Connectives in Propositional Godel Logic. | 1 | 0.37 | 2011 |
| A Simple Proof of Completeness and Cut-admissibility for Propositional Gödel Logic | 5 | 0.57 | 2011 |
| A multiple-conclusion calculus for first-order Gödel logic | 1 | 0.36 | 2011 |
| Maximal and Premaximal Paraconsistency in the Framework of Three-Valued Semantics | 13 | 0.97 | 2011 |
| What is an ideal logic for reasoning with inconsistency? | 8 | 0.48 | 2011 |
| A Logical Framework For Set Theories | 0 | 0.34 | 2011 |
| Maximally Paraconsistent Three-Valued Logics | 3 | 0.55 | 2010 |
| On Strong Maximality of Paraconsistent Finite-Valued Logics | 3 | 0.51 | 2010 |
| On Constructive Connectives and Systems | 7 | 0.69 | 2010 |
| Non-deterministic Multi-valued Logics--A Tutorial | 1 | 0.35 | 2010 |
| Logics of Reasonable Information Sources | 1 | 0.37 | 2010 |
| Canonical Constructive Systems | 1 | 0.40 | 2009 |
| Editorial: Proof Theory Corner | 0 | 0.34 | 2009 |
| Multi-valued Semantics: Why and How | 6 | 0.67 | 2009 |
| Canonical Signed Calculi, Non-deterministic Matrices and Cut-Elimination | 4 | 0.52 | 2009 |
| Canonical Calculi: Invertibility, Axiom Expansion and (Non)-determinism | 4 | 0.56 | 2009 |
| Constructibility and decidability versus domain independence and absoluteness | 9 | 1.06 | 2008 |
| Canonical Calculi with (n, k)-ary Quantifiers. | 5 | 0.62 | 2008 |
| Pillars of computer science: essays dedicated to Boris (Boaz) Trakhtenbrot on the occasion of his 85th birthday | 37 | 4.14 | 2008 |
| A framework for formalizing set theories based on the use of static set terms | 7 | 1.03 | 2008 |
