Sfoglia per Autore OMODEO, EUGENIO
The elimination of descriptions from A. Bressan's modal language ML^nu on which the logical calculus MC^nu is based
1977-01-01 Omodeo, Eugenio
Decision procedures for elementary sublanguages of set theory. I: Multi-level syllogistic and some extensions
1980-01-01 A., Ferro; Omodeo, Eugenio; J. T., Schwartz
Three existence principles in a modal calculus without descriptions in A. Bressan's MC^nu
1980-01-01 Omodeo, Eugenio
Decision procedures for elementary sublanguages of set theory. II: Formulas involving restricted quantifiers together with ordinal, integer, map, and domain notions
1981-01-01 M., Breban; A., Ferro; Omodeo, Eugenio; J. T., Schwartz
The Linked Conjunct method for automatic deduction and related search techniques
1982-01-01 Omodeo, Eugenio
Decision procedures for elementary sublanguages of set theory, VII: Validity in set theory when a choice operator is present
1987-01-01 A., Ferro; Omodeo, Eugenio
Decision algorithms for some fragments of analysis and related areas
1987-01-01 D., Cantone; A., Ferro; Omodeo, Eugenio; J. T., Schwartz
Decision procedures for elementary sublanguages of set theory. VIII: A semidecision procedure for finite satisfiability of unquantified set-theoretic formulae
1988-01-01 D., Cantone; A., Ferro; Omodeo, Eugenio
The automation of syllogistic. I: Syllogistic normal form
1988-01-01 D., Cantone; S., Ghelfo; Omodeo, Eugenio
Topological syllogistic with continuous and closed functions
1989-01-01 D., Cantone; Omodeo, Eugenio
Computable Set Theory, vol. I
1989-01-01 Cantone, D; Ferro, A; Omodeo, Eugenio
The automation of syllogistic. II: Optimization and complexity issues
1990-01-01 Omodeo, Eugenio; A., Policriti
{log}: A logic programming language with finite sets
1991-01-01 A., Dovier; Omodeo, Eugenio; E., Pontelli; G. F., Rossi
A derived algorithm for evaluating epsilon-expressions over abstract sets
1993-01-01 Omodeo, Eugenio; Parlamento, F; Policriti, A.
Solvable set/hyperset contexts: I. Some decision procedures for the pure, finite case
1995-01-01 Omodeo, Eugenio; Policriti, A.
Decidability of E*A-sentences in membership theories
1996-01-01 Omodeo, Eugenio; F., Parlamento; A., Policriti
A language for programming in logic with finite sets
1996-01-01 Dovier, A.; Omodeo, Eugenio; Pontelli, E.; Rossi, G. F.
Transitive Venn diagrams with applications to the decision problem in set theory
1999-01-01 D., Cantone; Omodeo, Eugenio; P., Ursino
Solvable set/hyperset contexts: II. A goal-driven algorithm for the blended case
1999-01-01 Dovier, A; Omodeo, Eugenio; Policriti, A.
An equational re-engineering of set theories
2000-01-01 Formisano, A; Omodeo, Eugenio
Legenda icone
- file ad accesso aperto
- file disponibili sulla rete interna
- file disponibili agli utenti autorizzati
- file disponibili solo agli amministratori
- file sotto embargo
- nessun file disponibile