| Publication | Date of Publication | Type |
|---|
| In memory of Martin Davis | 2024-09-26 | Paper |
| Reasoning on relations, modalities, and sets | 2024-09-06 | Paper |
| Reconciling transparency, low Δ0-complexity and axiomatic weakness in undecidability proofs | 2023-06-15 | Paper |
| A decidable theory involving addition of differentiable real functions | 2023-04-20 | Paper |
| Complexity assessments for decidable fragments of Set Theory. III: Testers for crucial, polynomial-maximal decidable Boolean languages | 2023-04-12 | Paper |
| Six equations in search of a finite-fold-ness proof | 2023-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5087790 | 2022-07-01 | Paper |
| The quest for Diophantine finite-fold-ness | 2021-12-16 | Paper |
| Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case* | 2021-10-25 | Paper |
| Complexity assessments for decidable fragments of set theory. II: A taxonomy for `small' languages involving membership | 2020-12-15 | Paper |
| Banishing Ultrafilters from Our Consciousness | 2020-08-06 | Paper |
| Martin Davis’s Bibliography 1950–2015 | 2020-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5213549 | 2020-02-03 | Paper |
| On Sets and Graphs | 2017-09-26 | Paper |
| Decidability results for sets with atoms | 2017-07-12 | Paper |
| Set-syllogistics meet combinatorics | 2017-04-04 | Paper |
| Mapping Sets and Hypersets into Numbers | 2016-08-15 | Paper |
| Set Graphs. V. On representing graphs as membership digraphs | 2015-07-15 | Paper |
| Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets | 2015-07-02 | Paper |
| Layered map reasoning | 2013-05-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4913613 | 2013-04-08 | Paper |
| Infinity, in short | 2013-01-14 | Paper |
| The Bernays-Schönfinkel-Ramsey class for set theory: decidability | 2012-09-19 | Paper |
| A graphical representation of relational formulae with complementation | 2012-06-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3172128 | 2011-10-05 | Paper |
| Computational Logic and Set Theory | 2011-08-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3002403 | 2011-05-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3002402 | 2011-05-20 | Paper |
| Theory-Specific Automated Reasoning | 2010-07-20 | Paper |
| The Bernays-Schönfinkel-Ramsey class for set theory: semidecidability | 2010-06-24 | Paper |
| Verification: Theory and Practice | 2010-03-23 | Paper |
| Using ÆtnaNova to formally prove that the Davis-Putnam satisfiability test is correct | 2009-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3645585 | 2009-11-18 | Paper |
| Theory and Applications of Relational Structures as Knowledge Instruments | 2009-06-09 | Paper |
| An Environment for Specifying Properties of Dyadic Relations and Reasoning About Them II: Relational Presentation of Non-classical Logics | 2009-01-20 | Paper |
| The axiom of elementary sets on the edge of Peircean expressibility | 2006-01-16 | Paper |
| Relational and Kleene-Algebraic Methods in Computer Science | 2005-12-23 | Paper |
| ER modelling from first relational principles | 2004-10-27 | Paper |
| Three-variable statements of set-pairing | 2004-10-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4415070 | 2003-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4707766 | 2003-06-11 | Paper |
| Compiling dyadic first-order specifications into map algebra | 2003-05-14 | Paper |
| Formative processes with applications to the decision problem in set theory. I: Powerset and singleton operators | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4539604 | 2002-07-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2740887 | 2001-09-05 | Paper |
| Goals and benchmarks for automated map reasoning | 2001-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4503910 | 2001-02-27 | Paper |
| Solvable set/hyperset contexts. II: A goal-driven unification algorithm for the blended case | 1999-06-02 | Paper |
| {log}: A language for programming in logic with finite sets | 1997-11-10 | Paper |
| Solvable set/hyperset contexts: I. Some decision procedures for the pure, finite case | 1996-11-04 | Paper |
| Decidability of ∀*∀‐Sentences in Membership Theories | 1996-05-02 | Paper |
| A derived algorithm for evaluating \(\varepsilon\)-expressions over abstract sets | 1994-09-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3999861 | 1993-01-23 | Paper |
| The automation of syllogistic. II: Optimization and complexity issues | 1992-06-25 | Paper |
| Topological syllogistic with continuous and closed functions | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3491017 | 1989-01-01 | Paper |
| Decision procedures for elementary sublanguages of set theory VIII. A semidecision procedure for finite satisfiability of unqualified set-theoretic formulae | 1988-01-01 | Paper |
| The automation of syllogistic. I: Syllogistic normal forms | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3812202 | 1988-01-01 | Paper |
| Decision procedures for elementary sublanguages of set theory VII. Validity in set theory when a choice operator is present | 1987-01-01 | Paper |
| Decision algorithms for some fragments of analysis and related areas | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3748267 | 1985-01-01 | Paper |
| The linked conjunct method for automatic deduction and related search techniques | 1982-01-01 | Paper |
| Decision procedures for elementary sublanguages of set theory. II. Formulas involving restricted quantifiers, together with ordinal, integer, map, and domain notions | 1981-01-01 | Paper |
| Decision procedures for elementary sublanguages of set theory. I. Multi-level syllogistic and some extensions | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3905254 | 1980-01-01 | Paper |
| Three existence principles in a modal calculus without descriptions contained in A. Bressan's \(MC^\nu\) | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3894959 | 1978-01-01 | Paper |
| The elimination of descriptions from A. Bressan's modal language \(ML^\nu\) on which the logical calculus \(MC^\nu\) is based | 1978-01-01 | Paper |
| In Memory of Martin Davis | N/A | Paper |
