| 2008 |
|---|
| 41 | EE | Shier Ju,
Daniele Mundici:
Many-Valued Logic and Cognition: Foreword.
Studia Logica 90(1): 1-2 (2008) |
| 2007 |
|---|
| 40 | EE | Manuela Busaniche,
Daniele Mundici:
Geometry of Robinson consistency in Lukasiewicz logic.
Ann. Pure Appl. Logic 147(1-2): 1-22 (2007) |
| 39 | EE | Jan Kühr,
Daniele Mundici:
De Finetti theorem and Borel states in [0, 1]-valued algebraic logic.
Int. J. Approx. Reasoning 46(3): 605-616 (2007) |
| 2006 |
|---|
| 38 | EE | Daniele Mundici:
A Characterization of the free n-generated MV-algebra.
Arch. Math. Log. 45(2): 239-247 (2006) |
| 37 | EE | Daniele Mundici:
Bookmaking over infinite-valued events.
Int. J. Approx. Reasoning 43(3): 223-240 (2006) |
| 2004 |
|---|
| 36 | EE | Ferdinando Cicalese,
Christian Deppe,
Daniele Mundici:
Q-Ary Ulam-Rényi Game with Weighted Constrained Lies.
COCOON 2004: 82-91 |
| 35 | EE | Ferdinando Cicalese,
Daniele Mundici,
Ugo Vaccaro:
Preface.
Discrete Applied Mathematics 137(1): 1-2 (2004) |
| 2003 |
|---|
| 34 | | Silvio Ghilardi,
Daniele Mundici:
Foreword.
Studia Logica 73(1): 3 (2003) |
| 2002 |
|---|
| 33 | EE | Vincenzo Marra,
Daniele Mundici:
Consequence and Complexity in Infinite-Valued Logic: A Survey.
ISMVL 2002: 104- |
| 32 | EE | Ferdinando Cicalese,
Daniele Mundici,
Ugo Vaccaro:
Least adaptive optimal search with unreliable tests.
Theor. Comput. Sci. 270(1-2): 877-893 (2002) |
| 2001 |
|---|
| 31 | | Stefano Aguzzoli,
Daniele Mundici:
Weierstrass Approximations by Lukasiewicz Formulas with One Quantified Variable.
ISMVL 2001: 361-366 |
| 30 | | Daniele Mundici,
Giovanni Panti:
Decidable and undecidable prime theories in infinite-valued logic.
Ann. Pure Appl. Logic 108(1-3): 269-278 (2001) |
| 2000 |
|---|
| 29 | EE | Ferdinando Cicalese,
Daniele Mundici:
Optimal Coding with One Asymmetric Error: Below the Sphere Packing Bound.
COCOON 2000: 159-169 |
| 28 | EE | Ferdinando Cicalese,
Ugo Vaccaro,
Daniele Mundici:
Least Adaptive Optimal Search with Unreliable Tests.
SWAT 2000: 549-562 |
| 27 | | Daniele Mundici:
Foreword: Logics of Uncertainty.
Journal of Logic, Language and Information 9(1): 1-3 (2000) |
| 1999 |
|---|
| 26 | EE | Ferdinando Cicalese,
Daniele Mundici:
Optimal Binary Search with Two Unreliable Tests and Minimum Adaptiveness.
ESA 1999: 257-266 |
| 25 | | Maria Luisa Dalla Chiara,
Daniele Mundici:
Preface.
Studia Logica 62(2): 117-120 (1999) |
| 1998 |
|---|
| 24 | EE | Daniele Mundici:
Nonboolean partitions and their logic.
Soft Comput. 2(1): 18-22 (1998) |
| 23 | | Roberto Cignoli,
Daniele Mundici:
An Elementary Presentation of the Equivalence Between MV-algebras and l-groups With Strong Unit.
Studia Logica 61(1): 49-64 (1998) |
| 22 | EE | Daniele Mundici,
Nicola Olivetti:
Resolution and Model Building in the Infinite-Valued Calculus of Lukasiewicz.
Theor. Comput. Sci. 200(1-2): 335-366 (1998) |
| 1997 |
|---|
| 21 | | Georg Gottlob,
Alexander Leitsch,
Daniele Mundici:
Computational Logic and Proof Theory, 5th Kurt Gödel Colloquium, KGC'97, Vienna, Austria, August 25-29, 1997, Proceedings
Springer 1997 |
| 20 | | Maurice Boffa,
Annalisa Marcja,
Daniele Mundici:
Joint AILA-KGS Model Theory Meeting, Florence, Italy, 21-24 August 1995 - Preface.
Ann. Pure Appl. Logic 88(2-3): 93 (1997) |
| 19 | | Roberto Cignoli,
Daniele Mundici:
An Elementary Proof of Chang`s Completeness Theorem for the Infinite-valued Calculus of Lukasiewicz.
Studia Logica 58(1): 79-97 (1997) |
| 18 | EE | Daniele Mundici,
Alberto Trombetta:
Optimal Comparison Strategies in Ulam's Searching Game with Two Errors.
Theor. Comput. Sci. 182(1-2): 217-232 (1997) |
| 1996 |
|---|
| 17 | | Pierangelo Miglioli,
Ugo Moscato,
Daniele Mundici,
Mario Ornaghi:
Theorem Proving with Analytic Tableaux and Related Methods, 5th International Workshop, TABLEAUX '96, Terrasini, Palermo, Italy, May 15-17, 1996, Proceedings
Springer 1996 |
| 16 | | José Carlos Cifuentes,
Antonio Mario Sette,
Daniele Mundici:
Cauchy Completeness in Elementary Logic.
J. Symb. Log. 61(4): 1153-1157 (1996) |
| 1995 |
|---|
| 15 | | Daniele Mundici:
Averaging the truth-value in Lukasiewicz logic.
Studia Logica 55(1): 113-127 (1995) |
| 1994 |
|---|
| 14 | | Daniele Mundici:
A Constructive Proof of McNaughton's Theorem in Infinite-valued Logic.
J. Symb. Log. 59(2): 596-602 (1994) |
| 1993 |
|---|
| 13 | | Georg Gottlob,
Alexander Leitsch,
Daniele Mundici:
Computational Logic and Proof Theory, Third Kurt Gödel Colloquium, KGC'93, Brno, Czech Republic, August 24-27, 1993, Proceedings
Springer 1993 |
| 12 | | Daniele Mundici:
Ulam Games, Lukasiewicz Logic, and AF C*-Algebras.
Fundam. Inform. 18: 151-161 (1993) |
| 1992 |
|---|
| 11 | | Daniele Mundici:
Turing Complexity of Behncke-Leptin C*-algebras with a Two-Point Dual.
Ann. Math. Artif. Intell. 6(1-3): 287-293 (1992) |
| 1991 |
|---|
| 10 | | Daniele Mundici:
Normal Forms in Infinite-Valued Logic: The Case of One Variable.
CSL 1991: 272-277 |
| 1990 |
|---|
| 9 | | Daniele Mundici:
The Complexity of Adaptive Error-Correcting Codes.
CSL 1990: 300-307 |
| 1989 |
|---|
| 8 | | Daniele Mundici:
Reducibility of Monotone Formulas to µ-Formulas.
CSL 1989: 267-270 |
| 7 | EE | Jurek Czyzowicz,
Daniele Mundici,
Andrzej Pelc:
Ulam's searching game with lies.
J. Comb. Theory, Ser. A 52(1): 62-76 (1989) |
| 6 | | Daniele Mundici:
Functions Computed by Monotone Boolean Formulas with no Repeated Variables.
Theor. Comput. Sci. 66(1): 113-114 (1989) |
| 1988 |
|---|
| 5 | EE | Jurek Czyzowicz,
Andrzej Pelc,
Daniele Mundici:
Solution of Ulam's problem on binary search with two lies.
J. Comb. Theory, Ser. A 49(2): 384-388 (1988) |
| 1987 |
|---|
| 4 | | Daniele Mundici:
The Turing Complexity of AF C*-algebras with Lattice-ordered Ko.
Computation Theory and Logic 1987: 256-264 |
| 3 | | Daniele Mundici:
Satisfiability in Many-Valued Sentential Logic is NP-Complete.
Theor. Comput. Sci. 52: 145-153 (1987) |
| 1986 |
|---|
| 2 | | Daniele Mundici:
Inverse Topological Systems and Compactness in Abstract Model Theory.
J. Symb. Log. 51(3): 785-794 (1986) |
| 1981 |
|---|
| 1 | | Daniele Mundici:
An Algebraic Result about Soft Model Theoretical Equivalence Relations with an Application to H. Friedman's Fourth Problem.
J. Symb. Log. 46(3): 523-530 (1981) |
