• Aucun résultat trouvé

Preface

N/A
N/A
Protected

Academic year: 2022

Partager "Preface"

Copied!
1
0
0

Texte intégral

(1)

This volume contains the proceedings of the 3rd International Workshop on Sets and Tools, SETS 2018. This workshop was held in Southampton, United Kingdom, on June 5, 2018, as part of the 6th International ABZ Conference ASM, Alloy, B, TLA, VDM, Z, ABZ 2018. The workshop aims at bringing to- gether researchers interested in set theory, especially to design tools for dealing with set theory, such as interactive or automated theorem provers, proof check- ers, theories for general purpose proof tools, constraint solvers, programming languages etc.

The first edition, SETS 2014, was held in Toulouse, France and was affiliated to ABZ 2014. The second edition, SETS 2015, was held at Oslo in Norway and was affiliated to FM 2015.

We received seven papers. After the reviewing process, the Program Com- mittee decided that all of them could be presented at the workshop. However, only six of them were accepted to be part of these proceedings. The workshop program was enriched by the opening keynote of Michael Leuschel, professor from Heinrich Heine Universität, Düsseldorf, onSolving Set Constraints in B and Event-B: Foundations and Applications.

We would like to thank the Program Committee and the additional reviewers for their work. The process of reviewing and selecting papers was significantly simplified using EasyChair. We would like to thank Colin Snook, organizer of the 7th Rodin User and Developer Workshop, for helping us with the diffusion of our workshop along with his. Finally many thanks to Michael Leuschel for his invited talk.

June 2018 Maximiliano Cristi´a

David Delahaye Catherine Dubois Editors

Copyright c2018 for the individual papers by the papers’ authors. Copying permitted for private and academic purposes. This volume is published and copyrighted by its editors.

1

Références

Documents relatifs

The infinity axiom rarely plays a role in appli- cations to algorithms; nevertheless the availability of all resources of ZFC is important in general: for example,

The set-theoretic decision problem calls for the existence of an algorithm that, given a purely universal formula in mem- bership and equality, establishes whether there exist sets

We can point out at least three top- ics here: topological aspects of rough sets – as approximation operators have properties of the topological interior and closure;

In this paper we compare the performance of various automated theorem provers on nearly all of the theorems in loop theory known to have been obtained with the assistance of

Besides the comprehension principle is weakened to the separation principle: given a set, we can define its subset of elements satisfying a given

q.e.d... Notice that ⊥ and = are not symbols of the language. a λ-term which does not involve the symbol A). Realizability is compatible with deduction in classical logic. Indeed,

THEOREM 3.6. Let E be an f-admissible equiwalence.. Conversel y any f-inductive function g defines an f-admissible equivalence. In particular if 1 then and

This result then points to the need to consider more fully properties without a number, and so to generate a theory of continua ba- sed on mereological aggregates rather than