default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniele Mundici
Person information
- affiliation: University of Milan, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j64]Daniele Mundici:
AF-algebras with lattice-ordered K0: Logic and computation. Ann. Pure Appl. Log. 174(1): 103182 (2023)- 2022
- [j63]Daniele Mundici
:
The read once formula of a series-parallel network. Discret. Appl. Math. 320: 304-310 (2022) - [c13]Daniele Mundici:
Computing in Łukasiewicz Logic and AF-Algebras. The Logic of Software. A Tasting Menu of Formal Methods 2022: 382-396 - 2021
- [j62]Daniele Mundici:
Rota's Fubini lectures: The first problem. Adv. Appl. Math. 125: 102153 (2021) - [j61]Daniele Mundici:
Deciding Koopman's qualitative probability. Artif. Intell. 299: 103524 (2021) - [j60]Daniele Mundici:
The differential of probabilistic entailment. Ann. Pure Appl. Log. 172(6): 102945 (2021) - [i3]Daniele Mundici:
Polytime reductions of AF-algebraic problems. CoRR abs/2104.14415 (2021) - 2020
- [j59]Daniele Mundici:
What the łukasiewicz Axioms mean. J. Symb. Log. 85(3): 906-917 (2020) - [c12]Daniele Mundici:
Computing on Lattice-Ordered Abelian Groups. Fields of Logic and Computation III 2020: 210-225
2010 – 2019
- 2019
- [j58]Daniele Mundici:
Preservation properties of De Finetti Coherence. FLAP 6(2): 383-396 (2019) - [j57]Daniele Mundici:
Betting on continuous independent events. Soft Comput. 23(7): 2289-2295 (2019) - [j56]Daniele Mundici:
De Finetti coherence and the product law for independent events. Synth. 196(1): 265-271 (2019) - 2017
- [j55]Leonardo Manuel Cabrer, Daniele Mundici:
Germinal theories in Łukasiewicz logic. Ann. Pure Appl. Log. 168(5): 1132-1151 (2017) - [j54]Daniele Mundici, Claudia Picardi:
Faulty sets of Boolean formulas and Łukasiewicz logic. J. Log. Comput. 27(2): 497-507 (2017) - [j53]Antonio Di Nola, Daniele Mundici, Carlo Toffalori, Aldo Ursini:
Preface. Soft Comput. 21(1): 9 (2017) - [j52]Daniele Mundici:
Coherence of de Finetti coherence. Synth. 194(10): 4055-4063 (2017) - [i2]Daniele Mundici:
Word problems in Elliott monoids. CoRR abs/1711.01947 (2017) - 2016
- [j51]Manuela Busaniche, Leonardo Manuel Cabrer, Daniele Mundici:
Polyhedral MV-algebras. Fuzzy Sets Syst. 292: 150-159 (2016) - [j50]Daniele Mundici:
Logic on the n-cube. J. Log. Comput. 26(1): 409-424 (2016) - [p3]Daniele Mundici:
A Geometric Approach to MV-Algebras. On Logical, Algebraic, and Probabilistic Aspects of Fuzzy Set Theory 2016: 57-70 - 2015
- [j49]Leonardo Manuel Cabrer, Daniele Mundici:
Severi-Bouligand tangents, Frenet frames and Riesz spaces. Adv. Appl. Math. 64: 1-20 (2015) - [j48]Leonardo Manuel Cabrer, Daniele Mundici:
A Stone-Weierstrass theorem for MV-algebras and unital ℓ-groups. J. Log. Comput. 25(3): 683-699 (2015) - 2014
- [j47]Daniele Mundici:
Invariant Measure Under the Affine Group Over. Comb. Probab. Comput. 23(2): 248-268 (2014) - [j46]Leonardo Manuel Cabrer, Daniele Mundici:
Interval MV-algebras and generalizations. Int. J. Approx. Reason. 55(8): 1623-1642 (2014) - [j45]Daniele Mundici:
Universal Properties of Łukasiewicz Consequence. Logica Universalis 8(1): 17-24 (2014) - 2012
- [j44]Lev D. Beklemishev, Guram Bezhanishvili, Daniele Mundici, Yde Venema:
Foreword. Stud Logica 100(1-2): 1-7 (2012) - 2011
- [j43]Daniele Mundici:
Finite axiomatizability in Łukasiewicz logic. Ann. Pure Appl. Log. 162(12): 1035-1047 (2011) - [j42]Daniele Mundici:
A Compact [0, 1]-valued First-order Łukasiewicz Logic with Identity on Hilbert Space. J. Log. Comput. 21(3): 509-525 (2011) - [j41]Daniele Mundici, Itala M. Loffredo D'Ottaviano:
Foreword. Stud Logica 97(1): 1-5 (2011) - [j40]Daniele Mundici:
Consequence and Interpolation in Łukasiewicz Logic. Stud Logica 99(1-3): 269-278 (2011) - [p2]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
- [j39]Daniele Mundici:
Interpretation of De Finetti coherence criterion in Lukasiewicz Logic. Ann. Pure Appl. Log. 161(2): 235-245 (2009) - [c11]Daniele Mundici:
Conditionals and Independence in Many-Valued Logics. ECSQARU 2009: 16-21 - [p1]Daniele Mundici:
Faithful and Invariant Conditional Probability in Łukasiewicz Logic. Towards Mathematical Philosophy 2009: 213-232 - 2008
- [j38]Shier Ju, Daniele Mundici:
Many-Valued Logic and Cognition: Foreword. Stud Logica 90(1): 1-2 (2008) - 2007
- [j37]Manuela Busaniche, Daniele Mundici:
Geometry of Robinson consistency in Lukasiewicz logic. Ann. Pure Appl. Log. 147(1-2): 1-22 (2007) - [j36]Jan Kühr, Daniele Mundici:
De Finetti theorem and Borel states in [0, 1]-valued algebraic logic. Int. J. Approx. Reason. 46(3): 605-616 (2007) - 2006
- [j35]Daniele Mundici:
A Characterization of the free n-generated MV-algebra. Arch. Math. Log. 45(2): 239-247 (2006) - [j34]Daniele Mundici:
Bookmaking over infinite-valued events. Int. J. Approx. Reason. 43(3): 223-240 (2006) - [j33]Roberto Cignoli, Daniele Mundici, Mirko Navara:
Kleene-Isomorphic s -Complete MV-Algebras with Product are Isomorphic. J. Multiple Valued Log. Soft Comput. 12(1-2): 1-8 (2006) - 2004
- [j32]Ferdinando Cicalese, Daniele Mundici, Ugo Vaccaro:
Preface. Discret. Appl. Math. 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
- [j31]Silvio Ghilardi, Daniele Mundici:
Foreword. Stud Logica 73(1): 3 (2003) - 2002
- [j30]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-115 - 2001
- [j29]Daniele Mundici, Giovanni Panti:
Decidable and undecidable prime theories in infinite-valued logic. Ann. Pure Appl. Log. 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
- [j28]Ferdinando Cicalese, Daniele Mundici:
Perfect Two-Fault Tolerant Search with Minimum Adaptiveness. Adv. Appl. Math. 25(1): 65-101 (2000) - [j27]Daniele Mundici:
Foreword: Logics of Uncertainty. J. Log. Lang. Inf. 9(1): 1-3 (2000) - [j26]Costas A. Drossos, Daniele Mundici:
Many-Valued Points and Equality. Synth. 125(1-2): 77-95 (2000) - [j25]Costas A. Drossos, Daniele Mundici:
Many-Valued Points And Equality. Synth. 125(1-2): 97-101 (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
- [j24]Maria Luisa Dalla Chiara, Daniele Mundici:
Preface. Stud Logica 62(2): 117-120 (1999) - [c5]Ferdinando Cicalese, Daniele Mundici:
Optimal Binary Search with Two Unreliable Tests and Minimum Adaptiveness. ESA 1999: 257-266 - 1998
- [j23]Roberto Cignoli, Daniele Mundici:
An Elementary Presentation of the Equivalence Between MV-algebras and l-groups With Strong Unit. Stud Logica 61(1): 49-64 (1998) - [j22]Daniele Mundici:
Nonboolean partitions and their logic. Soft Comput. 2(1): 18-22 (1998) - [j21]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
- [j20]Maurice Boffa, Annalisa Marcja, Daniele Mundici:
Joint AILA-KGS Model Theory Meeting, Florence, Italy, 21-24 August 1995 - Preface. Ann. Pure Appl. Log. 88(2-3): 93 (1997) - [j19]Roberto Cignoli, Daniele Mundici:
An Elementary Proof of Chang's Completeness Theorem for the Infinite-valued Calculus of Lukasiewicz. Stud Logica 58(1): 79-97 (1997) - [j18]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:
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 [contents] - 1996
- [j17]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:
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 [contents] - 1995
- [j16]Daniele Mundici:
Averaging the truth-value in Lukasiewicz logic. Stud Logica 55(1): 113-127 (1995) - 1994
- [j15]Daniele Mundici:
A Constructive Proof of McNaughton's Theorem in Infinite-valued Logic. J. Symb. Log. 59(2): 596-602 (1994) - 1993
- [j14]Daniele Mundici:
Ulam Games, Lukasiewicz Logic, and AF C*-Algebras. Fundam. Informaticae 18: 151-161 (1993) - [e1]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. Lecture Notes in Computer Science 713, Springer 1993, ISBN 3-540-57184-1 [contents] - 1992
- [j13]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]Daniele Mundici:
Normal Forms in Infinite-Valued Logic: The Case of One Variable. CSL 1991: 272-277 - 1990
- [c3]Daniele Mundici:
The Complexity of Adaptive Error-Correcting Codes. CSL 1990: 300-307
1980 – 1989
- 1989
- [j12]Jurek Czyzowicz, Daniele Mundici, Andrzej Pelc:
Ulam's searching game with lies. J. Comb. Theory A 52(1): 62-76 (1989) - [j11]Daniele Mundici:
Functions Computed by Monotone Boolean Formulas with no Repeated Variables. Theor. Comput. Sci. 66(1): 113-114 (1989) - [c2]Daniele Mundici:
Reducibility of Monotone Formulas to µ-Formulas. CSL 1989: 267-270 - 1988
- [j10]Jurek Czyzowicz, Andrzej Pelc, Daniele Mundici:
Solution of Ulam's problem on binary search with two lies. J. Comb. Theory A 49(2): 384-388 (1988) - 1987
- [j9]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
- [j8]Daniele Mundici:
Inverse Topological Systems and Compactness in Abstract Model Theory. J. Symb. Log. 51(3): 785-794 (1986) - 1984
- [j7]Daniele Mundici:
Tautologies with a unique craig interpolant, uniform vs. nonuniform complexity. Ann. Pure Appl. Log. 27(3): 265-273 (1984) - 1983
- [j6]Daniele Mundici:
A lower bound for the complexity of Craig's interpolants in sentential logic. Arch. Math. Log. 23(1): 27-36 (1983) - [j5]Daniele Mundici:
Natural limitations of decision procedures for arithmetic with bounded quantifiers. Arch. Math. Log. 23(1): 37-54 (1983) - 1982
- [j4]Daniele Mundici:
Compactness, interpolation and Friedman's third problem. Ann. Math. Log. 22(2): 197-211 (1982) - 1981
- [j3]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) - [j2]Daniele Mundici:
Applications of Many-Sorted Robinson Consistency Theorem. Math. Log. Q. 27(11-12): 181-188 (1981) - 1980
- [j1]Daniele Mundici:
Interpolation, compactness and JEP in soft model theory. Arch. Math. Log. 22(1-2): 61-67 (1980)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
