The following pages link to Eugenio Giovanni Omodeo (Q1248615):
Displaying 50 items.
- (Q167068) (redirect page) (← links)
- (Q1111539) (redirect page) (← links)
- The automation of syllogistic. I: Syllogistic normal forms (Q1111540) (← links)
- Three existence principles in a modal calculus without descriptions contained in A. Bressan's \(MC^\nu\) (Q1134142) (← links)
- The elimination of descriptions from A. Bressan's modal language \(ML^\nu\) on which the logical calculus \(MC^\nu\) is based (Q1248616) (← links)
- Solvable set/hyperset contexts. II: A goal-driven unification algorithm for the blended case (Q1290508) (← links)
- A derived algorithm for evaluating \(\varepsilon\)-expressions over abstract sets (Q1322849) (← links)
- (Q1813823) (redirect page) (← links)
- The automation of syllogistic. II: Optimization and complexity issues (Q1813824) (← links)
- The linked conjunct method for automatic deduction and related search techniques (Q1836998) (← links)
- Formative processes with applications to the decision problem in set theory. I: Powerset and singleton operators (Q1854500) (← links)
- Compiling dyadic first-order specifications into map algebra (Q1870581) (← links)
- ER modelling from first relational principles (Q1884937) (← links)
- Three-variable statements of set-pairing (Q1885036) (← links)
- Complexity assessments for decidable fragments of set theory. II: A taxonomy for `small' languages involving membership (Q2215960) (← links)
- Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets (Q2352482) (← links)
- Complexity assessments for decidable fragments of Set Theory. III: Testers for crucial, polynomial-maximal decidable Boolean languages (Q2697538) (← links)
- A decidable theory involving addition of differentiable real functions (Q2699966) (← links)
- (Q2740887) (← links)
- A graphical representation of relational formulae with complementation (Q2889180) (← links)
- The Bernays-Schönfinkel-Ramsey class for set theory: decidability (Q2915897) (← links)
- Set-syllogistics meet combinatorics (Q2971068) (← links)
- (Q3002402) (← links)
- (Q3002403) (← links)
- Topological syllogistic with continuous and closed functions (Q3033355) (← links)
- {log}: A language for programming in logic with finite sets (Q3129506) (← links)
- (Q3172128) (← links)
- Mapping Sets and Hypersets into Numbers (Q3187011) (← links)
- Banishing Ultrafilters from Our Consciousness (Q3305324) (← links)
- Martin Davis’s Bibliography 1950–2015 (Q3305330) (← links)
- The quest for Diophantine finite-fold-ness (Q3383639) (← links)
- (Q3491017) (← links)
- The Bernays-Schönfinkel-Ramsey class for set theory: semidecidability (Q3570158) (← links)
- Theory-Specific Automated Reasoning (Q3578390) (← links)
- (Q3645585) (← links)
- (Q3645586) (← links)
- (Q3748267) (← links)
- Decision procedures for elementary sublanguages of set theory VIII. A semidecision procedure for finite satisfiability of unqualified set-theoretic formulae (Q3787974) (← links)
- Decision algorithms for some fragments of analysis and related areas (Q3803084) (← links)
- Decision procedures for elementary sublanguages of set theory VII. Validity in set theory when a choice operator is present (Q3803085) (← links)
- (Q3812202) (← links)
- (Q3894959) (← links)
- Decision procedures for elementary sublanguages of set theory. I. Multi-level syllogistic and some extensions (Q3900014) (← links)
- (Q3905254) (← links)
- Decision procedures for elementary sublanguages of set theory. II. Formulas involving restricted quantifiers, together with ordinal, integer, map, and domain notions (Q3916545) (← links)
- (Q3999861) (← links)
- (Q4415070) (← links)
- (Q4503910) (← links)
- (Q4539604) (← links)
- (Q4707766) (← links)
- Decidability of ∀*∀‐Sentences in Membership Theories (Q4868240) (← links)
