The following pages link to Eugenio Giovanni Omodeo (Q1248615):
Displayed 19 items.
- Solvable set/hyperset contexts: I. Some decision procedures for the pure, finite case (Q4884668) (← links)
- Infinity, in short (Q4902312) (← links)
- (Q4913613) (← links)
- Layered map reasoning (Q4923516) (← links)
- (Q5087790) (← links)
- Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case* (Q5158658) (← links)
- Computational Logic and Set Theory (Q5198513) (← links)
- (Q5213549) (← links)
- Set Graphs. V. On representing graphs as membership digraphs (Q5262489) (← links)
- Decidability results for sets with atoms (Q5277749) (← links)
- An Environment for Specifying Properties of Dyadic Relations and Reasoning About Them II: Relational Presentation of Non-classical Logics (Q5302022) (← links)
- Verification: Theory and Practice (Q5305641) (← links)
- On Sets and Graphs (Q5360855) (← links)
- Relational and Kleene-Algebraic Methods in Computer Science (Q5712434) (← links)
- The axiom of elementary sets on the edge of Peircean expressibility (Q5718697) (← links)
- Theory and Applications of Relational Structures as Knowledge Instruments (Q5902051) (← links)
- Goals and benchmarks for automated map reasoning (Q5927984) (← links)
- Reconciling transparency, low <i>Δ</i>0-complexity and axiomatic weakness in undecidability proofs (Q6162116) (← links)
- Six equations in search of a finite-fold-ness proof (Q6428356) (← links)