1,721,065 research outputs found
Bisimilarity, hypersets and stable partitioning: a survey
Since Hopcroft proposed his celebrated n log n algorithm for minimizing states in a finite automaton, the race for efficient partition refinement methods has inspired much research in algorithmics. In parallel, the notion of bisimulation has gained ground in theoretical investigations not less than in applications, till it even pervaded the axioms of a variant Zermelo-Fraenkel set theory. As is well-known, the coarsest stable partitioning problem and the determination of bisimilarity (i.e., the largest partition stable relative to finitely many dyadic relations) are two faces of the same coin. While there is a tendency to refer these topics to varying frameworks, we will contend that the set-theoretic view not only offers a clear conceptual background (provided stability is referred to a non-well-founded membership), but is leading to new insights on the algorithmic complexity issues
The elimination of descriptions from A. Bressan's modal language ML^nu on which the logical calculus MC^nu is based
Three existence principles in a modal calculus without descriptions in A. Bressan's MC^nu
The decidability of the Bernays-Shoenfinkel-Ramsey class for set theory
Rapporto scientific
Le radici forti dell'Informatica – L'intreccio storico tra tecnologia e fondamenti logici della matematica
Decision procedures for elementary sublanguages of set theory, VII: Validity in set theory when a choice operator is present
Martin Davis’s Bibliography 1950–2015
This appendix offers a comprehensive list of articles and books which Martin Davis has published till the present day, cross-referenced with a list of bibliographic entries regarding conference proceedings, paper collections, and books, to which he has contributed.
Our list does not include the many reviews written by Martin Davis, in particular the ones which have appeared on The Journal of Symbolic Logic
- …
