Daniele Mundici

Ann. Pure Appl. Log., 2023

2022

The read once formula of a series-parallel network.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

Computing in Łukasiewicz Logic and AF-Algebras.

[BibT_eX]

[DOI]

Proceedings of the Logic of Software. A Tasting Menu of Formal Methods, 2022

2021

Polytime reductions of AF-algebraic problems.

[BibT_eX]

[DOI]

CoRR, 2021

The differential of probabilistic entailment.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2021

Deciding Koopman's qualitative probability.

[BibT_eX]

[DOI]

Artif. Intell., 2021

Rota's Fubini lectures: The first problem.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2021

2020

What the łukasiewicz Axioms mean.

[BibT_eX]

[DOI]

J. Symb. Log., 2020

Computing on Lattice-Ordered Abelian Groups.

[BibT_eX]

[DOI]

Proceedings of the Fields of Logic and Computation III, 2020

2019

De Finetti coherence and the product law for independent events.

[BibT_eX]

[DOI]

Synth., 2019

Betting on continuous independent events.

[BibT_eX]

[DOI]

Soft Comput., 2019

Preservation properties of De Finetti Coherence.

[BibT_eX]

[DOI]

FLAP, 2019

2017

Coherence of de Finetti coherence.

[BibT_eX]

[DOI]

Synth., 2017

Preface.

[BibT_eX]

[DOI]

Soft Comput., 2017

Faulty sets of Boolean formulas and Łukasiewicz logic.

[BibT_eX]

[DOI]

Claudia Picardi

J. Log. Comput., 2017

Word problems in Elliott monoids.

[BibT_eX]

[DOI]

CoRR, 2017

Germinal theories in Łukasiewicz logic.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2017

2016

A Geometric Approach to MV-Algebras.

[BibT_eX]

[DOI]

Proceedings of the On Logical, Algebraic, and Probabilistic Aspects of Fuzzy Set Theory, 2016

Logic on the n-cube.

[BibT_eX]

[DOI]

J. Log. Comput., 2016

Polyhedral MV-algebras.

[BibT_eX]

[DOI]

Manuela Busaniche

Fuzzy Sets Syst., 2016

2015

A Stone-Weierstrass theorem for MV-algebras and unital ℓ-groups.

[BibT_eX]

[DOI]

J. Log. Comput., 2015

Severi-Bouligand tangents, Frenet frames and Riesz spaces.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2015

2014

Universal Properties of Łukasiewicz Consequence.

[BibT_eX]

[DOI]

Logica Universalis, 2014

Interval MV-algebras and generalizations.

[BibT_eX]

[DOI]

Int. J. Approx. Reason., 2014

Invariant Measure Under the Affine Group Over.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2014

2012

Foreword.

[BibT_eX]

[DOI]

Stud Logica, 2012

2011

Foreword.

[BibT_eX]

[DOI]

Itala M. Loffredo D'Ottaviano

Stud Logica, 2011

Consequence and Interpolation in Łukasiewicz Logic.

[BibT_eX]

[DOI]

Stud Logica, 2011

A Compact [0, 1]-valued First-order Łukasiewicz Logic with Identity on Hilbert Space.

[BibT_eX]

[DOI]

J. Log. Comput., 2011

Drawing Sound Conclusions from Unsound Premises

[BibT_eX]

[DOI]

Claudia Picardi

CoRR, 2011

Finite axiomatizability in Łukasiewicz logic.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2011

Recent Developments of Feedback Coding and Its Relations with Many-Valued Logic.

[BibT_eX]

[DOI]

Proceedings of the Proof, Computation and Agency - Logic at the Crossroads., 2011

2009

Interpretation of De Finetti coherence criterion in Lukasiewicz Logic.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2009

Conditionals and Independence in Many-Valued Logics.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2009

Faithful and Invariant Conditional Probability in Łukasiewicz Logic.

[BibT_eX]

[DOI]

Proceedings of the Towards Mathematical Philosophy, 2009

2008

Many-Valued Logic and Cognition: Foreword.

[BibT_eX]

[DOI]

Shier Ju

Stud Logica, 2008

2007

De Finetti theorem and Borel states in [0, 1]-valued algebraic logic.

[BibT_eX]

[DOI]

Jan Kühr

Int. J. Approx. Reason., 2007

Geometry of Robinson consistency in Lukasiewicz logic.

[BibT_eX]

[DOI]

Manuela Busaniche

Ann. Pure Appl. Log., 2007

2006

Kleene-Isomorphic s -Complete MV-Algebras with Product are Isomorphic.

[BibT_eX]

[DOI]

Roberto Cignoli

Mirko Navara

J. Multiple Valued Log. Soft Comput., 2006

Bookmaking over infinite-valued events.

[BibT_eX]

[DOI]

Int. J. Approx. Reason., 2006

A Characterization of the free n-generated MV-algebra.

[BibT_eX]

[DOI]

Arch. Math. Log., 2006

2004

Preface.

[BibT_eX]

[DOI]

Ugo Vaccaro

Discret. Appl. Math., 2004

Q-Ary Ulam-Rényi Game with Weighted Constrained Lies.

[BibT_eX]

[DOI]

Christian Deppe

Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004

2003

Foreword.

[BibT_eX]

[DOI]

Silvio Ghilardi

Stud Logica, 2003

2002

Least adaptive optimal search with unreliable tests.

[BibT_eX]

[DOI]

Ugo Vaccaro

Theor. Comput. Sci., 2002

Consequence and Complexity in Infinite-Valued Logic: A Survey.

[BibT_eX]

[DOI]

Vincenzo Marra

Proceedings of the 32nd IEEE International Symposium on Multiple-Valued Logic (ISMVL 2002), 2002

2001

Decidable and undecidable prime theories in infinite-valued logic.

[BibT_eX]

[DOI]

Giovanni Panti

Ann. Pure Appl. Log., 2001

Weierstrass Approximations by Lukasiewicz Formulas with One Quantified Variable.

[BibT_eX]

[DOI]

Stefano Aguzzoli

Proceedings of the 31st IEEE International Symposium on Multiple-Valued Logic, 2001

2000

Many-Valued Points and Equality.

[BibT_eX]

[DOI]

Costas A. Drossos

Synth., 2000

Foreword: Logics of Uncertainty.

[BibT_eX]

[DOI]

J. Log. Lang. Inf., 2000

Perfect Two-Fault Tolerant Search with Minimum Adaptiveness.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2000

Optimal Coding with One Asymmetric Error: Below the Sphere Packing Bound.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000

1999

Preface.

[BibT_eX]

[DOI]

Maria Luisa Dalla Chiara

Stud Logica, 1999

Optimal Binary Search with Two Unreliable Tests and Minimum Adaptiveness.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1999

1998

Resolution and Model Building in the Infinite-Valued Calculus of Lukasiewicz.

[BibT_eX]

[DOI]

Nicola Olivetti

Theor. Comput. Sci., 1998

Nonboolean partitions and their logic.

[BibT_eX]

[DOI]

Soft Comput., 1998

An Elementary Presentation of the Equivalence Between MV-algebras and l-groups With Strong Unit.

[BibT_eX]

[DOI]

Roberto Cignoli

Stud Logica, 1998

1997

Optimal Comparison Strategies in Ulam's Searching Game with Two Errors.

[BibT_eX]

[DOI]

Alberto Trombetta

Theor. Comput. Sci., 1997

An Elementary Proof of Chang's Completeness Theorem for the Infinite-valued Calculus of Lukasiewicz.

[BibT_eX]

[DOI]

Roberto Cignoli

Stud Logica, 1997

Joint AILA-KGS Model Theory Meeting, Florence, Italy, 21-24 August 1995 - Preface.

[BibT_eX]

Maurice Boffa

Annalisa Marcja

Ann. Pure Appl. Log., 1997

1996

Cauchy Completeness in Elementary Logic.

[BibT_eX]

[DOI]

José Carlos Cifuentes

Antonio Mario Sette

J. Symb. Log., 1996

1995

Averaging the truth-value in Lukasiewicz logic.

[BibT_eX]

[DOI]

Stud Logica, 1995

1994

A Constructive Proof of McNaughton's Theorem in Infinite-valued Logic.

[BibT_eX]

[DOI]

J. Symb. Log., 1994

1993

Ulam Games, Lukasiewicz Logic, and AF C*-Algebras.

[BibT_eX]

Fundam. Informaticae, 1993

1992

Turing Complexity of Behncke-Leptin C*-algebras with a Two-Point Dual.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 1992

1991

Normal Forms in Infinite-Valued Logic: The Case of One Variable.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 5th Workshop, 1991

1990

The Complexity of Adaptive Error-Correcting Codes.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 4th Workshop, 1990

1989

Functions Computed by Monotone Boolean Formulas with no Repeated Variables.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1989

Ulam's searching game with lies.

[BibT_eX]

[DOI]

Jurek Czyzowicz

Andrzej Pelc

J. Comb. Theory A, 1989

Reducibility of Monotone Formulas to µ-Formulas.

[BibT_eX]

[DOI]

Proceedings of the CSL '89, 1989

1988

Solution of Ulam's problem on binary search with two lies.

[BibT_eX]

[DOI]

Jurek Czyzowicz

Andrzej Pelc

J. Comb. Theory A, 1988

1987

Satisfiability in Many-Valued Sentential Logic is NP-Complete.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1987

The Turing Complexity of AF C*-algebras with Lattice-ordered Ko.

[BibT_eX]

[DOI]

Proceedings of the Computation Theory and Logic, In Memory of Dieter Rödding, 1987

1986

Inverse Topological Systems and Compactness in Abstract Model Theory.

[BibT_eX]

[DOI]

J. Symb. Log., 1986

1984

Tautologies with a unique craig interpolant, uniform vs. nonuniform complexity.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1984

1983

Natural limitations of decision procedures for arithmetic with bounded quantifiers.

[BibT_eX]

[DOI]

Arch. Math. Log., 1983

A lower bound for the complexity of Craig's interpolants in sentential logic.

[BibT_eX]

[DOI]

Arch. Math. Log., 1983

1982

Compactness, interpolation and Friedman's third problem.

[BibT_eX]

[DOI]

Ann. Math. Log., 1982

1981

Applications of Many-Sorted Robinson Consistency Theorem.

[BibT_eX]

[DOI]

Math. Log. Q., 1981

An Algebraic Result about Soft Model Theoretical Equivalence Relations with an Application to H. Friedman's Fourth Problem.

[BibT_eX]

[DOI]

J. Symb. Log., 1981

1980

Interpolation, compactness and JEP in soft model theory.

[BibT_eX]

[DOI]