Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Daniele Mundici
2010 – today
- 2012
[j34]Lev D. Beklemishev, Guram Bezhanishvili, Daniele Mundici, Yde Venema: Foreword. Studia Logica 100(1-2): 1-7 (2012)- 2011
- [j33]Daniele Mundici: Finite axiomatizability in Łukasiewicz logic. Ann. Pure Appl. Logic 162(12): 1035-1047 (2011)
- [j32]Daniele Mundici: A Compact [0, 1]-valued First-order Łukasiewicz Logic with Identity on Hilbert Space. J. Log. Comput. 21(3): 509-525 (2011)
- [j31]
- [j30]Daniele Mundici: Consequence and Interpolation in Łukasiewicz Logic. Studia Logica 99(1-3): 269-278 (2011)
- [p1]Ferdinando Cicalese, Daniele Mundici: Recent Developments of Feedback Coding and Its Relations with Many-Valued Logic. Proof, Computation and Agency 2011: 115-131
- [i1]Daniele Mundici, Claudia Picardi: Drawing Sound Conclusions from Unsound Premises. CoRR abs/1109.0915 (2011)
2000 – 2009
- 2009
- [j29]Daniele Mundici: Interpretation of De Finetti coherence criterion in Lukasiewicz Logic. Ann. Pure Appl. Logic 161(2): 235-245 (2009)
- [c11]
- 2008
- [j28]Shier Ju, Daniele Mundici: Many-Valued Logic and Cognition: Foreword. Studia Logica 90(1): 1-2 (2008)
- 2007
- [j27]Manuela Busaniche, Daniele Mundici: Geometry of Robinson consistency in Lukasiewicz logic. Ann. Pure Appl. Logic 147(1-2): 1-22 (2007)
- [j26]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
- [j25]Daniele Mundici: A Characterization of the free n-generated MV-algebra. Arch. Math. Log. 45(2): 239-247 (2006)
- [j24]Daniele Mundici: Bookmaking over infinite-valued events. Int. J. Approx. Reasoning 43(3): 223-240 (2006)
- 2004
- [j23]Ferdinando Cicalese, Daniele Mundici, Ugo Vaccaro: Preface. Discrete Applied Mathematics 137(1): 1-2 (2004)
- [c10]Ferdinando Cicalese, Christian Deppe, Daniele Mundici: Q-Ary Ulam-Rényi Game with Weighted Constrained Lies. COCOON 2004: 82-91
- 2003
- [j22]
- 2002
- [j21]Ferdinando Cicalese, Daniele Mundici, Ugo Vaccaro: Least adaptive optimal search with unreliable tests. Theor. Comput. Sci. 270(1-2): 877-893 (2002)
- [c9]Vincenzo Marra, Daniele Mundici: Consequence and Complexity in Infinite-Valued Logic: A Survey. ISMVL 2002: 104-
- 2001
- [j20]Daniele Mundici, Giovanni Panti: Decidable and undecidable prime theories in infinite-valued logic. Ann. Pure Appl. Logic 108(1-3): 269-278 (2001)
- [c8]Stefano Aguzzoli, Daniele Mundici: Weierstrass Approximations by Lukasiewicz Formulas with One Quantified Variable. ISMVL 2001: 361-366
- 2000
- [j19]Daniele Mundici: Foreword: Logics of Uncertainty. Journal of Logic, Language and Information 9(1): 1-3 (2000)
- [c7]Ferdinando Cicalese, Daniele Mundici: Optimal Coding with One Asymmetric Error: Below the Sphere Packing Bound. COCOON 2000: 159-169
- [c6]Ferdinando Cicalese, Ugo Vaccaro, Daniele Mundici: Least Adaptive Optimal Search with Unreliable Tests. SWAT 2000: 549-562
1990 – 1999
- 1999
- [j18]
- [c5]Ferdinando Cicalese, Daniele Mundici: Optimal Binary Search with Two Unreliable Tests and Minimum Adaptiveness. ESA 1999: 257-266
- 1998
- [j17]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)
- [j16]
- [j15]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
- [j14]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)
- [j13]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)
- [j12]Daniele Mundici, Alberto Trombetta: Optimal Comparison Strategies in Ulam's Searching Game with Two Errors. Theor. Comput. Sci. 182(1-2): 217-232 (1997)
- [e3]Georg Gottlob, Alexander Leitsch, Daniele Mundici (Eds.): Computational Logic and Proof Theory, 5th Kurt Gödel Colloquium, KGC'97, Vienna, Austria, August 25-29, 1997, Proceedings. Lecture Notes in Computer Science 1289, Springer 1997, ISBN 3-540-63385-5
- 1996
- [j11]José Carlos Cifuentes, Antonio Mario Sette, Daniele Mundici: Cauchy Completeness in Elementary Logic. J. Symb. Log. 61(4): 1153-1157 (1996)
- [e2]Pierangelo Miglioli, Ugo Moscato, Daniele Mundici, Mario Ornaghi (Eds.): Theorem Proving with Analytic Tableaux and Related Methods, 5th International Workshop, TABLEAUX '96, Terrasini, Palermo, Italy, May 15-17, 1996, Proceedings. Lecture Notes in Computer Science 1071, Springer 1996, ISBN 3-540-61208-4
- 1995
- [j10]Daniele Mundici: Averaging the truth-value in Lukasiewicz logic. Studia Logica 55(1): 113-127 (1995)
- 1994
- [j9]Daniele Mundici: A Constructive Proof of McNaughton's Theorem in Infinite-valued Logic. J. Symb. Log. 59(2): 596-602 (1994)
- 1993
- [j8]Daniele Mundici: Ulam Games, Lukasiewicz Logic, and AF C*-Algebras. Fundam. Inform. 18: 151-161 (1993)
- [e1]Georg Gottlob, Alexander Leitsch, Daniele Mundici (Eds.): Computational Logic and Proof Theory, Third Kurt Gödel Colloquium, KGC'93, Brno, Czech Republic, August 24-27, 1993, Proceedings. Lecture Notes in Computer Science 713, Springer 1993, ISBN 3-540-57184-1
- 1992
- [j7]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
- [c4]
- 1990
- [c3]
1980 – 1989
- 1989
- [j6]Jurek Czyzowicz, Daniele Mundici, Andrzej Pelc: Ulam's searching game with lies. J. Comb. Theory, Ser. A 52(1): 62-76 (1989)
- [j5]Daniele Mundici: Functions Computed by Monotone Boolean Formulas with no Repeated Variables. Theor. Comput. Sci. 66(1): 113-114 (1989)
- [c2]
- 1988
- [j4]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
- [j3]Daniele Mundici: Satisfiability in Many-Valued Sentential Logic is NP-Complete. Theor. Comput. Sci. 52: 145-153 (1987)
- [c1]Daniele Mundici: The Turing Complexity of AF C*-algebras with Lattice-ordered Ko. Computation Theory and Logic 1987: 256-264
- 1986
- [j2]Daniele Mundici: Inverse Topological Systems and Compactness in Abstract Model Theory. J. Symb. Log. 51(3): 785-794 (1986)
- 1981
- [j1]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)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-09-10 16:02 CEST by the dblp team