Some model theory for monotone quantifiers. - Johann A. Makowsky; Sauro Tulipani (Arch. Math. Log., 1977)

Model-Completions of Theories of Finitely Additive Measures with Values in An Ordered Field. - Sauro Tulipani (Math. Log. Q., 1981)

An Algorithm to Determine, For any Prime p, A Polynomial-Sized Horn Sentence which Expresses "The Cardinality is not p". - Sauro Tulipani (J. Symb. Log., 1985)

Horn Sentences of Small Size in Identity Theory. - Gabriele Marongiu; Sauro Tulipani (Math. Log. Q., 1986)

Finite Algebraic Specifications of Semicomputable Data Types. - Gabriele Marongiu; Sauro Tulipani (TAPSOFT, Vol.1, 1987)

On a Conjecture of Bergstra and Tucker. - Gabriele Marongiu; Sauro Tulipani (Theor. Comput. Sci., 1989)

On algebraic specifications of computable algebras with the discriminator technique. - G. Gagliardi; Sauro Tulipani (RAIRO Theor. Informatics Appl., 1990)

Quantifier elimination for infinite terms. - Gabriele Marongiu; Sauro Tulipani (Arch. Math. Log., 1991)

Undecidable Fragments of Term Algebras with Subterm Relation. - Gabriele Marongiu; Sauro Tulipani (Fundam. Informaticae, 1993)

Σ11-Completeness of a Fragment of the Theory of Trees With Subtree Relation. - Patrizio Cintioli; Sauro Tulipani (Notre Dame J. Formal Log., 1994)

Decidability of the Existential Theory of Infinite Terms with Subterm Relation - Sauro Tulipani (Inf. Comput., 1994)

Elimination of Boolean variables for probabilistic coherence. - Marco Baioletti; Andrea Capotorti; Sauro Tulipani; Barbara Vantaggi (Soft Comput., 2000)

Complexity of Fuzzy Probability Logics. - Petr Hájek 001; Sauro Tulipani (Fundam. Informaticae, 2001)

Simplification Rules for the Coherent Probability Assessment Problem. - Marco Baioletti; Andrea Capotorti; Sauro Tulipani; Barbara Vantaggi (Ann. Math. Artif. Intell., 2002)