CompBio & Bioinf @ UniUd
CompBio & Bioinf @ UniUd
Home
Members
Events
Projects
Software
Publications
Contact
Light
Dark
Automatic
Parlamento F
Latest
Witnessing differences without redundancies
Decidability of E*A-sentences in Membership Theories
Decidability of exists*forall sentences in membership theories
A derived algorithm for evaluating epsilon-expressions over abstract sets
Undecidability Results for Restricted Universally Quantified Formulae of Set Theory
Decision Procedures for Elementary Sublanguages of Set Theory XIII. Model Graphs, Reflection and Decidability.
Expressing Infinity without Foundation
A contribution to the Automated Treatment of Membership Theories
Note on: The Logically Simplest Form of the Infinity Axiom
Truth Table for a Combinatorial Kernel of Set Theories
Decision Procedures for Elementary Sublanguages of Set Theory. IX. Unsolvability of the decision problem for a restricted subclass of delta-0 formulas of set theory.
Secision Procedures for Elementary Sublanguages of Set Theory XI. Unsolvability of the Decision Problem for a Restricted Subclass of the Delta_0-Formulas in Set Theory
The Logically Simplest Form of the Infinity Axiom
Cite
×