The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Daniele Mundici: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  37. Conditionals and Independence in Many-Valued Logics. [Citation Graph (, )][DBLP]


  38. Interpretation of De Finetti coherence criterion in Lukasiewicz Logic. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002