Autore
GIORGIO GERMANO
Dati autore
- Professore Ordinario presso Dipartimento di Informatica
- Membro della Facolta' di Scienze Matematiche Fisiche e Naturali
- Settore scientifico disciplinare INF/01 INFORMATICA
- Non più in servizio
Prodotti
- Articoli
- Atti, Riassunti o Comunicazioni
- Rapporti
- Closure and kernel relators for preorders 1996
- Closure relations and the semantics of the while-do construct in non deterministic programming 1998
- Data structures as inductive kernels of many-sorted algebras; with applications to the Postscript language 1999
- A unifying discussion of self representability 2000
- Reducing the problem of cnf-propositions satisfiability 2000
- Selection graphs to reduce the satisfiability proble for cnf-propositions 2000
- Typed predicational algebras, a unifying notion. 2000
- Typed predicational algebras: an algebraic analysis of satisfiability 2000
- A simple reduction of CNF-SAT to HAM-CYCLE based on equivalence and opposition 2001
- An iterative characterization of computable functions on PS algebras 2001
- Cantor's diagrams: a unifying discussion of self-reference 2001