The following pages link to Eugenio Giovanni Omodeo (Q1248615):
Displaying 36 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)
- Decidability of ∀*∀‐Sentences in Membership Theories (Q4868240) (← links)
- Solvable set/hyperset contexts: I. Some decision procedures for the pure, finite case (Q4884668) (← links)
- Infinity, in short (Q4902312) (← links)
- Set Graphs. V. On representing graphs as membership digraphs (Q5262489) (← links)
- The axiom of elementary sets on the edge of Peircean expressibility (Q5718697) (← links)
- Reconciling transparency, low <i>Δ</i>0-complexity and axiomatic weakness in undecidability proofs (Q6162116) (← links)
