Sauro Tulipani

According to our database1, Sauro Tulipani authored at least 14 papers between 1977 and 2002.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2002
Simplification Rules for the Coherent Probability Assessment Problem.
Ann. Math. Artif. Intell., 2002

2001
Complexity of Fuzzy Probability Logics.
Fundam. Informaticae, 2001

2000
Elimination of Boolean variables for probabilistic coherence.
Soft Comput., 2000

1994
Decidability of the Existential Theory of Infinite Terms with Subterm Relation
Inf. Comput., January, 1994

Σ<sub>1</sub><sup>1</sup>-Completeness of a Fragment of the Theory of Trees With Subtree Relation.
Notre Dame J. Formal Log., 1994

1993
Undecidable Fragments of Term Algebras with Subterm Relation.
Fundam. Informaticae, 1993

1991
Quantifier elimination for infinite terms.
Arch. Math. Log., 1991

1990
On algebraic specifications of computable algebras with the discriminator technique.
RAIRO Theor. Informatics Appl., 1990

1989
On a Conjecture of Bergstra and Tucker.
Theor. Comput. Sci., 1989

1987
Finite Algebraic Specifications of Semicomputable Data Types.
Proceedings of the TAPSOFT'87: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1987

1986
Horn Sentences of Small Size in Identity Theory.
Math. Log. Q., 1986

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

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

1977
Some model theory for monotone quantifiers.
Arch. Math. Log., 1977


  Loading...